./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-const-race.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-const-race.i -s /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 41e9a0ce256413bbe9395ce46c577e8e397815c89d0a7ebc13378431abe8f93d
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-10-25 15:18:34,318 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-10-25 15:18:34,328 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-10-25 15:18:34,379 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-10-25 15:18:34,379 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-10-25 15:18:34,380 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-10-25 15:18:34,381 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-10-25 15:18:34,382 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-10-25 15:18:34,384 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-10-25 15:18:34,384 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-10-25 15:18:34,402 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-10-25 15:18:34,406 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-10-25 15:18:34,406 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-10-25 15:18:34,412 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-10-25 15:18:34,414 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-10-25 15:18:34,416 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-10-25 15:18:34,417 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-10-25 15:18:34,419 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-10-25 15:18:34,419 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-10-25 15:18:34,423 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-10-25 15:18:34,424 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-10-25 15:18:34,426 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-10-25 15:18:34,427 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-10-25 15:18:34,428 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-10-25 15:18:34,430 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-10-25 15:18:34,431 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-10-25 15:18:34,431 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-10-25 15:18:34,432 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-10-25 15:18:34,433 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-10-25 15:18:34,433 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-10-25 15:18:34,433 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-10-25 15:18:34,434 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-10-25 15:18:34,450 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-10-25 15:18:34,451 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-10-25 15:18:34,453 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-10-25 15:18:34,453 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-10-25 15:18:34,453 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-10-25 15:18:34,454 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-10-25 15:18:34,454 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-10-25 15:18:34,455 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-10-25 15:18:34,455 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-10-25 15:18:34,456 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-10-25 15:18:34,507 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-10-25 15:18:34,507 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-25 15:18:34,507 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-25 15:18:34,508 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-25 15:18:34,508 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-10-25 15:18:34,509 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-10-25 15:18:34,509 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-25 15:18:34,509 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-25 15:18:34,509 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-10-25 15:18:34,510 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-25 15:18:34,510 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-10-25 15:18:34,510 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-25 15:18:34,511 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-10-25 15:18:34,511 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-10-25 15:18:34,511 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-25 15:18:34,511 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-10-25 15:18:34,511 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-10-25 15:18:34,511 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-10-25 15:18:34,512 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-10-25 15:18:34,512 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-10-25 15:18:34,512 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-25 15:18:34,512 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-10-25 15:18:34,512 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-10-25 15:18:34,512 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-25 15:18:34,513 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-25 15:18:34,513 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-10-25 15:18:34,513 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-25 15:18:34,513 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-25 15:18:34,513 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-10-25 15:18:34,514 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-10-25 15:18:34,514 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-10-25 15:18:34,514 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-10-25 15:18:34,515 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-10-25 15:18:34,515 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-10-25 15:18:34,515 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-10-25 15:18:34,515 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-10-25 15:18:34,515 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-10-25 15:18:34,515 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 41e9a0ce256413bbe9395ce46c577e8e397815c89d0a7ebc13378431abe8f93d
[2023-10-25 15:18:34,883 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-25 15:18:34,905 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-25 15:18:34,907 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-25 15:18:34,914 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-25 15:18:34,914 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-25 15:18:34,915 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-const-race.i
[2023-10-25 15:18:36,590 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-25 15:18:36,953 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-25 15:18:36,961 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-const-race.i
[2023-10-25 15:18:36,973 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/31e21cdd9/2f969478eb6c45089d065ba781f5dacf/FLAGcf9a3a1cf
[2023-10-25 15:18:37,010 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/31e21cdd9/2f969478eb6c45089d065ba781f5dacf
[2023-10-25 15:18:37,016 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-25 15:18:37,017 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-25 15:18:37,018 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-25 15:18:37,018 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-25 15:18:37,020 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-25 15:18:37,029 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 03:18:37" (1/1) ...
[2023-10-25 15:18:37,030 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78f6ec6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:18:37, skipping insertion in model container
[2023-10-25 15:18:37,030 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 03:18:37" (1/1) ...
[2023-10-25 15:18:37,036 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-25 15:18:37,107 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-25 15:18:37,518 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-25 15:18:37,542 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-25 15:18:37,617 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-25 15:18:37,658 INFO  L208         MainTranslator]: Completed translation
[2023-10-25 15:18:37,673 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:18:37 WrapperNode
[2023-10-25 15:18:37,674 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-25 15:18:37,675 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-25 15:18:37,675 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-25 15:18:37,675 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-25 15:18:37,680 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:18:37" (1/1) ...
[2023-10-25 15:18:37,697 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:18:37" (1/1) ...
[2023-10-25 15:18:37,731 INFO  L138                Inliner]: procedures = 156, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53
[2023-10-25 15:18:37,733 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-25 15:18:37,733 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-25 15:18:37,734 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-25 15:18:37,734 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-25 15:18:37,741 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:18:37" (1/1) ...
[2023-10-25 15:18:37,748 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:18:37" (1/1) ...
[2023-10-25 15:18:37,767 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:18:37" (1/1) ...
[2023-10-25 15:18:37,770 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:18:37" (1/1) ...
[2023-10-25 15:18:37,775 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:18:37" (1/1) ...
[2023-10-25 15:18:37,792 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:18:37" (1/1) ...
[2023-10-25 15:18:37,800 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:18:37" (1/1) ...
[2023-10-25 15:18:37,801 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:18:37" (1/1) ...
[2023-10-25 15:18:37,803 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-25 15:18:37,804 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-25 15:18:37,806 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-25 15:18:37,806 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-25 15:18:37,806 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:18:37" (1/1) ...
[2023-10-25 15:18:37,810 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-25 15:18:37,825 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:18:37,836 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-10-25 15:18:37,858 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-10-25 15:18:37,879 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-10-25 15:18:37,884 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-10-25 15:18:37,884 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2023-10-25 15:18:37,884 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-10-25 15:18:37,884 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-10-25 15:18:37,884 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-25 15:18:37,885 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-10-25 15:18:37,885 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-25 15:18:37,885 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-25 15:18:37,885 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-25 15:18:37,885 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-25 15:18:37,887 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-10-25 15:18:38,068 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-25 15:18:38,077 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-25 15:18:38,387 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-25 15:18:38,392 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-25 15:18:38,401 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-25 15:18:38,403 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 03:18:38 BoogieIcfgContainer
[2023-10-25 15:18:38,408 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-25 15:18:38,409 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-25 15:18:38,409 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-25 15:18:38,412 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-25 15:18:38,412 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 03:18:37" (1/3) ...
[2023-10-25 15:18:38,412 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43360ae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 03:18:38, skipping insertion in model container
[2023-10-25 15:18:38,421 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:18:37" (2/3) ...
[2023-10-25 15:18:38,421 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43360ae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 03:18:38, skipping insertion in model container
[2023-10-25 15:18:38,422 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 03:18:38" (3/3) ...
[2023-10-25 15:18:38,423 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-array-const-race.i
[2023-10-25 15:18:38,429 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-25 15:18:38,438 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-25 15:18:38,450 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2023-10-25 15:18:38,450 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-25 15:18:38,534 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-10-25 15:18:38,575 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 71 places, 71 transitions, 150 flow
[2023-10-25 15:18:38,659 INFO  L130       PetriNetUnfolder]: 5/97 cut-off events.
[2023-10-25 15:18:38,659 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-25 15:18:38,663 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 103 conditions, 97 events. 5/97 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 189 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. 
[2023-10-25 15:18:38,675 INFO  L82        GeneralOperation]: Start removeDead. Operand has 71 places, 71 transitions, 150 flow
[2023-10-25 15:18:38,679 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 71 places, 71 transitions, 150 flow
[2023-10-25 15:18:38,681 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 15:18:38,688 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 71 transitions, 150 flow
[2023-10-25 15:18:38,703 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 71 transitions, 150 flow
[2023-10-25 15:18:38,703 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 71 places, 71 transitions, 150 flow
[2023-10-25 15:18:38,756 INFO  L130       PetriNetUnfolder]: 5/97 cut-off events.
[2023-10-25 15:18:38,767 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-25 15:18:38,767 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 103 conditions, 97 events. 5/97 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 189 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. 
[2023-10-25 15:18:38,768 INFO  L119        LiptonReduction]: Number of co-enabled transitions 896
[2023-10-25 15:18:40,774 INFO  L134        LiptonReduction]: Checked pairs total: 1340
[2023-10-25 15:18:40,774 INFO  L136        LiptonReduction]: Total number of compositions: 56
[2023-10-25 15:18:40,806 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 15:18:40,812 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@70b754cc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 15:18:40,812 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2023-10-25 15:18:40,817 INFO  L130       PetriNetUnfolder]: 0/4 cut-off events.
[2023-10-25 15:18:40,817 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:18:40,817 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:18:40,818 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2023-10-25 15:18:40,819 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-10-25 15:18:40,823 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:18:40,823 INFO  L85        PathProgramCache]: Analyzing trace with hash 259358, now seen corresponding path program 1 times
[2023-10-25 15:18:40,830 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:18:40,850 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108766735]
[2023-10-25 15:18:40,850 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:18:40,851 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:18:40,983 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:18:41,195 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:18:41,196 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:18:41,196 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108766735]
[2023-10-25 15:18:41,196 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108766735] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:18:41,197 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:18:41,197 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:18:41,198 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782291848]
[2023-10-25 15:18:41,198 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:18:41,217 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:18:41,217 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:18:41,258 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:18:41,260 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:18:41,296 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 64 out of 127
[2023-10-25 15:18:41,298 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 18 transitions, 44 flow. Second operand  has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:41,299 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:18:41,299 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 127
[2023-10-25 15:18:41,300 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:18:41,398 INFO  L130       PetriNetUnfolder]: 18/68 cut-off events.
[2023-10-25 15:18:41,399 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-25 15:18:41,399 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 131 conditions, 68 events. 18/68 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 212 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 99. Up to 48 conditions per place. 
[2023-10-25 15:18:41,401 INFO  L137   encePairwiseOnDemand]: 123/127 looper letters, 15 selfloop transitions, 2 changer transitions 0/21 dead transitions.
[2023-10-25 15:18:41,402 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 21 transitions, 84 flow
[2023-10-25 15:18:41,403 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:18:41,405 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:18:41,412 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 211 transitions.
[2023-10-25 15:18:41,414 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5538057742782152
[2023-10-25 15:18:41,414 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 211 transitions.
[2023-10-25 15:18:41,415 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 211 transitions.
[2023-10-25 15:18:41,431 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:18:41,433 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 211 transitions.
[2023-10-25 15:18:41,438 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:41,442 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:41,443 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:41,445 INFO  L175             Difference]: Start difference. First operand has 20 places, 18 transitions, 44 flow. Second operand 3 states and 211 transitions.
[2023-10-25 15:18:41,445 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 21 transitions, 84 flow
[2023-10-25 15:18:41,447 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 21 transitions, 84 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:18:41,448 INFO  L231             Difference]: Finished difference. Result has 22 places, 17 transitions, 50 flow
[2023-10-25 15:18:41,450 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=22, PETRI_TRANSITIONS=17}
[2023-10-25 15:18:41,465 INFO  L288   CegarLoopForPetriNet]: 20 programPoint places, 2 predicate places.
[2023-10-25 15:18:41,466 INFO  L495      AbstractCegarLoop]: Abstraction has has 22 places, 17 transitions, 50 flow
[2023-10-25 15:18:41,466 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:41,466 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:18:41,466 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2023-10-25 15:18:41,467 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-10-25 15:18:41,467 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-10-25 15:18:41,467 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:18:41,467 INFO  L85        PathProgramCache]: Analyzing trace with hash -845397772, now seen corresponding path program 1 times
[2023-10-25 15:18:41,468 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:18:41,469 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683404273]
[2023-10-25 15:18:41,470 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:18:41,471 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:18:41,519 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:18:41,570 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:18:41,571 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:18:41,571 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683404273]
[2023-10-25 15:18:41,571 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683404273] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:18:41,572 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:18:41,572 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:18:41,572 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27553729]
[2023-10-25 15:18:41,575 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:18:41,576 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:18:41,576 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:18:41,576 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:18:41,577 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:18:41,595 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 61 out of 127
[2023-10-25 15:18:41,595 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 17 transitions, 50 flow. Second operand  has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:41,607 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:18:41,607 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 127
[2023-10-25 15:18:41,607 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:18:41,666 INFO  L130       PetriNetUnfolder]: 20/70 cut-off events.
[2023-10-25 15:18:41,666 INFO  L131       PetriNetUnfolder]: For 7/7 co-relation queries the response was YES.
[2023-10-25 15:18:41,667 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 151 conditions, 70 events. 20/70 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 208 event pairs, 13 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 122. Up to 48 conditions per place. 
[2023-10-25 15:18:41,667 INFO  L137   encePairwiseOnDemand]: 123/127 looper letters, 17 selfloop transitions, 3 changer transitions 1/24 dead transitions.
[2023-10-25 15:18:41,667 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 24 transitions, 111 flow
[2023-10-25 15:18:41,668 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:18:41,668 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:18:41,671 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 205 transitions.
[2023-10-25 15:18:41,672 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5380577427821522
[2023-10-25 15:18:41,672 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 205 transitions.
[2023-10-25 15:18:41,672 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 205 transitions.
[2023-10-25 15:18:41,672 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:18:41,673 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 205 transitions.
[2023-10-25 15:18:41,674 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:41,676 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:41,676 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:41,676 INFO  L175             Difference]: Start difference. First operand has 22 places, 17 transitions, 50 flow. Second operand 3 states and 205 transitions.
[2023-10-25 15:18:41,676 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 24 transitions, 111 flow
[2023-10-25 15:18:41,677 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 24 transitions, 105 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:18:41,678 INFO  L231             Difference]: Finished difference. Result has 23 places, 19 transitions, 65 flow
[2023-10-25 15:18:41,678 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=23, PETRI_TRANSITIONS=19}
[2023-10-25 15:18:41,678 INFO  L288   CegarLoopForPetriNet]: 20 programPoint places, 3 predicate places.
[2023-10-25 15:18:41,679 INFO  L495      AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 65 flow
[2023-10-25 15:18:41,679 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:41,679 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:18:41,679 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1]
[2023-10-25 15:18:41,679 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-10-25 15:18:41,680 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-10-25 15:18:41,680 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:18:41,680 INFO  L85        PathProgramCache]: Analyzing trace with hash -845390790, now seen corresponding path program 1 times
[2023-10-25 15:18:41,680 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:18:41,681 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923991403]
[2023-10-25 15:18:41,681 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:18:41,682 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:18:41,737 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:18:41,737 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-25 15:18:41,767 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:18:41,800 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-25 15:18:41,800 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-25 15:18:41,802 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining)
[2023-10-25 15:18:41,804 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining)
[2023-10-25 15:18:41,804 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining)
[2023-10-25 15:18:41,804 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining)
[2023-10-25 15:18:41,805 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining)
[2023-10-25 15:18:41,805 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-10-25 15:18:41,805 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2023-10-25 15:18:41,809 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-25 15:18:41,809 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-10-25 15:18:41,847 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-10-25 15:18:41,851 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 88 places, 87 transitions, 192 flow
[2023-10-25 15:18:41,893 INFO  L130       PetriNetUnfolder]: 10/173 cut-off events.
[2023-10-25 15:18:41,893 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-25 15:18:41,895 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 187 conditions, 173 events. 10/173 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 414 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 99. Up to 8 conditions per place. 
[2023-10-25 15:18:41,895 INFO  L82        GeneralOperation]: Start removeDead. Operand has 88 places, 87 transitions, 192 flow
[2023-10-25 15:18:41,901 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 88 places, 87 transitions, 192 flow
[2023-10-25 15:18:41,901 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 15:18:41,901 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 87 transitions, 192 flow
[2023-10-25 15:18:41,902 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 87 transitions, 192 flow
[2023-10-25 15:18:41,902 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 88 places, 87 transitions, 192 flow
[2023-10-25 15:18:41,936 INFO  L130       PetriNetUnfolder]: 10/173 cut-off events.
[2023-10-25 15:18:41,936 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-25 15:18:41,937 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 187 conditions, 173 events. 10/173 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 414 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 99. Up to 8 conditions per place. 
[2023-10-25 15:18:41,939 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2492
[2023-10-25 15:18:43,799 INFO  L134        LiptonReduction]: Checked pairs total: 5100
[2023-10-25 15:18:43,799 INFO  L136        LiptonReduction]: Total number of compositions: 61
[2023-10-25 15:18:43,801 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 15:18:43,802 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@70b754cc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 15:18:43,802 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2023-10-25 15:18:43,803 INFO  L130       PetriNetUnfolder]: 0/5 cut-off events.
[2023-10-25 15:18:43,803 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:18:43,803 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:18:43,803 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2023-10-25 15:18:43,803 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-10-25 15:18:43,803 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:18:43,803 INFO  L85        PathProgramCache]: Analyzing trace with hash 422177, now seen corresponding path program 1 times
[2023-10-25 15:18:43,804 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:18:43,804 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889736973]
[2023-10-25 15:18:43,804 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:18:43,804 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:18:43,814 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:18:43,864 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:18:43,864 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:18:43,864 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889736973]
[2023-10-25 15:18:43,865 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889736973] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:18:43,869 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:18:43,869 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:18:43,870 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940547456]
[2023-10-25 15:18:43,872 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:18:43,872 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:18:43,873 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:18:43,873 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:18:43,873 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:18:43,910 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 78 out of 148
[2023-10-25 15:18:43,911 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 78 flow. Second operand  has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:43,911 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:18:43,911 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 148
[2023-10-25 15:18:43,911 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:18:44,071 INFO  L130       PetriNetUnfolder]: 381/817 cut-off events.
[2023-10-25 15:18:44,071 INFO  L131       PetriNetUnfolder]: For 33/33 co-relation queries the response was YES.
[2023-10-25 15:18:44,074 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1537 conditions, 817 events. 381/817 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4395 event pairs, 164 based on Foata normal form. 0/720 useless extension candidates. Maximal degree in co-relation 243. Up to 664 conditions per place. 
[2023-10-25 15:18:44,076 INFO  L137   encePairwiseOnDemand]: 144/148 looper letters, 26 selfloop transitions, 2 changer transitions 0/36 dead transitions.
[2023-10-25 15:18:44,076 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 146 flow
[2023-10-25 15:18:44,077 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:18:44,077 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:18:44,078 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions.
[2023-10-25 15:18:44,078 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5945945945945946
[2023-10-25 15:18:44,078 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 264 transitions.
[2023-10-25 15:18:44,079 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 264 transitions.
[2023-10-25 15:18:44,081 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:18:44,081 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 264 transitions.
[2023-10-25 15:18:44,082 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:44,105 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:44,106 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:44,106 INFO  L175             Difference]: Start difference. First operand has 33 places, 30 transitions, 78 flow. Second operand 3 states and 264 transitions.
[2023-10-25 15:18:44,106 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 146 flow
[2023-10-25 15:18:44,107 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:18:44,107 INFO  L231             Difference]: Finished difference. Result has 35 places, 30 transitions, 88 flow
[2023-10-25 15:18:44,107 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=35, PETRI_TRANSITIONS=30}
[2023-10-25 15:18:44,108 INFO  L288   CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places.
[2023-10-25 15:18:44,108 INFO  L495      AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 88 flow
[2023-10-25 15:18:44,108 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:44,108 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:18:44,108 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:18:44,108 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-10-25 15:18:44,109 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-10-25 15:18:44,109 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:18:44,111 INFO  L85        PathProgramCache]: Analyzing trace with hash -308595878, now seen corresponding path program 1 times
[2023-10-25 15:18:44,111 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:18:44,112 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371470483]
[2023-10-25 15:18:44,112 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:18:44,112 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:18:44,120 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:18:44,149 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:18:44,149 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:18:44,149 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371470483]
[2023-10-25 15:18:44,149 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371470483] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:18:44,150 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:18:44,150 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:18:44,150 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559989834]
[2023-10-25 15:18:44,150 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:18:44,150 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:18:44,150 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:18:44,151 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:18:44,151 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:18:44,170 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 74 out of 148
[2023-10-25 15:18:44,171 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 88 flow. Second operand  has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:44,171 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:18:44,171 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 148
[2023-10-25 15:18:44,171 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:18:44,358 INFO  L130       PetriNetUnfolder]: 549/1049 cut-off events.
[2023-10-25 15:18:44,359 INFO  L131       PetriNetUnfolder]: For 137/137 co-relation queries the response was YES.
[2023-10-25 15:18:44,360 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2152 conditions, 1049 events. 549/1049 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5541 event pairs, 436 based on Foata normal form. 0/935 useless extension candidates. Maximal degree in co-relation 2102. Up to 835 conditions per place. 
[2023-10-25 15:18:44,363 INFO  L137   encePairwiseOnDemand]: 143/148 looper letters, 36 selfloop transitions, 4 changer transitions 0/46 dead transitions.
[2023-10-25 15:18:44,374 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 46 transitions, 215 flow
[2023-10-25 15:18:44,375 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:18:44,375 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:18:44,375 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions.
[2023-10-25 15:18:44,375 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5878378378378378
[2023-10-25 15:18:44,376 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 261 transitions.
[2023-10-25 15:18:44,376 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 261 transitions.
[2023-10-25 15:18:44,376 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:18:44,376 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 261 transitions.
[2023-10-25 15:18:44,377 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:44,378 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:44,378 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:44,378 INFO  L175             Difference]: Start difference. First operand has 35 places, 30 transitions, 88 flow. Second operand 3 states and 261 transitions.
[2023-10-25 15:18:44,378 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 46 transitions, 215 flow
[2023-10-25 15:18:44,380 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 46 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-25 15:18:44,381 INFO  L231             Difference]: Finished difference. Result has 37 places, 33 transitions, 112 flow
[2023-10-25 15:18:44,381 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=37, PETRI_TRANSITIONS=33}
[2023-10-25 15:18:44,475 INFO  L288   CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places.
[2023-10-25 15:18:44,475 INFO  L495      AbstractCegarLoop]: Abstraction has has 37 places, 33 transitions, 112 flow
[2023-10-25 15:18:44,475 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:44,476 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:18:44,476 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:18:44,476 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-10-25 15:18:44,476 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-10-25 15:18:44,476 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:18:44,476 INFO  L85        PathProgramCache]: Analyzing trace with hash -1090130490, now seen corresponding path program 1 times
[2023-10-25 15:18:44,476 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:18:44,477 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28579153]
[2023-10-25 15:18:44,477 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:18:44,477 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:18:44,487 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:18:44,542 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-25 15:18:44,542 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:18:44,543 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28579153]
[2023-10-25 15:18:44,543 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28579153] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:18:44,544 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:18:44,544 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-25 15:18:44,544 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173559931]
[2023-10-25 15:18:44,559 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:18:44,559 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-10-25 15:18:44,559 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:18:44,560 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-10-25 15:18:44,560 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-10-25 15:18:44,597 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 76 out of 148
[2023-10-25 15:18:44,598 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 33 transitions, 112 flow. Second operand  has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:44,598 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:18:44,598 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 148
[2023-10-25 15:18:44,598 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:18:44,756 INFO  L130       PetriNetUnfolder]: 333/695 cut-off events.
[2023-10-25 15:18:44,757 INFO  L131       PetriNetUnfolder]: For 284/304 co-relation queries the response was YES.
[2023-10-25 15:18:44,758 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1610 conditions, 695 events. 333/695 cut-off events. For 284/304 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3396 event pairs, 180 based on Foata normal form. 55/733 useless extension candidates. Maximal degree in co-relation 589. Up to 369 conditions per place. 
[2023-10-25 15:18:44,760 INFO  L137   encePairwiseOnDemand]: 144/148 looper letters, 35 selfloop transitions, 3 changer transitions 0/47 dead transitions.
[2023-10-25 15:18:44,760 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 47 transitions, 230 flow
[2023-10-25 15:18:44,760 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-25 15:18:44,760 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-25 15:18:44,761 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 339 transitions.
[2023-10-25 15:18:44,761 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5726351351351351
[2023-10-25 15:18:44,761 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 339 transitions.
[2023-10-25 15:18:44,761 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 339 transitions.
[2023-10-25 15:18:44,761 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:18:44,762 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 339 transitions.
[2023-10-25 15:18:44,762 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:44,763 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 148.0) internal successors, (740), 5 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:44,764 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 148.0) internal successors, (740), 5 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:44,764 INFO  L175             Difference]: Start difference. First operand has 37 places, 33 transitions, 112 flow. Second operand 4 states and 339 transitions.
[2023-10-25 15:18:44,764 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 47 transitions, 230 flow
[2023-10-25 15:18:44,765 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 47 transitions, 224 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-25 15:18:44,766 INFO  L231             Difference]: Finished difference. Result has 40 places, 34 transitions, 124 flow
[2023-10-25 15:18:44,766 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=40, PETRI_TRANSITIONS=34}
[2023-10-25 15:18:44,769 INFO  L288   CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places.
[2023-10-25 15:18:44,769 INFO  L495      AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 124 flow
[2023-10-25 15:18:44,769 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:44,769 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:18:44,769 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1]
[2023-10-25 15:18:44,770 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-10-25 15:18:44,770 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-10-25 15:18:44,775 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:18:44,775 INFO  L85        PathProgramCache]: Analyzing trace with hash -1177317092, now seen corresponding path program 1 times
[2023-10-25 15:18:44,775 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:18:44,775 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794393183]
[2023-10-25 15:18:44,775 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:18:44,776 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:18:44,803 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:18:44,803 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-25 15:18:44,815 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:18:44,826 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-25 15:18:44,827 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-25 15:18:44,827 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining)
[2023-10-25 15:18:44,827 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining)
[2023-10-25 15:18:44,830 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining)
[2023-10-25 15:18:44,830 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining)
[2023-10-25 15:18:44,831 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining)
[2023-10-25 15:18:44,831 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining)
[2023-10-25 15:18:44,831 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-10-25 15:18:44,831 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2023-10-25 15:18:44,832 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-25 15:18:44,832 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2023-10-25 15:18:44,863 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2023-10-25 15:18:44,868 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 105 places, 103 transitions, 236 flow
[2023-10-25 15:18:44,913 INFO  L130       PetriNetUnfolder]: 20/300 cut-off events.
[2023-10-25 15:18:44,914 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-10-25 15:18:44,914 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 328 conditions, 300 events. 20/300 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 897 event pairs, 1 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 181. Up to 16 conditions per place. 
[2023-10-25 15:18:44,914 INFO  L82        GeneralOperation]: Start removeDead. Operand has 105 places, 103 transitions, 236 flow
[2023-10-25 15:18:44,916 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 105 places, 103 transitions, 236 flow
[2023-10-25 15:18:44,916 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 15:18:44,916 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 103 transitions, 236 flow
[2023-10-25 15:18:44,916 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 103 transitions, 236 flow
[2023-10-25 15:18:44,917 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 105 places, 103 transitions, 236 flow
[2023-10-25 15:18:44,962 INFO  L130       PetriNetUnfolder]: 20/300 cut-off events.
[2023-10-25 15:18:44,962 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-10-25 15:18:44,963 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 328 conditions, 300 events. 20/300 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 897 event pairs, 1 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 181. Up to 16 conditions per place. 
[2023-10-25 15:18:44,966 INFO  L119        LiptonReduction]: Number of co-enabled transitions 4452
[2023-10-25 15:18:46,866 INFO  L134        LiptonReduction]: Checked pairs total: 11117
[2023-10-25 15:18:46,866 INFO  L136        LiptonReduction]: Total number of compositions: 69
[2023-10-25 15:18:46,867 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 15:18:46,867 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@70b754cc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 15:18:46,868 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2023-10-25 15:18:46,868 INFO  L130       PetriNetUnfolder]: 0/4 cut-off events.
[2023-10-25 15:18:46,868 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:18:46,869 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:18:46,869 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2023-10-25 15:18:46,869 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-10-25 15:18:46,869 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:18:46,869 INFO  L85        PathProgramCache]: Analyzing trace with hash 608861, now seen corresponding path program 1 times
[2023-10-25 15:18:46,869 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:18:46,869 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528259006]
[2023-10-25 15:18:46,869 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:18:46,869 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:18:46,876 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:18:46,912 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:18:46,912 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:18:46,912 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528259006]
[2023-10-25 15:18:46,912 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528259006] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:18:46,913 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:18:46,915 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:18:46,915 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933515615]
[2023-10-25 15:18:46,916 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:18:46,916 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:18:46,916 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:18:46,916 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:18:46,916 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:18:46,931 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 92 out of 172
[2023-10-25 15:18:46,931 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 106 flow. Second operand  has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:46,931 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:18:46,931 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 172
[2023-10-25 15:18:46,931 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:18:47,895 INFO  L130       PetriNetUnfolder]: 4797/7749 cut-off events.
[2023-10-25 15:18:47,909 INFO  L131       PetriNetUnfolder]: For 553/553 co-relation queries the response was YES.
[2023-10-25 15:18:47,917 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15209 conditions, 7749 events. 4797/7749 cut-off events. For 553/553 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 46768 event pairs, 3056 based on Foata normal form. 0/7044 useless extension candidates. Maximal degree in co-relation 1739. Up to 7065 conditions per place. 
[2023-10-25 15:18:47,976 INFO  L137   encePairwiseOnDemand]: 168/172 looper letters, 34 selfloop transitions, 2 changer transitions 0/44 dead transitions.
[2023-10-25 15:18:47,976 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 44 transitions, 190 flow
[2023-10-25 15:18:47,977 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:18:47,977 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:18:47,978 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions.
[2023-10-25 15:18:47,978 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6085271317829457
[2023-10-25 15:18:47,978 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 314 transitions.
[2023-10-25 15:18:47,978 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions.
[2023-10-25 15:18:47,978 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:18:47,978 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions.
[2023-10-25 15:18:47,979 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:47,984 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:47,985 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:47,985 INFO  L175             Difference]: Start difference. First operand has 42 places, 38 transitions, 106 flow. Second operand 3 states and 314 transitions.
[2023-10-25 15:18:47,985 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 44 transitions, 190 flow
[2023-10-25 15:18:47,986 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 190 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:18:47,987 INFO  L231             Difference]: Finished difference. Result has 44 places, 38 transitions, 116 flow
[2023-10-25 15:18:47,987 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=44, PETRI_TRANSITIONS=38}
[2023-10-25 15:18:47,987 INFO  L288   CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places.
[2023-10-25 15:18:47,988 INFO  L495      AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 116 flow
[2023-10-25 15:18:47,988 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:47,988 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:18:48,000 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:18:48,001 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-10-25 15:18:48,001 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-10-25 15:18:48,001 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:18:48,001 INFO  L85        PathProgramCache]: Analyzing trace with hash -19105322, now seen corresponding path program 1 times
[2023-10-25 15:18:48,002 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:18:48,002 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957343693]
[2023-10-25 15:18:48,002 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:18:48,002 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:18:48,008 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:18:48,035 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:18:48,035 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:18:48,036 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957343693]
[2023-10-25 15:18:48,036 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957343693] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:18:48,036 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:18:48,037 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:18:48,037 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551897274]
[2023-10-25 15:18:48,037 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:18:48,037 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:18:48,037 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:18:48,038 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:18:48,038 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:18:48,052 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 87 out of 172
[2023-10-25 15:18:48,053 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 116 flow. Second operand  has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:48,053 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:18:48,053 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 172
[2023-10-25 15:18:48,053 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:18:49,204 INFO  L130       PetriNetUnfolder]: 6702/10525 cut-off events.
[2023-10-25 15:18:49,217 INFO  L131       PetriNetUnfolder]: For 1382/1382 co-relation queries the response was YES.
[2023-10-25 15:18:49,241 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21498 conditions, 10525 events. 6702/10525 cut-off events. For 1382/1382 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 66378 event pairs, 4536 based on Foata normal form. 0/9659 useless extension candidates. Maximal degree in co-relation 21447. Up to 7566 conditions per place. 
[2023-10-25 15:18:49,451 INFO  L137   encePairwiseOnDemand]: 165/172 looper letters, 49 selfloop transitions, 6 changer transitions 0/62 dead transitions.
[2023-10-25 15:18:49,451 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 62 transitions, 299 flow
[2023-10-25 15:18:49,452 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:18:49,452 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:18:49,453 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions.
[2023-10-25 15:18:49,469 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6104651162790697
[2023-10-25 15:18:49,469 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 315 transitions.
[2023-10-25 15:18:49,470 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 315 transitions.
[2023-10-25 15:18:49,470 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:18:49,470 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 315 transitions.
[2023-10-25 15:18:49,471 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:49,472 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:49,473 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:49,473 INFO  L175             Difference]: Start difference. First operand has 44 places, 38 transitions, 116 flow. Second operand 3 states and 315 transitions.
[2023-10-25 15:18:49,473 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 62 transitions, 299 flow
[2023-10-25 15:18:49,477 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 62 transitions, 296 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-25 15:18:49,478 INFO  L231             Difference]: Finished difference. Result has 47 places, 43 transitions, 160 flow
[2023-10-25 15:18:49,478 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=47, PETRI_TRANSITIONS=43}
[2023-10-25 15:18:49,479 INFO  L288   CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places.
[2023-10-25 15:18:49,480 INFO  L495      AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 160 flow
[2023-10-25 15:18:49,480 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:49,480 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:18:49,480 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:18:49,481 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-10-25 15:18:49,481 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-10-25 15:18:49,481 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:18:49,481 INFO  L85        PathProgramCache]: Analyzing trace with hash -726703818, now seen corresponding path program 1 times
[2023-10-25 15:18:49,481 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:18:49,481 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203878776]
[2023-10-25 15:18:49,482 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:18:49,482 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:18:49,489 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:18:49,532 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-25 15:18:49,533 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:18:49,533 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203878776]
[2023-10-25 15:18:49,534 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203878776] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:18:49,534 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:18:49,534 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-25 15:18:49,543 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765917087]
[2023-10-25 15:18:49,543 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:18:49,544 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-10-25 15:18:49,544 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:18:49,545 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-10-25 15:18:49,545 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-10-25 15:18:49,568 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 172
[2023-10-25 15:18:49,568 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 160 flow. Second operand  has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:49,569 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:18:49,569 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 172
[2023-10-25 15:18:49,569 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:18:50,523 INFO  L130       PetriNetUnfolder]: 4867/7979 cut-off events.
[2023-10-25 15:18:50,524 INFO  L131       PetriNetUnfolder]: For 4560/4730 co-relation queries the response was YES.
[2023-10-25 15:18:50,563 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19486 conditions, 7979 events. 4867/7979 cut-off events. For 4560/4730 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 49530 event pairs, 2656 based on Foata normal form. 343/8140 useless extension candidates. Maximal degree in co-relation 5763. Up to 4719 conditions per place. 
[2023-10-25 15:18:50,580 INFO  L137   encePairwiseOnDemand]: 168/172 looper letters, 56 selfloop transitions, 3 changer transitions 0/67 dead transitions.
[2023-10-25 15:18:50,593 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 67 transitions, 363 flow
[2023-10-25 15:18:50,593 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-25 15:18:50,594 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-25 15:18:50,594 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 410 transitions.
[2023-10-25 15:18:50,595 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5959302325581395
[2023-10-25 15:18:50,595 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 410 transitions.
[2023-10-25 15:18:50,595 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 410 transitions.
[2023-10-25 15:18:50,595 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:18:50,595 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 410 transitions.
[2023-10-25 15:18:50,596 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:50,597 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:50,597 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:50,597 INFO  L175             Difference]: Start difference. First operand has 47 places, 43 transitions, 160 flow. Second operand 4 states and 410 transitions.
[2023-10-25 15:18:50,598 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 67 transitions, 363 flow
[2023-10-25 15:18:50,626 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 341 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:18:50,628 INFO  L231             Difference]: Finished difference. Result has 49 places, 44 transitions, 164 flow
[2023-10-25 15:18:50,628 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=49, PETRI_TRANSITIONS=44}
[2023-10-25 15:18:50,630 INFO  L288   CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places.
[2023-10-25 15:18:50,630 INFO  L495      AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 164 flow
[2023-10-25 15:18:50,630 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:50,630 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:18:50,630 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:18:50,631 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-10-25 15:18:50,631 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-10-25 15:18:50,631 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:18:50,631 INFO  L85        PathProgramCache]: Analyzing trace with hash 2028505559, now seen corresponding path program 1 times
[2023-10-25 15:18:50,631 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:18:50,631 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200990322]
[2023-10-25 15:18:50,632 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:18:50,632 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:18:50,641 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:18:50,664 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-10-25 15:18:50,664 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:18:50,664 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200990322]
[2023-10-25 15:18:50,664 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200990322] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:18:50,664 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:18:50,665 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:18:50,665 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219107189]
[2023-10-25 15:18:50,665 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:18:50,665 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:18:50,665 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:18:50,666 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:18:50,666 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:18:50,692 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 87 out of 172
[2023-10-25 15:18:50,692 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 164 flow. Second operand  has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:50,692 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:18:50,692 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 172
[2023-10-25 15:18:50,692 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:18:51,870 INFO  L130       PetriNetUnfolder]: 6475/10410 cut-off events.
[2023-10-25 15:18:51,870 INFO  L131       PetriNetUnfolder]: For 5663/5788 co-relation queries the response was YES.
[2023-10-25 15:18:51,879 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25224 conditions, 10410 events. 6475/10410 cut-off events. For 5663/5788 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 65976 event pairs, 3931 based on Foata normal form. 0/9937 useless extension candidates. Maximal degree in co-relation 10057. Up to 7374 conditions per place. 
[2023-10-25 15:18:51,924 INFO  L137   encePairwiseOnDemand]: 165/172 looper letters, 55 selfloop transitions, 9 changer transitions 0/71 dead transitions.
[2023-10-25 15:18:51,925 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 71 transitions, 393 flow
[2023-10-25 15:18:51,925 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:18:51,925 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:18:51,926 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions.
[2023-10-25 15:18:51,926 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6085271317829457
[2023-10-25 15:18:51,926 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 314 transitions.
[2023-10-25 15:18:51,926 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions.
[2023-10-25 15:18:51,927 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:18:51,927 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions.
[2023-10-25 15:18:51,927 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:51,934 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:51,935 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:51,935 INFO  L175             Difference]: Start difference. First operand has 49 places, 44 transitions, 164 flow. Second operand 3 states and 314 transitions.
[2023-10-25 15:18:51,935 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 71 transitions, 393 flow
[2023-10-25 15:18:51,949 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 71 transitions, 387 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:18:51,951 INFO  L231             Difference]: Finished difference. Result has 51 places, 51 transitions, 240 flow
[2023-10-25 15:18:51,951 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=51, PETRI_TRANSITIONS=51}
[2023-10-25 15:18:51,951 INFO  L288   CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places.
[2023-10-25 15:18:51,953 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 51 transitions, 240 flow
[2023-10-25 15:18:51,953 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:51,953 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:18:51,953 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:18:51,953 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-10-25 15:18:51,953 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-10-25 15:18:51,954 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:18:51,954 INFO  L85        PathProgramCache]: Analyzing trace with hash -891645950, now seen corresponding path program 1 times
[2023-10-25 15:18:51,956 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:18:51,956 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785807170]
[2023-10-25 15:18:51,956 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:18:51,956 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:18:51,982 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:18:52,079 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-25 15:18:52,079 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:18:52,079 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785807170]
[2023-10-25 15:18:52,079 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785807170] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:18:52,079 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:18:52,079 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-25 15:18:52,080 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344892965]
[2023-10-25 15:18:52,080 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:18:52,080 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:18:52,080 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:18:52,080 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:18:52,081 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:18:52,096 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 172
[2023-10-25 15:18:52,097 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 51 transitions, 240 flow. Second operand  has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:52,097 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:18:52,097 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 172
[2023-10-25 15:18:52,097 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:18:52,363 INFO  L130       PetriNetUnfolder]: 808/1836 cut-off events.
[2023-10-25 15:18:52,364 INFO  L131       PetriNetUnfolder]: For 1421/1431 co-relation queries the response was YES.
[2023-10-25 15:18:52,365 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5054 conditions, 1836 events. 808/1836 cut-off events. For 1421/1431 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 12050 event pairs, 162 based on Foata normal form. 416/2207 useless extension candidates. Maximal degree in co-relation 1793. Up to 1308 conditions per place. 
[2023-10-25 15:18:52,384 INFO  L137   encePairwiseOnDemand]: 166/172 looper letters, 43 selfloop transitions, 8 changer transitions 0/59 dead transitions.
[2023-10-25 15:18:52,385 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 59 transitions, 361 flow
[2023-10-25 15:18:52,385 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:18:52,385 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:18:52,386 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions.
[2023-10-25 15:18:52,386 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5968992248062015
[2023-10-25 15:18:52,386 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 308 transitions.
[2023-10-25 15:18:52,386 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 308 transitions.
[2023-10-25 15:18:52,387 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:18:52,387 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 308 transitions.
[2023-10-25 15:18:52,387 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:52,388 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:52,388 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:52,388 INFO  L175             Difference]: Start difference. First operand has 51 places, 51 transitions, 240 flow. Second operand 3 states and 308 transitions.
[2023-10-25 15:18:52,389 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 59 transitions, 361 flow
[2023-10-25 15:18:52,391 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 59 transitions, 349 flow, removed 2 selfloop flow, removed 2 redundant places.
[2023-10-25 15:18:52,393 INFO  L231             Difference]: Finished difference. Result has 51 places, 45 transitions, 196 flow
[2023-10-25 15:18:52,393 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=51, PETRI_TRANSITIONS=45}
[2023-10-25 15:18:52,395 INFO  L288   CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places.
[2023-10-25 15:18:52,395 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 196 flow
[2023-10-25 15:18:52,395 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:52,395 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:18:52,395 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1]
[2023-10-25 15:18:52,395 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-10-25 15:18:52,396 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-10-25 15:18:52,396 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:18:52,396 INFO  L85        PathProgramCache]: Analyzing trace with hash -1406223222, now seen corresponding path program 1 times
[2023-10-25 15:18:52,396 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:18:52,396 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288188102]
[2023-10-25 15:18:52,396 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:18:52,396 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:18:52,421 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:18:52,421 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-25 15:18:52,431 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:18:52,435 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-25 15:18:52,437 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-25 15:18:52,438 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2023-10-25 15:18:52,438 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2023-10-25 15:18:52,438 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2023-10-25 15:18:52,438 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2023-10-25 15:18:52,438 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2023-10-25 15:18:52,438 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2023-10-25 15:18:52,439 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2023-10-25 15:18:52,439 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-10-25 15:18:52,439 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2023-10-25 15:18:52,449 WARN  L233   ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-25 15:18:52,449 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances.
[2023-10-25 15:18:52,483 INFO  L144    ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions.
[2023-10-25 15:18:52,486 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 122 places, 119 transitions, 282 flow
[2023-10-25 15:18:52,553 INFO  L130       PetriNetUnfolder]: 42/531 cut-off events.
[2023-10-25 15:18:52,569 INFO  L131       PetriNetUnfolder]: For 48/48 co-relation queries the response was YES.
[2023-10-25 15:18:52,570 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 586 conditions, 531 events. 42/531 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2087 event pairs, 6 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 320. Up to 32 conditions per place. 
[2023-10-25 15:18:52,570 INFO  L82        GeneralOperation]: Start removeDead. Operand has 122 places, 119 transitions, 282 flow
[2023-10-25 15:18:52,571 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 122 places, 119 transitions, 282 flow
[2023-10-25 15:18:52,572 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 15:18:52,572 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 119 transitions, 282 flow
[2023-10-25 15:18:52,572 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 119 transitions, 282 flow
[2023-10-25 15:18:52,572 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 122 places, 119 transitions, 282 flow
[2023-10-25 15:18:52,615 INFO  L130       PetriNetUnfolder]: 42/531 cut-off events.
[2023-10-25 15:18:52,620 INFO  L131       PetriNetUnfolder]: For 48/48 co-relation queries the response was YES.
[2023-10-25 15:18:52,622 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 586 conditions, 531 events. 42/531 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2087 event pairs, 6 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 320. Up to 32 conditions per place. 
[2023-10-25 15:18:52,630 INFO  L119        LiptonReduction]: Number of co-enabled transitions 6888
[2023-10-25 15:18:54,784 INFO  L134        LiptonReduction]: Checked pairs total: 17075
[2023-10-25 15:18:54,784 INFO  L136        LiptonReduction]: Total number of compositions: 77
[2023-10-25 15:18:54,785 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 15:18:54,786 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@70b754cc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 15:18:54,786 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2023-10-25 15:18:54,786 INFO  L130       PetriNetUnfolder]: 0/4 cut-off events.
[2023-10-25 15:18:54,786 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:18:54,787 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:18:54,787 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2023-10-25 15:18:54,787 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-10-25 15:18:54,787 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:18:54,787 INFO  L85        PathProgramCache]: Analyzing trace with hash 819222, now seen corresponding path program 1 times
[2023-10-25 15:18:54,787 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:18:54,787 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103432466]
[2023-10-25 15:18:54,787 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:18:54,787 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:18:54,804 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:18:54,819 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:18:54,819 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:18:54,819 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103432466]
[2023-10-25 15:18:54,820 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103432466] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:18:54,820 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:18:54,820 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:18:54,820 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537424202]
[2023-10-25 15:18:54,820 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:18:54,820 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:18:54,820 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:18:54,821 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:18:54,821 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:18:54,845 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 106 out of 196
[2023-10-25 15:18:54,845 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 136 flow. Second operand  has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:54,845 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:18:54,845 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 196
[2023-10-25 15:18:54,846 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:18:59,214 INFO  L130       PetriNetUnfolder]: 26270/40764 cut-off events.
[2023-10-25 15:18:59,215 INFO  L131       PetriNetUnfolder]: For 4122/4122 co-relation queries the response was YES.
[2023-10-25 15:18:59,288 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 78996 conditions, 40764 events. 26270/40764 cut-off events. For 4122/4122 co-relation queries the response was YES. Maximal size of possible extension queue 1301. Compared 303118 event pairs, 19290 based on Foata normal form. 0/37722 useless extension candidates. Maximal degree in co-relation 11331. Up to 35881 conditions per place. 
[2023-10-25 15:18:59,561 INFO  L137   encePairwiseOnDemand]: 192/196 looper letters, 37 selfloop transitions, 2 changer transitions 0/51 dead transitions.
[2023-10-25 15:18:59,573 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 51 transitions, 224 flow
[2023-10-25 15:18:59,574 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:18:59,574 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:18:59,574 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions.
[2023-10-25 15:18:59,575 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6105442176870748
[2023-10-25 15:18:59,575 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 359 transitions.
[2023-10-25 15:18:59,575 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions.
[2023-10-25 15:18:59,575 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:18:59,575 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions.
[2023-10-25 15:18:59,576 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:59,577 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:59,577 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:59,577 INFO  L175             Difference]: Start difference. First operand has 51 places, 46 transitions, 136 flow. Second operand 3 states and 359 transitions.
[2023-10-25 15:18:59,577 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 51 transitions, 224 flow
[2023-10-25 15:18:59,579 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 224 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:18:59,579 INFO  L231             Difference]: Finished difference. Result has 53 places, 46 transitions, 146 flow
[2023-10-25 15:18:59,579 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=53, PETRI_TRANSITIONS=46}
[2023-10-25 15:18:59,580 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places.
[2023-10-25 15:18:59,580 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 146 flow
[2023-10-25 15:18:59,580 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:59,580 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:18:59,581 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:18:59,581 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-10-25 15:18:59,581 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-10-25 15:18:59,581 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:18:59,581 INFO  L85        PathProgramCache]: Analyzing trace with hash 1292687696, now seen corresponding path program 1 times
[2023-10-25 15:18:59,581 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:18:59,582 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737459277]
[2023-10-25 15:18:59,582 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:18:59,582 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:18:59,601 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:18:59,611 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:18:59,611 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:18:59,612 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737459277]
[2023-10-25 15:18:59,612 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737459277] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:18:59,612 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:18:59,612 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:18:59,612 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567689743]
[2023-10-25 15:18:59,612 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:18:59,612 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:18:59,613 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:18:59,613 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:18:59,613 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:18:59,630 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 196
[2023-10-25 15:18:59,630 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 146 flow. Second operand  has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:59,631 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:18:59,631 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 196
[2023-10-25 15:18:59,631 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:19:07,000 INFO  L130       PetriNetUnfolder]: 56821/81374 cut-off events.
[2023-10-25 15:19:07,000 INFO  L131       PetriNetUnfolder]: For 11034/11034 co-relation queries the response was YES.
[2023-10-25 15:19:07,138 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 165575 conditions, 81374 events. 56821/81374 cut-off events. For 11034/11034 co-relation queries the response was YES. Maximal size of possible extension queue 2184. Compared 558654 event pairs, 46946 based on Foata normal form. 0/75443 useless extension candidates. Maximal degree in co-relation 165523. Up to 68383 conditions per place. 
[2023-10-25 15:19:07,701 INFO  L137   encePairwiseOnDemand]: 189/196 looper letters, 62 selfloop transitions, 6 changer transitions 0/76 dead transitions.
[2023-10-25 15:19:07,702 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 76 transitions, 379 flow
[2023-10-25 15:19:07,702 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:19:07,702 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:19:07,704 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions.
[2023-10-25 15:19:07,704 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6241496598639455
[2023-10-25 15:19:07,704 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 367 transitions.
[2023-10-25 15:19:07,705 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions.
[2023-10-25 15:19:07,705 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:19:07,705 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions.
[2023-10-25 15:19:07,706 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:07,720 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:07,720 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:07,721 INFO  L175             Difference]: Start difference. First operand has 53 places, 46 transitions, 146 flow. Second operand 3 states and 367 transitions.
[2023-10-25 15:19:07,721 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 76 transitions, 379 flow
[2023-10-25 15:19:07,723 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 76 transitions, 376 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-25 15:19:07,728 INFO  L231             Difference]: Finished difference. Result has 55 places, 51 transitions, 184 flow
[2023-10-25 15:19:07,730 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=55, PETRI_TRANSITIONS=51}
[2023-10-25 15:19:07,731 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places.
[2023-10-25 15:19:07,731 INFO  L495      AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 184 flow
[2023-10-25 15:19:07,731 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:07,732 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:07,732 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:19:07,732 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-10-25 15:19:07,732 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-10-25 15:19:07,733 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:07,733 INFO  L85        PathProgramCache]: Analyzing trace with hash 1252527573, now seen corresponding path program 1 times
[2023-10-25 15:19:07,734 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:07,734 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411978044]
[2023-10-25 15:19:07,734 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:07,735 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:07,754 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:19:07,794 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-25 15:19:07,794 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:19:07,794 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411978044]
[2023-10-25 15:19:07,794 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411978044] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:19:07,794 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:19:07,795 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-25 15:19:07,796 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801322922]
[2023-10-25 15:19:07,796 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:19:07,797 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-10-25 15:19:07,797 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:19:07,797 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-10-25 15:19:07,797 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-10-25 15:19:07,821 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 196
[2023-10-25 15:19:07,821 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 184 flow. Second operand  has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:07,821 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:19:07,822 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 196
[2023-10-25 15:19:07,822 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:19:11,672 INFO  L130       PetriNetUnfolder]: 34262/52446 cut-off events.
[2023-10-25 15:19:11,673 INFO  L131       PetriNetUnfolder]: For 14424/19295 co-relation queries the response was YES.
[2023-10-25 15:19:11,892 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 117075 conditions, 52446 events. 34262/52446 cut-off events. For 14424/19295 co-relation queries the response was YES. Maximal size of possible extension queue 1518. Compared 395231 event pairs, 20480 based on Foata normal form. 3766/53979 useless extension candidates. Maximal degree in co-relation 42195. Up to 29996 conditions per place. 
[2023-10-25 15:19:12,048 INFO  L137   encePairwiseOnDemand]: 192/196 looper letters, 59 selfloop transitions, 3 changer transitions 0/76 dead transitions.
[2023-10-25 15:19:12,049 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 76 transitions, 380 flow
[2023-10-25 15:19:12,049 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-25 15:19:12,050 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-25 15:19:12,050 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 473 transitions.
[2023-10-25 15:19:12,051 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6033163265306123
[2023-10-25 15:19:12,052 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 473 transitions.
[2023-10-25 15:19:12,052 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 473 transitions.
[2023-10-25 15:19:12,052 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:19:12,052 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 473 transitions.
[2023-10-25 15:19:12,055 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:12,082 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:12,082 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:12,082 INFO  L175             Difference]: Start difference. First operand has 55 places, 51 transitions, 184 flow. Second operand 4 states and 473 transitions.
[2023-10-25 15:19:12,082 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 76 transitions, 380 flow
[2023-10-25 15:19:12,151 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 76 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-25 15:19:12,152 INFO  L231             Difference]: Finished difference. Result has 58 places, 52 transitions, 194 flow
[2023-10-25 15:19:12,152 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=58, PETRI_TRANSITIONS=52}
[2023-10-25 15:19:12,154 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places.
[2023-10-25 15:19:12,154 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 52 transitions, 194 flow
[2023-10-25 15:19:12,155 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:12,155 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:12,155 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:19:12,155 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2023-10-25 15:19:12,170 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-10-25 15:19:12,171 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:12,171 INFO  L85        PathProgramCache]: Analyzing trace with hash 18506108, now seen corresponding path program 1 times
[2023-10-25 15:19:12,171 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:12,171 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091151210]
[2023-10-25 15:19:12,171 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:12,171 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:12,197 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:19:12,209 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-10-25 15:19:12,209 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:19:12,210 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091151210]
[2023-10-25 15:19:12,210 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091151210] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:19:12,210 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:19:12,210 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:19:12,210 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461403399]
[2023-10-25 15:19:12,210 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:19:12,211 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:19:12,211 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:19:12,211 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:19:12,211 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:19:12,242 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 196
[2023-10-25 15:19:12,242 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 52 transitions, 194 flow. Second operand  has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:12,243 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:19:12,243 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 196
[2023-10-25 15:19:12,243 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:19:18,558 INFO  L130       PetriNetUnfolder]: 61433/89147 cut-off events.
[2023-10-25 15:19:18,558 INFO  L131       PetriNetUnfolder]: For 41463/42612 co-relation queries the response was YES.
[2023-10-25 15:19:18,723 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 209218 conditions, 89147 events. 61433/89147 cut-off events. For 41463/42612 co-relation queries the response was YES. Maximal size of possible extension queue 2203. Compared 633309 event pairs, 41061 based on Foata normal form. 0/85250 useless extension candidates. Maximal degree in co-relation 75012. Up to 66048 conditions per place. 
[2023-10-25 15:19:19,121 INFO  L137   encePairwiseOnDemand]: 188/196 looper letters, 67 selfloop transitions, 11 changer transitions 0/86 dead transitions.
[2023-10-25 15:19:19,122 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 86 transitions, 477 flow
[2023-10-25 15:19:19,122 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:19:19,122 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:19:19,124 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions.
[2023-10-25 15:19:19,124 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6241496598639455
[2023-10-25 15:19:19,124 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 367 transitions.
[2023-10-25 15:19:19,124 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions.
[2023-10-25 15:19:19,124 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:19:19,125 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions.
[2023-10-25 15:19:19,125 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:19,126 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:19,126 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:19,134 INFO  L175             Difference]: Start difference. First operand has 58 places, 52 transitions, 194 flow. Second operand 3 states and 367 transitions.
[2023-10-25 15:19:19,134 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 86 transitions, 477 flow
[2023-10-25 15:19:19,391 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 86 transitions, 471 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:19:19,392 INFO  L231             Difference]: Finished difference. Result has 60 places, 61 transitions, 290 flow
[2023-10-25 15:19:19,392 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=60, PETRI_TRANSITIONS=61}
[2023-10-25 15:19:19,392 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places.
[2023-10-25 15:19:19,393 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 61 transitions, 290 flow
[2023-10-25 15:19:19,394 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:19,394 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:19,394 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:19:19,394 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2023-10-25 15:19:19,394 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-10-25 15:19:19,395 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:19,395 INFO  L85        PathProgramCache]: Analyzing trace with hash 1876309929, now seen corresponding path program 1 times
[2023-10-25 15:19:19,395 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:19,395 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578465665]
[2023-10-25 15:19:19,395 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:19,395 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:19,433 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:19:19,479 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-25 15:19:19,479 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:19:19,479 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578465665]
[2023-10-25 15:19:19,480 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578465665] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:19:19,480 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:19:19,480 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-25 15:19:19,486 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994715202]
[2023-10-25 15:19:19,487 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:19:19,487 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:19:19,487 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:19:19,487 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:19:19,487 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:19:19,503 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 196
[2023-10-25 15:19:19,504 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 61 transitions, 290 flow. Second operand  has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:19,504 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:19:19,504 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 196
[2023-10-25 15:19:19,517 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:19:20,026 INFO  L130       PetriNetUnfolder]: 2932/6773 cut-off events.
[2023-10-25 15:19:20,026 INFO  L131       PetriNetUnfolder]: For 5762/5800 co-relation queries the response was YES.
[2023-10-25 15:19:20,034 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17713 conditions, 6773 events. 2932/6773 cut-off events. For 5762/5800 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 57547 event pairs, 659 based on Foata normal form. 2100/8709 useless extension candidates. Maximal degree in co-relation 6015. Up to 4411 conditions per place. 
[2023-10-25 15:19:20,044 INFO  L137   encePairwiseOnDemand]: 188/196 looper letters, 47 selfloop transitions, 9 changer transitions 0/68 dead transitions.
[2023-10-25 15:19:20,044 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 68 transitions, 415 flow
[2023-10-25 15:19:20,045 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:19:20,045 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:19:20,045 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions.
[2023-10-25 15:19:20,046 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5969387755102041
[2023-10-25 15:19:20,046 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 351 transitions.
[2023-10-25 15:19:20,046 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions.
[2023-10-25 15:19:20,046 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:19:20,046 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions.
[2023-10-25 15:19:20,047 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:20,048 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:20,049 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:20,049 INFO  L175             Difference]: Start difference. First operand has 60 places, 61 transitions, 290 flow. Second operand 3 states and 351 transitions.
[2023-10-25 15:19:20,049 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 68 transitions, 415 flow
[2023-10-25 15:19:20,073 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 68 transitions, 403 flow, removed 2 selfloop flow, removed 2 redundant places.
[2023-10-25 15:19:20,074 INFO  L231             Difference]: Finished difference. Result has 60 places, 52 transitions, 226 flow
[2023-10-25 15:19:20,074 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=60, PETRI_TRANSITIONS=52}
[2023-10-25 15:19:20,075 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places.
[2023-10-25 15:19:20,075 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 226 flow
[2023-10-25 15:19:20,075 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:20,075 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:20,075 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:19:20,076 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2023-10-25 15:19:20,076 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-10-25 15:19:20,084 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:20,084 INFO  L85        PathProgramCache]: Analyzing trace with hash -1917547087, now seen corresponding path program 1 times
[2023-10-25 15:19:20,084 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:20,084 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817305731]
[2023-10-25 15:19:20,085 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:20,085 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:20,091 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:19:20,118 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2023-10-25 15:19:20,118 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:19:20,118 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817305731]
[2023-10-25 15:19:20,118 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817305731] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:19:20,118 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:19:20,118 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:19:20,119 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273518693]
[2023-10-25 15:19:20,119 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:19:20,119 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:19:20,119 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:19:20,120 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:19:20,120 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:19:20,139 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 196
[2023-10-25 15:19:20,140 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 226 flow. Second operand  has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:20,143 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:19:20,144 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 196
[2023-10-25 15:19:20,144 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:19:20,631 INFO  L130       PetriNetUnfolder]: 3391/7796 cut-off events.
[2023-10-25 15:19:20,631 INFO  L131       PetriNetUnfolder]: For 6308/6346 co-relation queries the response was YES.
[2023-10-25 15:19:20,642 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20991 conditions, 7796 events. 3391/7796 cut-off events. For 6308/6346 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 65696 event pairs, 3007 based on Foata normal form. 0/7409 useless extension candidates. Maximal degree in co-relation 5282. Up to 6329 conditions per place. 
[2023-10-25 15:19:20,655 INFO  L137   encePairwiseOnDemand]: 192/196 looper letters, 54 selfloop transitions, 3 changer transitions 0/65 dead transitions.
[2023-10-25 15:19:20,656 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 65 transitions, 400 flow
[2023-10-25 15:19:20,656 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:19:20,656 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:19:20,661 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions.
[2023-10-25 15:19:20,662 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5952380952380952
[2023-10-25 15:19:20,662 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 350 transitions.
[2023-10-25 15:19:20,662 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 350 transitions.
[2023-10-25 15:19:20,662 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:19:20,662 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 350 transitions.
[2023-10-25 15:19:20,663 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:20,664 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:20,664 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:20,664 INFO  L175             Difference]: Start difference. First operand has 60 places, 52 transitions, 226 flow. Second operand 3 states and 350 transitions.
[2023-10-25 15:19:20,664 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 65 transitions, 400 flow
[2023-10-25 15:19:20,684 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 65 transitions, 391 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-25 15:19:20,685 INFO  L231             Difference]: Finished difference. Result has 62 places, 54 transitions, 242 flow
[2023-10-25 15:19:20,686 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=62, PETRI_TRANSITIONS=54}
[2023-10-25 15:19:20,690 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places.
[2023-10-25 15:19:20,691 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 242 flow
[2023-10-25 15:19:20,691 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:20,691 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:20,691 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:19:20,691 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2023-10-25 15:19:20,691 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-10-25 15:19:20,692 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:20,692 INFO  L85        PathProgramCache]: Analyzing trace with hash -188693244, now seen corresponding path program 1 times
[2023-10-25 15:19:20,692 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:20,692 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759443108]
[2023-10-25 15:19:20,692 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:20,692 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:20,710 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:19:20,748 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-10-25 15:19:20,749 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:19:20,749 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759443108]
[2023-10-25 15:19:20,749 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759443108] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:19:20,749 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:19:20,749 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:19:20,749 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540824480]
[2023-10-25 15:19:20,765 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:19:20,766 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:19:20,766 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:19:20,766 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:19:20,766 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:19:20,785 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 196
[2023-10-25 15:19:20,786 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 242 flow. Second operand  has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:20,786 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:19:20,786 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 196
[2023-10-25 15:19:20,786 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:19:21,424 INFO  L130       PetriNetUnfolder]: 4657/10054 cut-off events.
[2023-10-25 15:19:21,424 INFO  L131       PetriNetUnfolder]: For 8911/8968 co-relation queries the response was YES.
[2023-10-25 15:19:21,439 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27762 conditions, 10054 events. 4657/10054 cut-off events. For 8911/8968 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 83593 event pairs, 2815 based on Foata normal form. 0/9753 useless extension candidates. Maximal degree in co-relation 9812. Up to 6857 conditions per place. 
[2023-10-25 15:19:21,453 INFO  L137   encePairwiseOnDemand]: 189/196 looper letters, 60 selfloop transitions, 9 changer transitions 0/76 dead transitions.
[2023-10-25 15:19:21,454 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 76 transitions, 460 flow
[2023-10-25 15:19:21,454 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:19:21,454 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:19:21,474 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions.
[2023-10-25 15:19:21,474 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6241496598639455
[2023-10-25 15:19:21,475 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 367 transitions.
[2023-10-25 15:19:21,475 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions.
[2023-10-25 15:19:21,475 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:19:21,475 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions.
[2023-10-25 15:19:21,476 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:21,476 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:21,477 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:21,477 INFO  L175             Difference]: Start difference. First operand has 62 places, 54 transitions, 242 flow. Second operand 3 states and 367 transitions.
[2023-10-25 15:19:21,477 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 76 transitions, 460 flow
[2023-10-25 15:19:21,487 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 76 transitions, 451 flow, removed 2 selfloop flow, removed 1 redundant places.
[2023-10-25 15:19:21,495 INFO  L231             Difference]: Finished difference. Result has 65 places, 59 transitions, 311 flow
[2023-10-25 15:19:21,497 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=311, PETRI_PLACES=65, PETRI_TRANSITIONS=59}
[2023-10-25 15:19:21,498 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places.
[2023-10-25 15:19:21,498 INFO  L495      AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 311 flow
[2023-10-25 15:19:21,498 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:21,498 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:21,498 INFO  L209   CegarLoopForPetriNet]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:19:21,498 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2023-10-25 15:19:21,499 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-10-25 15:19:21,499 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:21,499 INFO  L85        PathProgramCache]: Analyzing trace with hash 944452700, now seen corresponding path program 1 times
[2023-10-25 15:19:21,500 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:21,500 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875849500]
[2023-10-25 15:19:21,500 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:21,500 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:21,515 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:19:21,616 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:19:21,616 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:19:21,616 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875849500]
[2023-10-25 15:19:21,617 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875849500] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:19:21,617 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024721513]
[2023-10-25 15:19:21,617 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:21,617 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:19:21,617 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:19:21,635 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:19:21,677 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-10-25 15:19:21,759 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:19:21,761 INFO  L263         TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core
[2023-10-25 15:19:21,763 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:19:22,019 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:19:22,028 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-25 15:19:22,028 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024721513] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:19:22,029 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-25 15:19:22,029 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11
[2023-10-25 15:19:22,029 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707994076]
[2023-10-25 15:19:22,029 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:19:22,029 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-10-25 15:19:22,029 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:19:22,030 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-10-25 15:19:22,030 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132
[2023-10-25 15:19:22,079 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 105 out of 196
[2023-10-25 15:19:22,080 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 311 flow. Second operand  has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:22,080 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:19:22,087 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 196
[2023-10-25 15:19:22,087 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:19:22,991 INFO  L130       PetriNetUnfolder]: 3812/9141 cut-off events.
[2023-10-25 15:19:22,991 INFO  L131       PetriNetUnfolder]: For 9895/10505 co-relation queries the response was YES.
[2023-10-25 15:19:23,006 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26314 conditions, 9141 events. 3812/9141 cut-off events. For 9895/10505 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 81025 event pairs, 495 based on Foata normal form. 409/9377 useless extension candidates. Maximal degree in co-relation 12220. Up to 5596 conditions per place. 
[2023-10-25 15:19:23,019 INFO  L137   encePairwiseOnDemand]: 193/196 looper letters, 113 selfloop transitions, 5 changer transitions 10/143 dead transitions.
[2023-10-25 15:19:23,020 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 143 transitions, 941 flow
[2023-10-25 15:19:23,020 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-25 15:19:23,020 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-25 15:19:23,022 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 839 transitions.
[2023-10-25 15:19:23,022 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6115160349854227
[2023-10-25 15:19:23,022 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 839 transitions.
[2023-10-25 15:19:23,022 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 839 transitions.
[2023-10-25 15:19:23,023 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:19:23,023 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 839 transitions.
[2023-10-25 15:19:23,025 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 119.85714285714286) internal successors, (839), 7 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:23,042 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 196.0) internal successors, (1568), 8 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:23,043 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 196.0) internal successors, (1568), 8 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:23,043 INFO  L175             Difference]: Start difference. First operand has 65 places, 59 transitions, 311 flow. Second operand 7 states and 839 transitions.
[2023-10-25 15:19:23,048 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 143 transitions, 941 flow
[2023-10-25 15:19:23,084 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 143 transitions, 899 flow, removed 0 selfloop flow, removed 4 redundant places.
[2023-10-25 15:19:23,085 INFO  L231             Difference]: Finished difference. Result has 67 places, 60 transitions, 300 flow
[2023-10-25 15:19:23,085 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=300, PETRI_PLACES=67, PETRI_TRANSITIONS=60}
[2023-10-25 15:19:23,086 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places.
[2023-10-25 15:19:23,086 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 60 transitions, 300 flow
[2023-10-25 15:19:23,086 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:23,086 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:23,087 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:19:23,094 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2023-10-25 15:19:23,291 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20
[2023-10-25 15:19:23,292 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-10-25 15:19:23,292 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:23,292 INFO  L85        PathProgramCache]: Analyzing trace with hash 949438609, now seen corresponding path program 1 times
[2023-10-25 15:19:23,292 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:23,293 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434861089]
[2023-10-25 15:19:23,293 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:23,293 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:23,306 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:19:23,332 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2023-10-25 15:19:23,333 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:19:23,333 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434861089]
[2023-10-25 15:19:23,333 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434861089] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:19:23,333 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:19:23,333 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:19:23,334 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326935983]
[2023-10-25 15:19:23,334 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:19:23,334 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:19:23,334 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:19:23,335 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:19:23,335 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:19:23,364 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 196
[2023-10-25 15:19:23,364 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 60 transitions, 300 flow. Second operand  has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:23,364 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:19:23,365 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 196
[2023-10-25 15:19:23,365 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:19:24,697 INFO  L130       PetriNetUnfolder]: 4370/10023 cut-off events.
[2023-10-25 15:19:24,697 INFO  L131       PetriNetUnfolder]: For 12518/12596 co-relation queries the response was YES.
[2023-10-25 15:19:24,710 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29611 conditions, 10023 events. 4370/10023 cut-off events. For 12518/12596 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 88454 event pairs, 3427 based on Foata normal form. 0/9748 useless extension candidates. Maximal degree in co-relation 6469. Up to 8591 conditions per place. 
[2023-10-25 15:19:24,724 INFO  L137   encePairwiseOnDemand]: 192/196 looper letters, 58 selfloop transitions, 4 changer transitions 1/71 dead transitions.
[2023-10-25 15:19:24,724 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 71 transitions, 480 flow
[2023-10-25 15:19:24,725 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:19:24,725 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:19:24,735 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions.
[2023-10-25 15:19:24,735 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5918367346938775
[2023-10-25 15:19:24,735 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 348 transitions.
[2023-10-25 15:19:24,738 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions.
[2023-10-25 15:19:24,738 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:19:24,738 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions.
[2023-10-25 15:19:24,744 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:24,745 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:24,746 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:24,746 INFO  L175             Difference]: Start difference. First operand has 67 places, 60 transitions, 300 flow. Second operand 3 states and 348 transitions.
[2023-10-25 15:19:24,746 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 71 transitions, 480 flow
[2023-10-25 15:19:24,754 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 71 transitions, 477 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:19:24,755 INFO  L231             Difference]: Finished difference. Result has 68 places, 62 transitions, 329 flow
[2023-10-25 15:19:24,755 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=329, PETRI_PLACES=68, PETRI_TRANSITIONS=62}
[2023-10-25 15:19:24,756 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 17 predicate places.
[2023-10-25 15:19:24,756 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 329 flow
[2023-10-25 15:19:24,756 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:24,756 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:24,756 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:19:24,756 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2023-10-25 15:19:24,757 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-10-25 15:19:24,757 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:24,757 INFO  L85        PathProgramCache]: Analyzing trace with hash -775708388, now seen corresponding path program 1 times
[2023-10-25 15:19:24,757 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:24,757 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976733965]
[2023-10-25 15:19:24,757 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:24,758 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:24,792 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:19:24,861 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-25 15:19:24,861 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:19:24,861 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976733965]
[2023-10-25 15:19:24,861 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976733965] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:19:24,861 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224883735]
[2023-10-25 15:19:24,861 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:24,862 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:19:24,862 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:19:24,878 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:19:24,913 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-10-25 15:19:24,987 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:19:24,999 INFO  L263         TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjunts are in the unsatisfiable core
[2023-10-25 15:19:25,001 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:19:25,104 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-25 15:19:25,104 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:19:25,149 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-25 15:19:25,149 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [224883735] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:19:25,149 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:19:25,149 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8
[2023-10-25 15:19:25,150 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223815733]
[2023-10-25 15:19:25,151 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:19:25,151 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-10-25 15:19:25,151 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:19:25,151 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-10-25 15:19:25,152 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72
[2023-10-25 15:19:25,201 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 196
[2023-10-25 15:19:25,202 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 329 flow. Second operand  has 9 states, 9 states have (on average 107.11111111111111) internal successors, (964), 9 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:25,202 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:19:25,202 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 196
[2023-10-25 15:19:25,202 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:19:25,949 INFO  L130       PetriNetUnfolder]: 3219/7555 cut-off events.
[2023-10-25 15:19:25,950 INFO  L131       PetriNetUnfolder]: For 8668/9276 co-relation queries the response was YES.
[2023-10-25 15:19:25,958 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21935 conditions, 7555 events. 3219/7555 cut-off events. For 8668/9276 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 64563 event pairs, 419 based on Foata normal form. 356/7665 useless extension candidates. Maximal degree in co-relation 7914. Up to 5708 conditions per place. 
[2023-10-25 15:19:25,966 INFO  L137   encePairwiseOnDemand]: 193/196 looper letters, 88 selfloop transitions, 5 changer transitions 0/108 dead transitions.
[2023-10-25 15:19:25,967 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 108 transitions, 678 flow
[2023-10-25 15:19:25,967 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 15:19:25,967 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 15:19:25,968 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 703 transitions.
[2023-10-25 15:19:25,968 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5977891156462585
[2023-10-25 15:19:25,968 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 703 transitions.
[2023-10-25 15:19:25,968 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 703 transitions.
[2023-10-25 15:19:25,969 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:19:25,969 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 703 transitions.
[2023-10-25 15:19:25,980 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:25,985 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 196.0) internal successors, (1372), 7 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:25,985 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 196.0) internal successors, (1372), 7 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:25,985 INFO  L175             Difference]: Start difference. First operand has 68 places, 62 transitions, 329 flow. Second operand 6 states and 703 transitions.
[2023-10-25 15:19:25,985 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 108 transitions, 678 flow
[2023-10-25 15:19:25,993 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 108 transitions, 661 flow, removed 6 selfloop flow, removed 1 redundant places.
[2023-10-25 15:19:25,997 INFO  L231             Difference]: Finished difference. Result has 75 places, 62 transitions, 335 flow
[2023-10-25 15:19:25,997 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=335, PETRI_PLACES=75, PETRI_TRANSITIONS=62}
[2023-10-25 15:19:25,997 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 24 predicate places.
[2023-10-25 15:19:25,998 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 62 transitions, 335 flow
[2023-10-25 15:19:26,015 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 107.11111111111111) internal successors, (964), 9 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:26,015 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:26,015 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:19:26,026 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2023-10-25 15:19:26,219 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:19:26,220 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-10-25 15:19:26,220 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:26,220 INFO  L85        PathProgramCache]: Analyzing trace with hash -521985787, now seen corresponding path program 1 times
[2023-10-25 15:19:26,221 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:26,221 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517920639]
[2023-10-25 15:19:26,221 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:26,221 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:26,256 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:19:26,329 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2023-10-25 15:19:26,330 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:19:26,330 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517920639]
[2023-10-25 15:19:26,330 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517920639] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:19:26,330 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736606086]
[2023-10-25 15:19:26,330 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:26,330 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:19:26,331 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:19:26,340 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:19:26,386 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-10-25 15:19:26,470 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:19:26,471 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-25 15:19:26,472 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:19:26,541 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2023-10-25 15:19:26,542 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:19:26,616 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2023-10-25 15:19:26,616 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [736606086] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:19:26,616 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:19:26,616 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8
[2023-10-25 15:19:26,617 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696895631]
[2023-10-25 15:19:26,617 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:19:26,618 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-10-25 15:19:26,618 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:19:26,618 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-10-25 15:19:26,618 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72
[2023-10-25 15:19:26,734 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 196
[2023-10-25 15:19:26,735 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 62 transitions, 335 flow. Second operand  has 9 states, 9 states have (on average 107.77777777777777) internal successors, (970), 9 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:26,735 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:19:26,735 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 196
[2023-10-25 15:19:26,735 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:19:27,235 INFO  L130       PetriNetUnfolder]: 1817/3995 cut-off events.
[2023-10-25 15:19:27,236 INFO  L131       PetriNetUnfolder]: For 8368/8826 co-relation queries the response was YES.
[2023-10-25 15:19:27,240 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11449 conditions, 3995 events. 1817/3995 cut-off events. For 8368/8826 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 27298 event pairs, 425 based on Foata normal form. 589/4572 useless extension candidates. Maximal degree in co-relation 5233. Up to 1090 conditions per place. 
[2023-10-25 15:19:27,245 INFO  L137   encePairwiseOnDemand]: 191/196 looper letters, 99 selfloop transitions, 5 changer transitions 7/125 dead transitions.
[2023-10-25 15:19:27,246 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 125 transitions, 775 flow
[2023-10-25 15:19:27,246 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 15:19:27,246 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 15:19:27,247 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 717 transitions.
[2023-10-25 15:19:27,247 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6096938775510204
[2023-10-25 15:19:27,247 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 717 transitions.
[2023-10-25 15:19:27,247 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 717 transitions.
[2023-10-25 15:19:27,248 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:19:27,248 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 717 transitions.
[2023-10-25 15:19:27,249 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:27,250 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 196.0) internal successors, (1372), 7 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:27,250 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 196.0) internal successors, (1372), 7 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:27,250 INFO  L175             Difference]: Start difference. First operand has 75 places, 62 transitions, 335 flow. Second operand 6 states and 717 transitions.
[2023-10-25 15:19:27,251 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 125 transitions, 775 flow
[2023-10-25 15:19:27,255 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 125 transitions, 765 flow, removed 0 selfloop flow, removed 5 redundant places.
[2023-10-25 15:19:27,256 INFO  L231             Difference]: Finished difference. Result has 78 places, 57 transitions, 343 flow
[2023-10-25 15:19:27,257 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=343, PETRI_PLACES=78, PETRI_TRANSITIONS=57}
[2023-10-25 15:19:27,257 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 27 predicate places.
[2023-10-25 15:19:27,257 INFO  L495      AbstractCegarLoop]: Abstraction has has 78 places, 57 transitions, 343 flow
[2023-10-25 15:19:27,257 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 107.77777777777777) internal successors, (970), 9 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:27,258 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:19:27,258 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:19:27,264 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2023-10-25 15:19:27,462 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23
[2023-10-25 15:19:27,462 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-10-25 15:19:27,463 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:19:27,463 INFO  L85        PathProgramCache]: Analyzing trace with hash -1647090250, now seen corresponding path program 1 times
[2023-10-25 15:19:27,463 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:19:27,463 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859559500]
[2023-10-25 15:19:27,464 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:19:27,464 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:19:27,569 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:19:27,569 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-25 15:19:27,627 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:19:27,635 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-25 15:19:27,635 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-25 15:19:27,636 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 8 remaining)
[2023-10-25 15:19:27,636 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining)
[2023-10-25 15:19:27,636 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining)
[2023-10-25 15:19:27,636 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining)
[2023-10-25 15:19:27,636 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining)
[2023-10-25 15:19:27,636 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining)
[2023-10-25 15:19:27,636 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining)
[2023-10-25 15:19:27,637 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining)
[2023-10-25 15:19:27,637 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2023-10-25 15:19:27,637 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:19:27,640 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances
[2023-10-25 15:19:27,661 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2023-10-25 15:19:27,792 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 03:19:27 BasicIcfg
[2023-10-25 15:19:27,796 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-10-25 15:19:27,797 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2023-10-25 15:19:27,797 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2023-10-25 15:19:27,797 INFO  L275        PluginConnector]: Witness Printer initialized
[2023-10-25 15:19:27,798 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 03:18:38" (3/4) ...
[2023-10-25 15:19:27,801 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2023-10-25 15:19:27,817 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-10-25 15:19:27,818 INFO  L158              Benchmark]: Toolchain (without parser) took 50801.16ms. Allocated memory was 46.2MB in the beginning and 926.8MB in the end (delta: 880.6MB). Free memory was 25.2MB in the beginning and 699.1MB in the end (delta: -673.9MB). Peak memory consumption was 206.7MB. Max. memory is 15.6GB.
[2023-10-25 15:19:27,819 INFO  L158              Benchmark]: CDTParser took 0.14ms. Allocated memory is still 41.4MB. Free memory was 16.6MB in the beginning and 16.6MB in the end (delta: 1.6kB). Peak memory consumption was 1.6kB. Max. memory is 15.6GB.
[2023-10-25 15:19:27,820 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 655.91ms. Allocated memory is still 46.2MB. Free memory was 25.1MB in the beginning and 18.0MB in the end (delta: 7.0MB). Peak memory consumption was 13.5MB. Max. memory is 15.6GB.
[2023-10-25 15:19:27,821 INFO  L158              Benchmark]: Boogie Procedure Inliner took 58.29ms. Allocated memory is still 46.2MB. Free memory was 18.0MB in the beginning and 16.1MB in the end (delta: 1.9MB). Peak memory consumption was 1.9MB. Max. memory is 15.6GB.
[2023-10-25 15:19:27,821 INFO  L158              Benchmark]: Boogie Preprocessor took 69.77ms. Allocated memory is still 46.2MB. Free memory was 16.1MB in the beginning and 14.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.6MB. Max. memory is 15.6GB.
[2023-10-25 15:19:27,822 INFO  L158              Benchmark]: RCFGBuilder took 604.43ms. Allocated memory is still 46.2MB. Free memory was 14.5MB in the beginning and 14.4MB in the end (delta: 172.5kB). Peak memory consumption was 3.4MB. Max. memory is 15.6GB.
[2023-10-25 15:19:27,823 INFO  L158              Benchmark]: TraceAbstraction took 49386.97ms. Allocated memory was 46.2MB in the beginning and 926.8MB in the end (delta: 880.6MB). Free memory was 13.5MB in the beginning and 699.1MB in the end (delta: -685.5MB). Peak memory consumption was 195.0MB. Max. memory is 15.6GB.
[2023-10-25 15:19:27,823 INFO  L158              Benchmark]: Witness Printer took 21.23ms. Allocated memory is still 926.8MB. Free memory is still 699.1MB. There was no memory consumed. Max. memory is 15.6GB.
[2023-10-25 15:19:27,824 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.14ms. Allocated memory is still 41.4MB. Free memory was 16.6MB in the beginning and 16.6MB in the end (delta: 1.6kB). Peak memory consumption was 1.6kB. Max. memory is 15.6GB.
 * CACSL2BoogieTranslator took 655.91ms. Allocated memory is still 46.2MB. Free memory was 25.1MB in the beginning and 18.0MB in the end (delta: 7.0MB). Peak memory consumption was 13.5MB. Max. memory is 15.6GB.
 * Boogie Procedure Inliner took 58.29ms. Allocated memory is still 46.2MB. Free memory was 18.0MB in the beginning and 16.1MB in the end (delta: 1.9MB). Peak memory consumption was 1.9MB. Max. memory is 15.6GB.
 * Boogie Preprocessor took 69.77ms. Allocated memory is still 46.2MB. Free memory was 16.1MB in the beginning and 14.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.6MB. Max. memory is 15.6GB.
 * RCFGBuilder took 604.43ms. Allocated memory is still 46.2MB. Free memory was 14.5MB in the beginning and 14.4MB in the end (delta: 172.5kB). Peak memory consumption was 3.4MB. Max. memory is 15.6GB.
 * TraceAbstraction took 49386.97ms. Allocated memory was 46.2MB in the beginning and 926.8MB in the end (delta: 880.6MB). Free memory was 13.5MB in the beginning and 699.1MB in the end (delta: -685.5MB). Peak memory consumption was 195.0MB. Max. memory is 15.6GB.
 * Witness Printer took 21.23ms. Allocated memory is still 926.8MB. Free memory is still 699.1MB. There was no memory consumed. Max. memory is 15.6GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 2.1s, 71 PlacesBefore, 20 PlacesAfterwards, 71 TransitionsBefore, 18 TransitionsAfterwards, 896 CoEnabledTransitionPairs, 6 FixpointIterations, 21 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 56 TotalNumberOfCompositions, 1340 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1019, independent: 943, independent conditional: 0, independent unconditional: 943, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 494, independent: 484, independent conditional: 0, independent unconditional: 484, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1019, independent: 459, independent conditional: 0, independent unconditional: 459, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 494, unknown conditional: 0, unknown unconditional: 494] , Statistics on independence cache: Total cache size (in pairs): 33, Positive cache size: 28, Positive conditional cache size: 0, Positive unconditional cache size: 28, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 1.9s, 88 PlacesBefore, 33 PlacesAfterwards, 87 TransitionsBefore, 30 TransitionsAfterwards, 2492 CoEnabledTransitionPairs, 5 FixpointIterations, 18 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 61 TotalNumberOfCompositions, 5100 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3007, independent: 2868, independent conditional: 0, independent unconditional: 2868, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1300, independent: 1275, independent conditional: 0, independent unconditional: 1275, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3007, independent: 1593, independent conditional: 0, independent unconditional: 1593, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 1300, unknown conditional: 0, unknown unconditional: 1300] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 119, Positive conditional cache size: 0, Positive unconditional cache size: 119, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 1.9s, 105 PlacesBefore, 42 PlacesAfterwards, 103 TransitionsBefore, 38 TransitionsAfterwards, 4452 CoEnabledTransitionPairs, 6 FixpointIterations, 18 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 69 TotalNumberOfCompositions, 11117 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5556, independent: 5322, independent conditional: 0, independent unconditional: 5322, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2167, independent: 2131, independent conditional: 0, independent unconditional: 2131, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5556, independent: 3191, independent conditional: 0, independent unconditional: 3191, dependent: 198, dependent conditional: 0, dependent unconditional: 198, unknown: 2167, unknown conditional: 0, unknown unconditional: 2167] , Statistics on independence cache: Total cache size (in pairs): 175, Positive cache size: 155, Positive conditional cache size: 0, Positive unconditional cache size: 155, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 2.2s, 122 PlacesBefore, 51 PlacesAfterwards, 119 TransitionsBefore, 46 TransitionsAfterwards, 6888 CoEnabledTransitionPairs, 5 FixpointIterations, 18 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 77 TotalNumberOfCompositions, 17075 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8478, independent: 8216, independent conditional: 0, independent unconditional: 8216, dependent: 262, dependent conditional: 0, dependent unconditional: 262, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3480, independent: 3427, independent conditional: 0, independent unconditional: 3427, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8478, independent: 4789, independent conditional: 0, independent unconditional: 4789, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 3480, unknown conditional: 0, unknown unconditional: 3480] , Statistics on independence cache: Total cache size (in pairs): 405, Positive cache size: 375, Positive conditional cache size: 0, Positive unconditional cache size: 375, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - DataRaceFoundResult [Line: 677]: Data race detected
    Data race detected
The following path leads to a data race: 
[L673]               0  int data = 0;
[L674]               0  pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } };
[L682]               0  int threads_total = 4;
[L683]               0  pthread_t tids[4];
[L684]               0  int i = 0;
        VAL             [data=0, data_mutex={1:0}, i=0, threads_total=4, tids={13:0}]
[L684]  COND TRUE    0  i < threads_total
[L685]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [arg={0:0}, data=0, data_mutex={1:0}, i=0, pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))=17, threads_total=4, tids={13:0}]
[L684]               0  i++
        VAL             [arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={13:0}]
[L684]  COND TRUE    0  i < threads_total
[L677]               1  data = __VERIFIER_nondet_int()
[L685]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))=18, threads_total=4, tids={13:0}]
[L684]               0  i++
        VAL             [arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={13:0}]
[L684]  COND TRUE    0  i < threads_total
[L679]               1  return ((void *)0);
[L677]               2  data = __VERIFIER_nondet_int()
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=-1, arg={0:0}, arg={0:0}, data=-1, data = __VERIFIER_nondet_int()=26, data_mutex={1:0}]
[L685]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=-1, arg={0:0}, arg={0:0}, data=-1, data = __VERIFIER_nondet_int()=26, data_mutex={1:0}, i=2, pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))=19, threads_total=4, tids={13:0}]
[L684]               0  i++
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=-1, arg={0:0}, arg={0:0}, data=-1, data = __VERIFIER_nondet_int()=26, data_mutex={1:0}, i=3, threads_total=4, tids={13:0}]
[L684]  COND TRUE    0  i < threads_total
[L677]               2  data = __VERIFIER_nondet_int()
[L679]               2  return ((void *)0);
[L677]               3  data = __VERIFIER_nondet_int()
[L685]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))=20, threads_total=4, tids={13:0}]
[L684]               0  i++
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, threads_total=4, tids={13:0}]
[L679]               3  return ((void *)0);
[L677]               4  data = __VERIFIER_nondet_int()
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]
[L684]  COND FALSE   0  !(i < threads_total)
[L687]               0  int i = 0;
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, i=4, threads_total=4, tids={13:0}]
[L687]  COND TRUE    0  i < threads_total - 1
[L688]  EXPR         0  tids[i]
[L688]               0  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, i=4, threads_total=4, tids={13:0}, tids[i]=17]
[L688]  FCALL, JOIN  1  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, i=0, threads_total=4, tids={13:0}, tids[i]=17]
[L687]               0  i++
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, i=4, threads_total=4, tids={13:0}]
[L687]  COND TRUE    0  i < threads_total - 1
[L688]  EXPR         0  tids[i]
[L688]               0  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, i=1, threads_total=4, tids={13:0}, tids[i]=18]
[L688]  FCALL, JOIN  2  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, i=4, threads_total=4, tids={13:0}, tids[i]=18]
[L687]               0  i++
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, i=2, threads_total=4, tids={13:0}]
[L687]  COND TRUE    0  i < threads_total - 1
[L688]  EXPR         0  tids[i]
[L688]               0  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, i=2, threads_total=4, tids={13:0}, tids[i]=19]
[L688]  FCALL, JOIN  3  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, i=2, threads_total=4, tids={13:0}, tids[i]=19]
[L687]               0  i++
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, i=4, threads_total=4, tids={13:0}]
[L677]               4  data = __VERIFIER_nondet_int()
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data = __VERIFIER_nondet_int()=25, data_mutex={1:0}]
[L687]  COND FALSE   0  !(i < threads_total - 1)
[L690]               0  return data;
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data = __VERIFIER_nondet_int()=25, data_mutex={1:0}, i=3, i=4, threads_total=4, tids={13:0}]
[L677]               4  data = __VERIFIER_nondet_int()
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data = __VERIFIER_nondet_int()=25, data_mutex={1:0}]

Now there is a data race on ~data~0 between 
	C: return data; [690]
and
	C: data = __VERIFIER_nondet_int() [677]

  - UnprovableResult [Line: 690]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 688]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 685]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 3 procedures, 84 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.2s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 84 IncrementalHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 20 mSDtfsCounter, 84 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 15 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances
    CFG has 4 procedures, 99 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.0s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 144 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 84 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 224 IncrementalHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 3 mSDtfsCounter, 224 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=3, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 39 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances
    CFG has 5 procedures, 114 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.6s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 259 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 157 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 448 IncrementalHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 17 mSDtfsCounter, 448 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=240occurred in iteration=4, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 88 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 5/5 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data with 4 thread instances
    CFG has 6 procedures, 129 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 35.2s, OverallIterations: 12, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 30.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 972 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 723 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1645 IncrementalHoareTripleChecker+Invalid, 1698 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 66 mSDtfsCounter, 1645 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 159 GetRequests, 122 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=343occurred in iteration=11, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 284 ConstructedInterpolants, 0 QuantifiedInterpolants, 918 SizeOfPredicates, 6 NumberOfNonLiveVariables, 460 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 171/205 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2023-10-25 15:19:27,995 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE
