./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac50a0f4-d198-4918-89f6-0a4f5e5e782e/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac50a0f4-d198-4918-89f6-0a4f5e5e782e/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac50a0f4-d198-4918-89f6-0a4f5e5e782e/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac50a0f4-d198-4918-89f6-0a4f5e5e782e/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-4.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac50a0f4-d198-4918-89f6-0a4f5e5e782e/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac50a0f4-d198-4918-89f6-0a4f5e5e782e/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --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 cc2bc8e2b738274330116922d0213f314e2f92c105156edd0131038d71009ecb --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 23:19:19,259 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 23:19:19,332 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac50a0f4-d198-4918-89f6-0a4f5e5e782e/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-27 23:19:19,337 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 23:19:19,337 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 23:19:19,362 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 23:19:19,363 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 23:19:19,363 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 23:19:19,364 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 23:19:19,364 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 23:19:19,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 23:19:19,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 23:19:19,365 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 23:19:19,365 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 23:19:19,365 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 23:19:19,365 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 23:19:19,365 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 23:19:19,365 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 23:19:19,366 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 23:19:19,366 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 23:19:19,366 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 23:19:19,366 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 23:19:19,366 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-27 23:19:19,366 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 23:19:19,366 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 23:19:19,367 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 23:19:19,367 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 23:19:19,367 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 23:19:19,367 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 23:19:19,367 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:19:19,367 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:19:19,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:19:19,368 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 23:19:19,368 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:19:19,368 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:19:19,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:19:19,368 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 23:19:19,368 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 23:19:19,368 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 23:19:19,369 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 23:19:19,369 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 23:19:19,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 23:19:19,369 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 23:19:19,369 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 23:19:19,369 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 23:19:19,369 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 23:19:19,369 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac50a0f4-d198-4918-89f6-0a4f5e5e782e/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> cc2bc8e2b738274330116922d0213f314e2f92c105156edd0131038d71009ecb [2024-11-27 23:19:19,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 23:19:19,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 23:19:19,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 23:19:19,691 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 23:19:19,692 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 23:19:19,693 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac50a0f4-d198-4918-89f6-0a4f5e5e782e/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-4.i [2024-11-27 23:19:22,658 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac50a0f4-d198-4918-89f6-0a4f5e5e782e/bin/uautomizer-verify-aQ6SnzHsRB/data/7af74f7ae/08ad3c8d277949ab874e425d0894a488/FLAG8541de77d [2024-11-27 23:19:23,097 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 23:19:23,098 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac50a0f4-d198-4918-89f6-0a4f5e5e782e/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-4.i [2024-11-27 23:19:23,121 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac50a0f4-d198-4918-89f6-0a4f5e5e782e/bin/uautomizer-verify-aQ6SnzHsRB/data/7af74f7ae/08ad3c8d277949ab874e425d0894a488/FLAG8541de77d [2024-11-27 23:19:23,146 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac50a0f4-d198-4918-89f6-0a4f5e5e782e/bin/uautomizer-verify-aQ6SnzHsRB/data/7af74f7ae/08ad3c8d277949ab874e425d0894a488 [2024-11-27 23:19:23,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 23:19:23,154 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 23:19:23,156 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 23:19:23,157 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 23:19:23,162 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 23:19:23,163 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:19:23" (1/1) ... [2024-11-27 23:19:23,164 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9497a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:19:23, skipping insertion in model container [2024-11-27 23:19:23,164 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:19:23" (1/1) ... [2024-11-27 23:19:23,209 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 23:19:23,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:19:23,639 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 23:19:23,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:19:23,739 INFO L204 MainTranslator]: Completed translation [2024-11-27 23:19:23,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:19:23 WrapperNode [2024-11-27 23:19:23,741 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 23:19:23,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 23:19:23,742 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 23:19:23,742 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 23:19:23,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:19:23" (1/1) ... [2024-11-27 23:19:23,765 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:19:23" (1/1) ... [2024-11-27 23:19:23,794 INFO L138 Inliner]: procedures = 159, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 196 [2024-11-27 23:19:23,797 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 23:19:23,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 23:19:23,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 23:19:23,798 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 23:19:23,806 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:19:23" (1/1) ... [2024-11-27 23:19:23,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:19:23" (1/1) ... [2024-11-27 23:19:23,810 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:19:23" (1/1) ... [2024-11-27 23:19:23,813 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:19:23" (1/1) ... [2024-11-27 23:19:23,827 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:19:23" (1/1) ... [2024-11-27 23:19:23,828 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:19:23" (1/1) ... [2024-11-27 23:19:23,835 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:19:23" (1/1) ... [2024-11-27 23:19:23,843 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:19:23" (1/1) ... [2024-11-27 23:19:23,844 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:19:23" (1/1) ... [2024-11-27 23:19:23,851 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 23:19:23,851 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 23:19:23,852 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 23:19:23,852 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 23:19:23,853 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:19:23" (1/1) ... [2024-11-27 23:19:23,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:19:23,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac50a0f4-d198-4918-89f6-0a4f5e5e782e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:19:23,894 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac50a0f4-d198-4918-89f6-0a4f5e5e782e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 23:19:23,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac50a0f4-d198-4918-89f6-0a4f5e5e782e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 23:19:23,922 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-27 23:19:23,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 23:19:23,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-27 23:19:23,923 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-27 23:19:23,923 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-27 23:19:23,923 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-27 23:19:23,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 23:19:23,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 23:19:23,924 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-27 23:19:24,095 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 23:19:24,097 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 23:19:24,566 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-27 23:19:24,567 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 23:19:24,606 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 23:19:24,606 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-27 23:19:24,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:19:24 BoogieIcfgContainer [2024-11-27 23:19:24,607 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 23:19:24,609 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 23:19:24,609 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 23:19:24,615 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 23:19:24,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:19:23" (1/3) ... [2024-11-27 23:19:24,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b589681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:19:24, skipping insertion in model container [2024-11-27 23:19:24,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:19:23" (2/3) ... [2024-11-27 23:19:24,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b589681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:19:24, skipping insertion in model container [2024-11-27 23:19:24,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:19:24" (3/3) ... [2024-11-27 23:19:24,617 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race-4.i [2024-11-27 23:19:24,634 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 23:19:24,635 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-counter-outer-race-4.i that has 2 procedures, 228 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2024-11-27 23:19:24,635 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-27 23:19:24,714 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-27 23:19:24,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 231 places, 232 transitions, 468 flow [2024-11-27 23:19:24,905 INFO L124 PetriNetUnfolderBase]: 7/274 cut-off events. [2024-11-27 23:19:24,907 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 23:19:24,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 274 events. 7/274 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 238 event pairs, 0 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 193. Up to 4 conditions per place. [2024-11-27 23:19:24,914 INFO L82 GeneralOperation]: Start removeDead. Operand has 231 places, 232 transitions, 468 flow [2024-11-27 23:19:24,920 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 231 places, 232 transitions, 468 flow [2024-11-27 23:19:24,928 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 23:19:24,940 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@741b57da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 23:19:24,941 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-27 23:19:24,988 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-27 23:19:24,988 INFO L124 PetriNetUnfolderBase]: 2/162 cut-off events. [2024-11-27 23:19:24,988 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 23:19:24,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:19:24,991 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:19:24,992 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-27 23:19:25,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:19:25,000 INFO L85 PathProgramCache]: Analyzing trace with hash 2028486066, now seen corresponding path program 1 times [2024-11-27 23:19:25,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:19:25,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838379566] [2024-11-27 23:19:25,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:19:25,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:19:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:19:25,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:19:25,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:19:25,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838379566] [2024-11-27 23:19:25,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838379566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:19:25,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:19:25,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:19:25,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565519464] [2024-11-27 23:19:25,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:19:25,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:19:25,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:19:25,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:19:25,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:19:25,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 232 [2024-11-27 23:19:25,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 232 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 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) [2024-11-27 23:19:25,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:19:25,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 232 [2024-11-27 23:19:25,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:19:25,957 INFO L124 PetriNetUnfolderBase]: 98/684 cut-off events. [2024-11-27 23:19:25,958 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-27 23:19:25,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 684 events. 98/684 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3145 event pairs, 33 based on Foata normal form. 9/637 useless extension candidates. Maximal degree in co-relation 707. Up to 138 conditions per place. [2024-11-27 23:19:25,968 INFO L140 encePairwiseOnDemand]: 218/232 looper letters, 32 selfloop transitions, 8 changer transitions 1/247 dead transitions. [2024-11-27 23:19:25,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 247 transitions, 578 flow [2024-11-27 23:19:25,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:19:25,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:19:25,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 669 transitions. [2024-11-27 23:19:25,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9612068965517241 [2024-11-27 23:19:25,994 INFO L175 Difference]: Start difference. First operand has 231 places, 232 transitions, 468 flow. Second operand 3 states and 669 transitions. [2024-11-27 23:19:25,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 247 transitions, 578 flow [2024-11-27 23:19:26,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 247 transitions, 578 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-27 23:19:26,011 INFO L231 Difference]: Finished difference. Result has 235 places, 236 transitions, 530 flow [2024-11-27 23:19:26,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=235, PETRI_TRANSITIONS=236} [2024-11-27 23:19:26,020 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 4 predicate places. [2024-11-27 23:19:26,022 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 236 transitions, 530 flow [2024-11-27 23:19:26,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 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) [2024-11-27 23:19:26,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:19:26,025 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:19:26,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 23:19:26,025 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-27 23:19:26,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:19:26,029 INFO L85 PathProgramCache]: Analyzing trace with hash 939832752, now seen corresponding path program 1 times [2024-11-27 23:19:26,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:19:26,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910663712] [2024-11-27 23:19:26,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:19:26,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:19:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:19:26,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:19:26,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:19:26,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910663712] [2024-11-27 23:19:26,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910663712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:19:26,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:19:26,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:19:26,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112938764] [2024-11-27 23:19:26,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:19:26,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:19:26,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:19:26,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:19:26,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:19:26,360 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 232 [2024-11-27 23:19:26,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 236 transitions, 530 flow. Second operand has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 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) [2024-11-27 23:19:26,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:19:26,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 232 [2024-11-27 23:19:26,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:19:26,630 INFO L124 PetriNetUnfolderBase]: 114/812 cut-off events. [2024-11-27 23:19:26,630 INFO L125 PetriNetUnfolderBase]: For 164/171 co-relation queries the response was YES. [2024-11-27 23:19:26,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 812 events. 114/812 cut-off events. For 164/171 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4196 event pairs, 72 based on Foata normal form. 5/762 useless extension candidates. Maximal degree in co-relation 1025. Up to 226 conditions per place. [2024-11-27 23:19:26,638 INFO L140 encePairwiseOnDemand]: 226/232 looper letters, 29 selfloop transitions, 7 changer transitions 0/245 dead transitions. [2024-11-27 23:19:26,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 245 transitions, 630 flow [2024-11-27 23:19:26,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:19:26,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:19:26,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 652 transitions. [2024-11-27 23:19:26,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9367816091954023 [2024-11-27 23:19:26,641 INFO L175 Difference]: Start difference. First operand has 235 places, 236 transitions, 530 flow. Second operand 3 states and 652 transitions. [2024-11-27 23:19:26,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 245 transitions, 630 flow [2024-11-27 23:19:26,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 245 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:19:26,654 INFO L231 Difference]: Finished difference. Result has 236 places, 241 transitions, 570 flow [2024-11-27 23:19:26,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=236, PETRI_TRANSITIONS=241} [2024-11-27 23:19:26,657 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 5 predicate places. [2024-11-27 23:19:26,660 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 241 transitions, 570 flow [2024-11-27 23:19:26,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 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) [2024-11-27 23:19:26,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:19:26,661 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:19:26,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 23:19:26,661 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-27 23:19:26,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:19:26,663 INFO L85 PathProgramCache]: Analyzing trace with hash -883348309, now seen corresponding path program 1 times [2024-11-27 23:19:26,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:19:26,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544321867] [2024-11-27 23:19:26,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:19:26,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:19:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:19:26,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:19:26,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:19:26,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544321867] [2024-11-27 23:19:26,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544321867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:19:26,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:19:26,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:19:26,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883735194] [2024-11-27 23:19:26,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:19:26,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:19:26,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:19:26,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:19:26,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:19:26,872 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 232 [2024-11-27 23:19:26,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 241 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 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) [2024-11-27 23:19:26,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:19:26,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 232 [2024-11-27 23:19:26,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:19:27,087 INFO L124 PetriNetUnfolderBase]: 83/734 cut-off events. [2024-11-27 23:19:27,089 INFO L125 PetriNetUnfolderBase]: For 64/67 co-relation queries the response was YES. [2024-11-27 23:19:27,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 734 events. 83/734 cut-off events. For 64/67 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3728 event pairs, 45 based on Foata normal form. 0/674 useless extension candidates. Maximal degree in co-relation 838. Up to 114 conditions per place. [2024-11-27 23:19:27,094 INFO L140 encePairwiseOnDemand]: 228/232 looper letters, 17 selfloop transitions, 3 changer transitions 1/247 dead transitions. [2024-11-27 23:19:27,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 247 transitions, 624 flow [2024-11-27 23:19:27,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:19:27,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:19:27,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 664 transitions. [2024-11-27 23:19:27,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9540229885057471 [2024-11-27 23:19:27,097 INFO L175 Difference]: Start difference. First operand has 236 places, 241 transitions, 570 flow. Second operand 3 states and 664 transitions. [2024-11-27 23:19:27,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 247 transitions, 624 flow [2024-11-27 23:19:27,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 247 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:19:27,111 INFO L231 Difference]: Finished difference. Result has 238 places, 243 transitions, 578 flow [2024-11-27 23:19:27,111 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=578, PETRI_PLACES=238, PETRI_TRANSITIONS=243} [2024-11-27 23:19:27,113 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 7 predicate places. [2024-11-27 23:19:27,113 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 243 transitions, 578 flow [2024-11-27 23:19:27,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 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) [2024-11-27 23:19:27,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:19:27,115 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 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, 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, 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, 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, 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, 1, 1, 1] [2024-11-27 23:19:27,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 23:19:27,115 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-27 23:19:27,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:19:27,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1752848521, now seen corresponding path program 1 times [2024-11-27 23:19:27,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:19:27,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009472585] [2024-11-27 23:19:27,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:19:27,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:19:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:19:27,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:19:27,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:19:27,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009472585] [2024-11-27 23:19:27,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009472585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:19:27,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:19:27,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:19:27,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622278812] [2024-11-27 23:19:27,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:19:27,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:19:27,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:19:27,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:19:27,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:19:27,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 232 [2024-11-27 23:19:27,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 243 transitions, 578 flow. Second operand has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 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) [2024-11-27 23:19:27,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:19:27,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 232 [2024-11-27 23:19:27,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:19:27,505 INFO L124 PetriNetUnfolderBase]: 92/747 cut-off events. [2024-11-27 23:19:27,505 INFO L125 PetriNetUnfolderBase]: For 73/77 co-relation queries the response was YES. [2024-11-27 23:19:27,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 747 events. 92/747 cut-off events. For 73/77 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3972 event pairs, 54 based on Foata normal form. 0/698 useless extension candidates. Maximal degree in co-relation 914. Up to 141 conditions per place. [2024-11-27 23:19:27,508 INFO L140 encePairwiseOnDemand]: 227/232 looper letters, 22 selfloop transitions, 5 changer transitions 0/252 dead transitions. [2024-11-27 23:19:27,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 252 transitions, 654 flow [2024-11-27 23:19:27,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:19:27,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:19:27,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 663 transitions. [2024-11-27 23:19:27,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9525862068965517 [2024-11-27 23:19:27,514 INFO L175 Difference]: Start difference. First operand has 238 places, 243 transitions, 578 flow. Second operand 3 states and 663 transitions. [2024-11-27 23:19:27,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 252 transitions, 654 flow [2024-11-27 23:19:27,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 252 transitions, 646 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:19:27,522 INFO L231 Difference]: Finished difference. Result has 240 places, 246 transitions, 608 flow [2024-11-27 23:19:27,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=608, PETRI_PLACES=240, PETRI_TRANSITIONS=246} [2024-11-27 23:19:27,523 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 9 predicate places. [2024-11-27 23:19:27,525 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 246 transitions, 608 flow [2024-11-27 23:19:27,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 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) [2024-11-27 23:19:27,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:19:27,526 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:19:27,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 23:19:27,526 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-27 23:19:27,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:19:27,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1043531951, now seen corresponding path program 1 times [2024-11-27 23:19:27,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:19:27,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550914457] [2024-11-27 23:19:27,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:19:27,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:19:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:19:27,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:19:27,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:19:27,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550914457] [2024-11-27 23:19:27,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550914457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:19:27,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:19:27,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:19:27,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027287084] [2024-11-27 23:19:27,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:19:27,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:19:27,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:19:27,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:19:27,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:19:27,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 232 [2024-11-27 23:19:27,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 246 transitions, 608 flow. Second operand has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 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) [2024-11-27 23:19:27,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:19:27,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 232 [2024-11-27 23:19:27,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:19:27,929 INFO L124 PetriNetUnfolderBase]: 159/927 cut-off events. [2024-11-27 23:19:27,929 INFO L125 PetriNetUnfolderBase]: For 211/217 co-relation queries the response was YES. [2024-11-27 23:19:27,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1610 conditions, 927 events. 159/927 cut-off events. For 211/217 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5171 event pairs, 73 based on Foata normal form. 0/881 useless extension candidates. Maximal degree in co-relation 1385. Up to 275 conditions per place. [2024-11-27 23:19:27,934 INFO L140 encePairwiseOnDemand]: 225/232 looper letters, 29 selfloop transitions, 11 changer transitions 4/259 dead transitions. [2024-11-27 23:19:27,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 259 transitions, 730 flow [2024-11-27 23:19:27,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:19:27,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:19:27,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 659 transitions. [2024-11-27 23:19:27,936 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9468390804597702 [2024-11-27 23:19:27,937 INFO L175 Difference]: Start difference. First operand has 240 places, 246 transitions, 608 flow. Second operand 3 states and 659 transitions. [2024-11-27 23:19:27,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 259 transitions, 730 flow [2024-11-27 23:19:27,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 259 transitions, 720 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:19:27,946 INFO L231 Difference]: Finished difference. Result has 242 places, 250 transitions, 674 flow [2024-11-27 23:19:27,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=674, PETRI_PLACES=242, PETRI_TRANSITIONS=250} [2024-11-27 23:19:27,947 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 11 predicate places. [2024-11-27 23:19:27,947 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 250 transitions, 674 flow [2024-11-27 23:19:27,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 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) [2024-11-27 23:19:27,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:19:27,948 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:19:27,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 23:19:27,948 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-27 23:19:27,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:19:27,951 INFO L85 PathProgramCache]: Analyzing trace with hash -444218418, now seen corresponding path program 1 times [2024-11-27 23:19:27,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:19:27,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144485399] [2024-11-27 23:19:27,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:19:27,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:19:27,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:19:28,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:19:28,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:19:28,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144485399] [2024-11-27 23:19:28,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144485399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:19:28,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:19:28,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 23:19:28,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448910401] [2024-11-27 23:19:28,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:19:28,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 23:19:28,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:19:28,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 23:19:28,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:19:28,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 232 [2024-11-27 23:19:28,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 250 transitions, 674 flow. Second operand has 5 states, 5 states have (on average 211.4) internal successors, (1057), 5 states have internal predecessors, (1057), 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) [2024-11-27 23:19:28,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:19:28,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 232 [2024-11-27 23:19:28,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:19:28,710 INFO L124 PetriNetUnfolderBase]: 142/853 cut-off events. [2024-11-27 23:19:28,710 INFO L125 PetriNetUnfolderBase]: For 276/280 co-relation queries the response was YES. [2024-11-27 23:19:28,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1536 conditions, 853 events. 142/853 cut-off events. For 276/280 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4477 event pairs, 39 based on Foata normal form. 2/811 useless extension candidates. Maximal degree in co-relation 1306. Up to 140 conditions per place. [2024-11-27 23:19:28,714 INFO L140 encePairwiseOnDemand]: 225/232 looper letters, 29 selfloop transitions, 7 changer transitions 3/265 dead transitions. [2024-11-27 23:19:28,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 265 transitions, 770 flow [2024-11-27 23:19:28,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 23:19:28,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-27 23:19:28,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1295 transitions. [2024-11-27 23:19:28,718 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.930316091954023 [2024-11-27 23:19:28,718 INFO L175 Difference]: Start difference. First operand has 242 places, 250 transitions, 674 flow. Second operand 6 states and 1295 transitions. [2024-11-27 23:19:28,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 265 transitions, 770 flow [2024-11-27 23:19:28,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 265 transitions, 734 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-11-27 23:19:28,726 INFO L231 Difference]: Finished difference. Result has 242 places, 251 transitions, 660 flow [2024-11-27 23:19:28,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=660, PETRI_PLACES=242, PETRI_TRANSITIONS=251} [2024-11-27 23:19:28,728 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 11 predicate places. [2024-11-27 23:19:28,728 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 251 transitions, 660 flow [2024-11-27 23:19:28,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 211.4) internal successors, (1057), 5 states have internal predecessors, (1057), 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) [2024-11-27 23:19:28,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:19:28,730 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:19:28,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 23:19:28,731 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-27 23:19:28,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:19:28,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1102976817, now seen corresponding path program 1 times [2024-11-27 23:19:28,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:19:28,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132014763] [2024-11-27 23:19:28,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:19:28,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:19:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 23:19:28,798 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 23:19:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 23:19:28,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 23:19:28,963 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 23:19:28,964 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-11-27 23:19:28,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-11-27 23:19:28,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-11-27 23:19:28,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-11-27 23:19:28,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-11-27 23:19:28,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2024-11-27 23:19:28,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-11-27 23:19:28,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-11-27 23:19:28,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-11-27 23:19:28,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-11-27 23:19:28,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-11-27 23:19:28,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 23:19:28,968 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:19:28,970 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 23:19:28,970 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-27 23:19:29,001 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-27 23:19:29,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 262 transitions, 534 flow [2024-11-27 23:19:29,069 INFO L124 PetriNetUnfolderBase]: 10/354 cut-off events. [2024-11-27 23:19:29,069 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-27 23:19:29,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 354 events. 10/354 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 408 event pairs, 0 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 275. Up to 6 conditions per place. [2024-11-27 23:19:29,071 INFO L82 GeneralOperation]: Start removeDead. Operand has 263 places, 262 transitions, 534 flow [2024-11-27 23:19:29,074 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 263 places, 262 transitions, 534 flow [2024-11-27 23:19:29,075 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 23:19:29,075 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@741b57da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 23:19:29,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-27 23:19:29,096 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-27 23:19:29,096 INFO L124 PetriNetUnfolderBase]: 2/162 cut-off events. [2024-11-27 23:19:29,096 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 23:19:29,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:19:29,096 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:19:29,097 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-27 23:19:29,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:19:29,097 INFO L85 PathProgramCache]: Analyzing trace with hash -544245902, now seen corresponding path program 1 times [2024-11-27 23:19:29,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:19:29,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438575315] [2024-11-27 23:19:29,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:19:29,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:19:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:19:29,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:19:29,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:19:29,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438575315] [2024-11-27 23:19:29,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438575315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:19:29,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:19:29,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:19:29,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168363890] [2024-11-27 23:19:29,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:19:29,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:19:29,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:19:29,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:19:29,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:19:29,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 262 [2024-11-27 23:19:29,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 262 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 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) [2024-11-27 23:19:29,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:19:29,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 262 [2024-11-27 23:19:29,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:19:30,939 INFO L124 PetriNetUnfolderBase]: 2216/6761 cut-off events. [2024-11-27 23:19:30,939 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-11-27 23:19:30,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10465 conditions, 6761 events. 2216/6761 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 63708 event pairs, 879 based on Foata normal form. 92/6148 useless extension candidates. Maximal degree in co-relation 8872. Up to 2089 conditions per place. [2024-11-27 23:19:30,990 INFO L140 encePairwiseOnDemand]: 244/262 looper letters, 46 selfloop transitions, 11 changer transitions 1/285 dead transitions. [2024-11-27 23:19:30,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 285 transitions, 699 flow [2024-11-27 23:19:30,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:19:30,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:19:30,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 750 transitions. [2024-11-27 23:19:30,993 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9541984732824428 [2024-11-27 23:19:30,993 INFO L175 Difference]: Start difference. First operand has 263 places, 262 transitions, 534 flow. Second operand 3 states and 750 transitions. [2024-11-27 23:19:30,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 285 transitions, 699 flow [2024-11-27 23:19:30,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 285 transitions, 699 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-27 23:19:31,000 INFO L231 Difference]: Finished difference. Result has 267 places, 269 transitions, 622 flow [2024-11-27 23:19:31,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=622, PETRI_PLACES=267, PETRI_TRANSITIONS=269} [2024-11-27 23:19:31,002 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 4 predicate places. [2024-11-27 23:19:31,002 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 269 transitions, 622 flow [2024-11-27 23:19:31,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 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) [2024-11-27 23:19:31,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:19:31,003 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:19:31,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 23:19:31,003 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-27 23:19:31,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:19:31,007 INFO L85 PathProgramCache]: Analyzing trace with hash 2088940406, now seen corresponding path program 1 times [2024-11-27 23:19:31,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:19:31,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289770513] [2024-11-27 23:19:31,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:19:31,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:19:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:19:31,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:19:31,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:19:31,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289770513] [2024-11-27 23:19:31,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289770513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:19:31,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:19:31,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:19:31,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746363026] [2024-11-27 23:19:31,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:19:31,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:19:31,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:19:31,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:19:31,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:19:31,195 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 262 [2024-11-27 23:19:31,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 269 transitions, 622 flow. Second operand has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 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) [2024-11-27 23:19:31,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:19:31,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 262 [2024-11-27 23:19:31,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:19:33,253 INFO L124 PetriNetUnfolderBase]: 2480/8562 cut-off events. [2024-11-27 23:19:33,253 INFO L125 PetriNetUnfolderBase]: For 2807/3012 co-relation queries the response was YES. [2024-11-27 23:19:33,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15328 conditions, 8562 events. 2480/8562 cut-off events. For 2807/3012 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 87694 event pairs, 1597 based on Foata normal form. 70/7873 useless extension candidates. Maximal degree in co-relation 13171. Up to 3442 conditions per place. [2024-11-27 23:19:33,318 INFO L140 encePairwiseOnDemand]: 254/262 looper letters, 42 selfloop transitions, 12 changer transitions 0/287 dead transitions. [2024-11-27 23:19:33,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 287 transitions, 790 flow [2024-11-27 23:19:33,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:19:33,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:19:33,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 734 transitions. [2024-11-27 23:19:33,320 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9338422391857506 [2024-11-27 23:19:33,320 INFO L175 Difference]: Start difference. First operand has 267 places, 269 transitions, 622 flow. Second operand 3 states and 734 transitions. [2024-11-27 23:19:33,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 287 transitions, 790 flow [2024-11-27 23:19:33,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 287 transitions, 760 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:19:33,335 INFO L231 Difference]: Finished difference. Result has 268 places, 279 transitions, 706 flow [2024-11-27 23:19:33,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=706, PETRI_PLACES=268, PETRI_TRANSITIONS=279} [2024-11-27 23:19:33,337 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 5 predicate places. [2024-11-27 23:19:33,337 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 279 transitions, 706 flow [2024-11-27 23:19:33,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 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) [2024-11-27 23:19:33,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:19:33,337 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:19:33,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 23:19:33,338 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-27 23:19:33,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:19:33,338 INFO L85 PathProgramCache]: Analyzing trace with hash 379250859, now seen corresponding path program 1 times [2024-11-27 23:19:33,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:19:33,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066841209] [2024-11-27 23:19:33,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:19:33,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:19:33,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:19:33,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:19:33,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:19:33,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066841209] [2024-11-27 23:19:33,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066841209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:19:33,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:19:33,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:19:33,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304044541] [2024-11-27 23:19:33,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:19:33,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:19:33,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:19:33,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:19:33,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:19:33,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 262 [2024-11-27 23:19:33,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 279 transitions, 706 flow. Second operand has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 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) [2024-11-27 23:19:33,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:19:33,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 262 [2024-11-27 23:19:33,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:19:35,014 INFO L124 PetriNetUnfolderBase]: 1878/7688 cut-off events. [2024-11-27 23:19:35,015 INFO L125 PetriNetUnfolderBase]: For 1101/1918 co-relation queries the response was YES. [2024-11-27 23:19:35,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12618 conditions, 7688 events. 1878/7688 cut-off events. For 1101/1918 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 82669 event pairs, 1092 based on Foata normal form. 7/6759 useless extension candidates. Maximal degree in co-relation 10919. Up to 1725 conditions per place. [2024-11-27 23:19:35,070 INFO L140 encePairwiseOnDemand]: 257/262 looper letters, 28 selfloop transitions, 4 changer transitions 0/290 dead transitions. [2024-11-27 23:19:35,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 290 transitions, 792 flow [2024-11-27 23:19:35,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:19:35,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:19:35,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 747 transitions. [2024-11-27 23:19:35,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950381679389313 [2024-11-27 23:19:35,073 INFO L175 Difference]: Start difference. First operand has 268 places, 279 transitions, 706 flow. Second operand 3 states and 747 transitions. [2024-11-27 23:19:35,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 290 transitions, 792 flow [2024-11-27 23:19:35,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 290 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:19:35,088 INFO L231 Difference]: Finished difference. Result has 270 places, 282 transitions, 712 flow [2024-11-27 23:19:35,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=712, PETRI_PLACES=270, PETRI_TRANSITIONS=282} [2024-11-27 23:19:35,090 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 7 predicate places. [2024-11-27 23:19:35,090 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 282 transitions, 712 flow [2024-11-27 23:19:35,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 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) [2024-11-27 23:19:35,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:19:35,091 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 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, 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, 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, 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, 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, 1, 1, 1] [2024-11-27 23:19:35,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 23:19:35,092 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-27 23:19:35,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:19:35,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1650268142, now seen corresponding path program 1 times [2024-11-27 23:19:35,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:19:35,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616429098] [2024-11-27 23:19:35,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:19:35,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:19:35,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:19:35,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:19:35,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:19:35,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616429098] [2024-11-27 23:19:35,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616429098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:19:35,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:19:35,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:19:35,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849949512] [2024-11-27 23:19:35,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:19:35,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:19:35,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:19:35,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:19:35,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:19:35,302 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 262 [2024-11-27 23:19:35,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 282 transitions, 712 flow. Second operand has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 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) [2024-11-27 23:19:35,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:19:35,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 262 [2024-11-27 23:19:35,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:19:37,688 INFO L124 PetriNetUnfolderBase]: 2430/9836 cut-off events. [2024-11-27 23:19:37,689 INFO L125 PetriNetUnfolderBase]: For 1611/2578 co-relation queries the response was YES. [2024-11-27 23:19:37,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16531 conditions, 9836 events. 2430/9836 cut-off events. For 1611/2578 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 112911 event pairs, 1418 based on Foata normal form. 11/8675 useless extension candidates. Maximal degree in co-relation 14739. Up to 2447 conditions per place. [2024-11-27 23:19:37,761 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 34 selfloop transitions, 7 changer transitions 0/298 dead transitions. [2024-11-27 23:19:37,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 298 transitions, 841 flow [2024-11-27 23:19:37,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:19:37,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:19:37,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 747 transitions. [2024-11-27 23:19:37,764 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950381679389313 [2024-11-27 23:19:37,765 INFO L175 Difference]: Start difference. First operand has 270 places, 282 transitions, 712 flow. Second operand 3 states and 747 transitions. [2024-11-27 23:19:37,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 298 transitions, 841 flow [2024-11-27 23:19:37,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 298 transitions, 829 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:19:37,780 INFO L231 Difference]: Finished difference. Result has 272 places, 287 transitions, 760 flow [2024-11-27 23:19:37,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=272, PETRI_TRANSITIONS=287} [2024-11-27 23:19:37,782 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 9 predicate places. [2024-11-27 23:19:37,782 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 287 transitions, 760 flow [2024-11-27 23:19:37,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 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) [2024-11-27 23:19:37,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:19:37,783 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:19:37,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-27 23:19:37,783 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-27 23:19:37,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:19:37,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1797753382, now seen corresponding path program 1 times [2024-11-27 23:19:37,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:19:37,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833833101] [2024-11-27 23:19:37,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:19:37,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:19:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:19:37,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:19:37,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:19:37,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833833101] [2024-11-27 23:19:37,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833833101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:19:37,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:19:37,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:19:37,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619270549] [2024-11-27 23:19:37,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:19:37,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:19:37,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:19:37,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:19:37,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:19:37,963 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 262 [2024-11-27 23:19:37,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 287 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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) [2024-11-27 23:19:37,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:19:37,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 262 [2024-11-27 23:19:37,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:19:39,816 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][267], [281#true, 201#L712-1true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 161#L695-6true, 262#true, Black: 278#(= |#race~data~0| 0), 286#true, 264#true, 222#L695-2true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2024-11-27 23:19:39,816 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2024-11-27 23:19:39,816 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-27 23:19:39,816 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-27 23:19:39,817 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-27 23:19:39,933 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [281#true, 201#L712-1true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 262#true, 39#L697true, Black: 278#(= |#race~data~0| 0), 286#true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 222#L695-2true, Black: 266#true]) [2024-11-27 23:19:39,933 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2024-11-27 23:19:39,933 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-27 23:19:39,933 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-27 23:19:39,933 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-27 23:19:39,985 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [281#true, 260#L697-3true, 201#L712-1true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 262#true, Black: 278#(= |#race~data~0| 0), 286#true, 222#L695-2true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2024-11-27 23:19:39,985 INFO L294 olderBase$Statistics]: this new event has 253 ancestors and is cut-off event [2024-11-27 23:19:39,985 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-27 23:19:39,985 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2024-11-27 23:19:39,985 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2024-11-27 23:19:40,381 INFO L124 PetriNetUnfolderBase]: 4089/13244 cut-off events. [2024-11-27 23:19:40,381 INFO L125 PetriNetUnfolderBase]: For 5569/5893 co-relation queries the response was YES. [2024-11-27 23:19:40,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25628 conditions, 13244 events. 4089/13244 cut-off events. For 5569/5893 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 146368 event pairs, 2075 based on Foata normal form. 79/11927 useless extension candidates. Maximal degree in co-relation 21564. Up to 5204 conditions per place. [2024-11-27 23:19:40,487 INFO L140 encePairwiseOnDemand]: 253/262 looper letters, 49 selfloop transitions, 19 changer transitions 0/313 dead transitions. [2024-11-27 23:19:40,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 313 transitions, 997 flow [2024-11-27 23:19:40,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:19:40,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:19:40,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 742 transitions. [2024-11-27 23:19:40,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9440203562340967 [2024-11-27 23:19:40,491 INFO L175 Difference]: Start difference. First operand has 272 places, 287 transitions, 760 flow. Second operand 3 states and 742 transitions. [2024-11-27 23:19:40,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 313 transitions, 997 flow [2024-11-27 23:19:40,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 313 transitions, 983 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:19:40,502 INFO L231 Difference]: Finished difference. Result has 274 places, 302 transitions, 928 flow [2024-11-27 23:19:40,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=928, PETRI_PLACES=274, PETRI_TRANSITIONS=302} [2024-11-27 23:19:40,503 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 11 predicate places. [2024-11-27 23:19:40,504 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 302 transitions, 928 flow [2024-11-27 23:19:40,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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) [2024-11-27 23:19:40,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:19:40,505 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:19:40,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-27 23:19:40,505 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-27 23:19:40,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:19:40,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1923959255, now seen corresponding path program 1 times [2024-11-27 23:19:40,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:19:40,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539893629] [2024-11-27 23:19:40,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:19:40,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:19:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:19:40,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:19:40,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:19:40,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539893629] [2024-11-27 23:19:40,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539893629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:19:40,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:19:40,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 23:19:40,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993680494] [2024-11-27 23:19:40,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:19:40,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 23:19:40,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:19:40,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 23:19:40,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:19:40,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 262 [2024-11-27 23:19:40,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 302 transitions, 928 flow. Second operand has 5 states, 5 states have (on average 235.4) internal successors, (1177), 5 states have internal predecessors, (1177), 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) [2024-11-27 23:19:40,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:19:40,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 262 [2024-11-27 23:19:40,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:19:42,682 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][274], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 201#L712-1true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 161#L695-6true, 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 286#true, 264#true, 222#L695-2true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2024-11-27 23:19:42,682 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2024-11-27 23:19:42,683 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-27 23:19:42,683 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-27 23:19:42,683 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-27 23:19:42,722 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L705-5-->L705-6: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_3| |v_#race~threads_alive~0_4|) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, #race~threads_alive~0=|v_#race~threads_alive~0_4|} AuxVars[] AssignedVars[#race~threads_alive~0][273], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 271#true, 161#L695-6true, 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 286#true, 62#L705-6true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 268#(= |#race~threads_alive~0| 0), 222#L695-2true, 264#true]) [2024-11-27 23:19:42,722 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2024-11-27 23:19:42,722 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-27 23:19:42,722 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-27 23:19:42,722 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-27 23:19:42,754 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([773] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][274], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 201#L712-1true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 161#L695-6true, 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 286#true, 264#true, 222#L695-2true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2024-11-27 23:19:42,754 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2024-11-27 23:19:42,754 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-27 23:19:42,754 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-27 23:19:42,754 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-27 23:19:42,754 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-27 23:19:42,762 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([773] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][274], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 201#L712-1true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 161#L695-6true, 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 286#true, 222#L695-2true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 264#true, Black: 266#true]) [2024-11-27 23:19:42,762 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2024-11-27 23:19:42,762 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-27 23:19:42,762 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-27 23:19:42,762 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-27 23:19:42,762 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-27 23:19:42,762 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-27 23:19:43,011 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][216], [201#L712-1true, Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 291#true, 262#true, 39#L697true, Black: 278#(= |#race~data~0| 0), 286#true, 264#true, 222#L695-2true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2024-11-27 23:19:43,011 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2024-11-27 23:19:43,011 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-27 23:19:43,011 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-27 23:19:43,011 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-27 23:19:43,021 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][274], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 201#L712-1true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 161#L695-6true, 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 286#true, 198#L695-1true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2024-11-27 23:19:43,021 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2024-11-27 23:19:43,021 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-27 23:19:43,021 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-27 23:19:43,021 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2024-11-27 23:19:43,134 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([773] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][216], [201#L712-1true, Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 39#L697true, 286#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 222#L695-2true, 264#true, Black: 266#true]) [2024-11-27 23:19:43,134 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2024-11-27 23:19:43,134 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-27 23:19:43,134 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-27 23:19:43,134 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-27 23:19:43,134 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-27 23:19:43,147 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][216], [201#L712-1true, Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 147#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 286#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 222#L695-2true, 264#true, Black: 266#true]) [2024-11-27 23:19:43,147 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2024-11-27 23:19:43,147 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-27 23:19:43,147 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-27 23:19:43,147 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-27 23:19:43,200 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][216], [260#L697-3true, 201#L712-1true, Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 286#true, 264#true, 222#L695-2true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2024-11-27 23:19:43,200 INFO L294 olderBase$Statistics]: this new event has 253 ancestors and is cut-off event [2024-11-27 23:19:43,200 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-27 23:19:43,200 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-27 23:19:43,200 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2024-11-27 23:19:43,214 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([836] L695-2-->L695-3: Formula: (= v_~threads_alive~0_7 (+ v_~threads_alive~0_6 2)) InVars {~threads_alive~0=v_~threads_alive~0_7} OutVars{~threads_alive~0=v_~threads_alive~0_6} AuxVars[] AssignedVars[~threads_alive~0][290], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 27#L695-3true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 286#true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 219#L695-3true, 237#L706-3true, Black: 266#true]) [2024-11-27 23:19:43,214 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2024-11-27 23:19:43,214 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-27 23:19:43,214 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-27 23:19:43,214 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-27 23:19:43,268 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([809] L695-4-->L695-5: Formula: (= |v_#race~threads_alive~0_13| |v_threadThread1of2ForFork0_#t~nondet5_3|) InVars {threadThread1of2ForFork0_#t~nondet5=|v_threadThread1of2ForFork0_#t~nondet5_3|} OutVars{threadThread1of2ForFork0_#t~nondet5=|v_threadThread1of2ForFork0_#t~nondet5_3|, #race~threads_alive~0=|v_#race~threads_alive~0_13|} AuxVars[] AssignedVars[#race~threads_alive~0][222], [Black: 286#true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 291#true, 262#true, 29#L695-5true, 233#L706true, Black: 278#(= |#race~data~0| 0), 222#L695-2true, Black: 268#(= |#race~threads_alive~0| 0), 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|)]) [2024-11-27 23:19:43,268 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is not cut-off event [2024-11-27 23:19:43,269 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is not cut-off event [2024-11-27 23:19:43,269 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is not cut-off event [2024-11-27 23:19:43,269 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is not cut-off event [2024-11-27 23:19:43,507 INFO L124 PetriNetUnfolderBase]: 4737/15801 cut-off events. [2024-11-27 23:19:43,508 INFO L125 PetriNetUnfolderBase]: For 6564/7144 co-relation queries the response was YES. [2024-11-27 23:19:43,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31067 conditions, 15801 events. 4737/15801 cut-off events. For 6564/7144 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 184866 event pairs, 1712 based on Foata normal form. 71/14047 useless extension candidates. Maximal degree in co-relation 16596. Up to 4209 conditions per place. [2024-11-27 23:19:43,591 INFO L140 encePairwiseOnDemand]: 254/262 looper letters, 45 selfloop transitions, 9 changer transitions 2/332 dead transitions. [2024-11-27 23:19:43,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 332 transitions, 1100 flow [2024-11-27 23:19:43,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 23:19:43,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-27 23:19:43,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1456 transitions. [2024-11-27 23:19:43,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.926208651399491 [2024-11-27 23:19:43,721 INFO L175 Difference]: Start difference. First operand has 274 places, 302 transitions, 928 flow. Second operand 6 states and 1456 transitions. [2024-11-27 23:19:43,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 332 transitions, 1100 flow [2024-11-27 23:19:43,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 332 transitions, 1062 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:19:43,760 INFO L231 Difference]: Finished difference. Result has 279 places, 309 transitions, 941 flow [2024-11-27 23:19:43,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=941, PETRI_PLACES=279, PETRI_TRANSITIONS=309} [2024-11-27 23:19:43,762 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 16 predicate places. [2024-11-27 23:19:43,762 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 309 transitions, 941 flow [2024-11-27 23:19:43,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 235.4) internal successors, (1177), 5 states have internal predecessors, (1177), 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) [2024-11-27 23:19:43,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:19:43,763 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:19:43,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-27 23:19:43,764 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-27 23:19:43,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:19:43,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1244387752, now seen corresponding path program 1 times [2024-11-27 23:19:43,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:19:43,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553696569] [2024-11-27 23:19:43,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:19:43,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:19:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:19:44,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:19:44,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:19:44,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553696569] [2024-11-27 23:19:44,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553696569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:19:44,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:19:44,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 23:19:44,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515307975] [2024-11-27 23:19:44,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:19:44,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 23:19:44,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:19:44,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 23:19:44,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 23:19:44,394 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 262 [2024-11-27 23:19:44,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 309 transitions, 941 flow. Second operand has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 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) [2024-11-27 23:19:44,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:19:44,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 262 [2024-11-27 23:19:44,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:19:44,943 INFO L124 PetriNetUnfolderBase]: 321/2651 cut-off events. [2024-11-27 23:19:44,943 INFO L125 PetriNetUnfolderBase]: For 665/701 co-relation queries the response was YES. [2024-11-27 23:19:44,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4680 conditions, 2651 events. 321/2651 cut-off events. For 665/701 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 22676 event pairs, 119 based on Foata normal form. 86/2586 useless extension candidates. Maximal degree in co-relation 4104. Up to 283 conditions per place. [2024-11-27 23:19:44,958 INFO L140 encePairwiseOnDemand]: 250/262 looper letters, 11 selfloop transitions, 12 changer transitions 0/275 dead transitions. [2024-11-27 23:19:44,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 275 transitions, 762 flow [2024-11-27 23:19:44,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 23:19:44,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-27 23:19:44,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1233 transitions. [2024-11-27 23:19:44,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9412213740458015 [2024-11-27 23:19:44,961 INFO L175 Difference]: Start difference. First operand has 279 places, 309 transitions, 941 flow. Second operand 5 states and 1233 transitions. [2024-11-27 23:19:44,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 275 transitions, 762 flow [2024-11-27 23:19:44,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 275 transitions, 716 flow, removed 19 selfloop flow, removed 4 redundant places. [2024-11-27 23:19:44,973 INFO L231 Difference]: Finished difference. Result has 273 places, 270 transitions, 679 flow [2024-11-27 23:19:44,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=679, PETRI_PLACES=273, PETRI_TRANSITIONS=270} [2024-11-27 23:19:44,974 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 10 predicate places. [2024-11-27 23:19:44,974 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 270 transitions, 679 flow [2024-11-27 23:19:44,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 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) [2024-11-27 23:19:44,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:19:44,976 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:19:44,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-27 23:19:44,976 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-27 23:19:44,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:19:44,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1163982306, now seen corresponding path program 1 times [2024-11-27 23:19:44,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:19:44,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349311867] [2024-11-27 23:19:44,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:19:44,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:19:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:19:45,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:19:45,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:19:45,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349311867] [2024-11-27 23:19:45,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349311867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:19:45,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:19:45,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:19:45,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013007760] [2024-11-27 23:19:45,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:19:45,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:19:45,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:19:45,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:19:45,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:19:45,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 262 [2024-11-27 23:19:45,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 270 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 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) [2024-11-27 23:19:45,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:19:45,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 262 [2024-11-27 23:19:45,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:19:45,914 INFO L124 PetriNetUnfolderBase]: 1083/4561 cut-off events. [2024-11-27 23:19:45,914 INFO L125 PetriNetUnfolderBase]: For 1581/1593 co-relation queries the response was YES. [2024-11-27 23:19:45,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8766 conditions, 4561 events. 1083/4561 cut-off events. For 1581/1593 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 44096 event pairs, 573 based on Foata normal form. 0/4268 useless extension candidates. Maximal degree in co-relation 8187. Up to 1492 conditions per place. [2024-11-27 23:19:45,937 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 34 selfloop transitions, 10 changer transitions 0/286 dead transitions. [2024-11-27 23:19:45,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 286 transitions, 831 flow [2024-11-27 23:19:45,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:19:45,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:19:45,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2024-11-27 23:19:45,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9491094147582697 [2024-11-27 23:19:45,940 INFO L175 Difference]: Start difference. First operand has 273 places, 270 transitions, 679 flow. Second operand 3 states and 746 transitions. [2024-11-27 23:19:45,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 286 transitions, 831 flow [2024-11-27 23:19:45,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 286 transitions, 810 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-27 23:19:45,949 INFO L231 Difference]: Finished difference. Result has 274 places, 276 transitions, 748 flow [2024-11-27 23:19:45,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=748, PETRI_PLACES=274, PETRI_TRANSITIONS=276} [2024-11-27 23:19:45,950 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 11 predicate places. [2024-11-27 23:19:45,950 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 276 transitions, 748 flow [2024-11-27 23:19:45,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 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) [2024-11-27 23:19:45,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:19:45,952 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 1, 1] [2024-11-27 23:19:45,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-27 23:19:45,952 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-27 23:19:45,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:19:45,953 INFO L85 PathProgramCache]: Analyzing trace with hash -52294139, now seen corresponding path program 1 times [2024-11-27 23:19:45,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:19:45,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672801969] [2024-11-27 23:19:45,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:19:45,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:19:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:19:46,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:19:46,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:19:46,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672801969] [2024-11-27 23:19:46,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672801969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:19:46,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:19:46,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 23:19:46,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840827790] [2024-11-27 23:19:46,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:19:46,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:19:46,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:19:46,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:19:46,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:19:46,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 262 [2024-11-27 23:19:46,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 276 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 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) [2024-11-27 23:19:46,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:19:46,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 262 [2024-11-27 23:19:46,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:19:47,464 INFO L124 PetriNetUnfolderBase]: 646/4598 cut-off events. [2024-11-27 23:19:47,464 INFO L125 PetriNetUnfolderBase]: For 1821/1992 co-relation queries the response was YES. [2024-11-27 23:19:47,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8372 conditions, 4598 events. 646/4598 cut-off events. For 1821/1992 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 48724 event pairs, 112 based on Foata normal form. 15/4399 useless extension candidates. Maximal degree in co-relation 7189. Up to 698 conditions per place. [2024-11-27 23:19:47,501 INFO L140 encePairwiseOnDemand]: 253/262 looper letters, 21 selfloop transitions, 9 changer transitions 0/289 dead transitions. [2024-11-27 23:19:47,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 289 transitions, 849 flow [2024-11-27 23:19:47,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:19:47,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:19:47,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 758 transitions. [2024-11-27 23:19:47,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9643765903307888 [2024-11-27 23:19:47,505 INFO L175 Difference]: Start difference. First operand has 274 places, 276 transitions, 748 flow. Second operand 3 states and 758 transitions. [2024-11-27 23:19:47,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 289 transitions, 849 flow [2024-11-27 23:19:47,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 289 transitions, 829 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:19:47,520 INFO L231 Difference]: Finished difference. Result has 275 places, 283 transitions, 788 flow [2024-11-27 23:19:47,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=788, PETRI_PLACES=275, PETRI_TRANSITIONS=283} [2024-11-27 23:19:47,521 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 12 predicate places. [2024-11-27 23:19:47,522 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 283 transitions, 788 flow [2024-11-27 23:19:47,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 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) [2024-11-27 23:19:47,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:19:47,523 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 1, 1] [2024-11-27 23:19:47,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-27 23:19:47,523 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-27 23:19:47,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:19:47,524 INFO L85 PathProgramCache]: Analyzing trace with hash -507865659, now seen corresponding path program 2 times [2024-11-27 23:19:47,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:19:47,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447422646] [2024-11-27 23:19:47,525 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:19:47,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:19:47,585 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 23:19:47,585 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:19:48,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:19:48,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:19:48,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447422646] [2024-11-27 23:19:48,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447422646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:19:48,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:19:48,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 23:19:48,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882575598] [2024-11-27 23:19:48,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:19:48,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 23:19:48,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:19:48,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 23:19:48,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 23:19:48,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 262 [2024-11-27 23:19:48,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 283 transitions, 788 flow. Second operand has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 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) [2024-11-27 23:19:48,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:19:48,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 262 [2024-11-27 23:19:48,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:19:48,836 INFO L124 PetriNetUnfolderBase]: 306/2803 cut-off events. [2024-11-27 23:19:48,837 INFO L125 PetriNetUnfolderBase]: For 1000/1210 co-relation queries the response was YES. [2024-11-27 23:19:48,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5139 conditions, 2803 events. 306/2803 cut-off events. For 1000/1210 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 25146 event pairs, 75 based on Foata normal form. 65/2768 useless extension candidates. Maximal degree in co-relation 4473. Up to 328 conditions per place. [2024-11-27 23:19:48,853 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 28 selfloop transitions, 8 changer transitions 0/289 dead transitions. [2024-11-27 23:19:48,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 289 transitions, 867 flow [2024-11-27 23:19:48,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 23:19:48,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-27 23:19:48,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1236 transitions. [2024-11-27 23:19:48,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9435114503816794 [2024-11-27 23:19:48,858 INFO L175 Difference]: Start difference. First operand has 275 places, 283 transitions, 788 flow. Second operand 5 states and 1236 transitions. [2024-11-27 23:19:48,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 289 transitions, 867 flow [2024-11-27 23:19:48,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 289 transitions, 854 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-27 23:19:48,868 INFO L231 Difference]: Finished difference. Result has 278 places, 278 transitions, 751 flow [2024-11-27 23:19:48,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=751, PETRI_PLACES=278, PETRI_TRANSITIONS=278} [2024-11-27 23:19:48,869 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 15 predicate places. [2024-11-27 23:19:48,869 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 278 transitions, 751 flow [2024-11-27 23:19:48,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 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) [2024-11-27 23:19:48,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:19:48,870 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1] [2024-11-27 23:19:48,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-27 23:19:48,871 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-27 23:19:48,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:19:48,872 INFO L85 PathProgramCache]: Analyzing trace with hash -676731994, now seen corresponding path program 1 times [2024-11-27 23:19:48,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:19:48,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744021] [2024-11-27 23:19:48,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:19:48,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:19:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:19:48,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:19:48,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:19:48,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744021] [2024-11-27 23:19:48,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:19:48,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:19:48,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:19:48,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498385195] [2024-11-27 23:19:48,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:19:48,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:19:48,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:19:48,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:19:48,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:19:49,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 262 [2024-11-27 23:19:49,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 278 transitions, 751 flow. Second operand has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 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) [2024-11-27 23:19:49,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:19:49,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 262 [2024-11-27 23:19:49,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:19:49,739 INFO L124 PetriNetUnfolderBase]: 503/3564 cut-off events. [2024-11-27 23:19:49,739 INFO L125 PetriNetUnfolderBase]: For 2170/2436 co-relation queries the response was YES. [2024-11-27 23:19:49,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7138 conditions, 3564 events. 503/3564 cut-off events. For 2170/2436 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 34386 event pairs, 226 based on Foata normal form. 6/3415 useless extension candidates. Maximal degree in co-relation 6345. Up to 891 conditions per place. [2024-11-27 23:19:49,752 INFO L140 encePairwiseOnDemand]: 259/262 looper letters, 37 selfloop transitions, 2 changer transitions 0/280 dead transitions. [2024-11-27 23:19:49,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 280 transitions, 845 flow [2024-11-27 23:19:49,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:19:49,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:19:49,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 725 transitions. [2024-11-27 23:19:49,755 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9223918575063613 [2024-11-27 23:19:49,755 INFO L175 Difference]: Start difference. First operand has 278 places, 278 transitions, 751 flow. Second operand 3 states and 725 transitions. [2024-11-27 23:19:49,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 280 transitions, 845 flow [2024-11-27 23:19:49,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 280 transitions, 833 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-27 23:19:49,765 INFO L231 Difference]: Finished difference. Result has 276 places, 277 transitions, 744 flow [2024-11-27 23:19:49,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=276, PETRI_TRANSITIONS=277} [2024-11-27 23:19:49,765 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 13 predicate places. [2024-11-27 23:19:49,766 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 277 transitions, 744 flow [2024-11-27 23:19:49,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 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) [2024-11-27 23:19:49,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:19:49,767 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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] [2024-11-27 23:19:49,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-27 23:19:49,767 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-27 23:19:49,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:19:49,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1845436025, now seen corresponding path program 1 times [2024-11-27 23:19:49,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:19:49,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358342739] [2024-11-27 23:19:49,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:19:49,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:19:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:19:50,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:19:50,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:19:50,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358342739] [2024-11-27 23:19:50,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358342739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:19:50,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:19:50,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-27 23:19:50,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938194505] [2024-11-27 23:19:50,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:19:50,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 23:19:50,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:19:50,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 23:19:50,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-27 23:19:50,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 262 [2024-11-27 23:19:50,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 277 transitions, 744 flow. Second operand has 7 states, 7 states have (on average 235.57142857142858) internal successors, (1649), 7 states have internal predecessors, (1649), 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) [2024-11-27 23:19:50,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:19:50,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 262 [2024-11-27 23:19:50,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:19:50,804 INFO L124 PetriNetUnfolderBase]: 323/2280 cut-off events. [2024-11-27 23:19:50,804 INFO L125 PetriNetUnfolderBase]: For 1006/1071 co-relation queries the response was YES. [2024-11-27 23:19:50,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4455 conditions, 2280 events. 323/2280 cut-off events. For 1006/1071 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 17631 event pairs, 78 based on Foata normal form. 22/2223 useless extension candidates. Maximal degree in co-relation 3225. Up to 288 conditions per place. [2024-11-27 23:19:50,812 INFO L140 encePairwiseOnDemand]: 255/262 looper letters, 70 selfloop transitions, 14 changer transitions 12/329 dead transitions. [2024-11-27 23:19:50,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 329 transitions, 1153 flow [2024-11-27 23:19:50,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 23:19:50,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-27 23:19:50,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2174 transitions. [2024-11-27 23:19:50,817 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9219677692960135 [2024-11-27 23:19:50,817 INFO L175 Difference]: Start difference. First operand has 276 places, 277 transitions, 744 flow. Second operand 9 states and 2174 transitions. [2024-11-27 23:19:50,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 329 transitions, 1153 flow [2024-11-27 23:19:50,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 329 transitions, 1149 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:19:50,827 INFO L231 Difference]: Finished difference. Result has 284 places, 278 transitions, 787 flow [2024-11-27 23:19:50,827 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=787, PETRI_PLACES=284, PETRI_TRANSITIONS=278} [2024-11-27 23:19:50,828 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 21 predicate places. [2024-11-27 23:19:50,828 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 278 transitions, 787 flow [2024-11-27 23:19:50,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 235.57142857142858) internal successors, (1649), 7 states have internal predecessors, (1649), 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) [2024-11-27 23:19:50,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:19:50,829 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:19:50,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-27 23:19:50,829 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-27 23:19:50,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:19:50,830 INFO L85 PathProgramCache]: Analyzing trace with hash 288342436, now seen corresponding path program 1 times [2024-11-27 23:19:50,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:19:50,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126408591] [2024-11-27 23:19:50,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:19:50,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:19:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 23:19:50,883 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 23:19:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 23:19:50,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 23:19:50,984 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 23:19:50,984 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2024-11-27 23:19:50,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2024-11-27 23:19:50,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2024-11-27 23:19:50,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2024-11-27 23:19:50,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2024-11-27 23:19:50,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2024-11-27 23:19:50,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2024-11-27 23:19:50,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2024-11-27 23:19:50,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2024-11-27 23:19:50,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2024-11-27 23:19:50,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2024-11-27 23:19:50,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2024-11-27 23:19:50,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2024-11-27 23:19:50,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2024-11-27 23:19:50,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-27 23:19:50,986 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:19:50,987 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 23:19:50,987 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-27 23:19:51,020 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-27 23:19:51,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 295 places, 292 transitions, 602 flow [2024-11-27 23:19:51,099 INFO L124 PetriNetUnfolderBase]: 13/434 cut-off events. [2024-11-27 23:19:51,099 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-27 23:19:51,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 434 events. 13/434 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 581 event pairs, 0 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 358. Up to 8 conditions per place. [2024-11-27 23:19:51,100 INFO L82 GeneralOperation]: Start removeDead. Operand has 295 places, 292 transitions, 602 flow [2024-11-27 23:19:51,103 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 295 places, 292 transitions, 602 flow [2024-11-27 23:19:51,104 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 23:19:51,104 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@741b57da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 23:19:51,105 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2024-11-27 23:19:51,120 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-27 23:19:51,120 INFO L124 PetriNetUnfolderBase]: 2/162 cut-off events. [2024-11-27 23:19:51,120 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 23:19:51,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:19:51,121 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:19:51,121 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-11-27 23:19:51,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:19:51,122 INFO L85 PathProgramCache]: Analyzing trace with hash 293253618, now seen corresponding path program 1 times [2024-11-27 23:19:51,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:19:51,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468198357] [2024-11-27 23:19:51,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:19:51,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:19:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:19:51,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:19:51,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:19:51,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468198357] [2024-11-27 23:19:51,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468198357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:19:51,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:19:51,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:19:51,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929090238] [2024-11-27 23:19:51,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:19:51,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:19:51,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:19:51,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:19:51,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:19:51,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 292 [2024-11-27 23:19:51,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 292 transitions, 602 flow. Second operand has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 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) [2024-11-27 23:19:51,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:19:51,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 292 [2024-11-27 23:19:51,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:20:03,493 INFO L124 PetriNetUnfolderBase]: 35239/79075 cut-off events. [2024-11-27 23:20:03,493 INFO L125 PetriNetUnfolderBase]: For 973/973 co-relation queries the response was YES. [2024-11-27 23:20:03,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129887 conditions, 79075 events. 35239/79075 cut-off events. For 973/973 co-relation queries the response was YES. Maximal size of possible extension queue 2945. Compared 957466 event pairs, 14941 based on Foata normal form. 986/71986 useless extension candidates. Maximal degree in co-relation 109153. Up to 27933 conditions per place. [2024-11-27 23:20:03,889 INFO L140 encePairwiseOnDemand]: 270/292 looper letters, 60 selfloop transitions, 14 changer transitions 1/323 dead transitions. [2024-11-27 23:20:03,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 323 transitions, 824 flow [2024-11-27 23:20:03,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:20:03,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:20:03,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 831 transitions. [2024-11-27 23:20:03,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9486301369863014 [2024-11-27 23:20:03,891 INFO L175 Difference]: Start difference. First operand has 295 places, 292 transitions, 602 flow. Second operand 3 states and 831 transitions. [2024-11-27 23:20:03,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 323 transitions, 824 flow [2024-11-27 23:20:03,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 323 transitions, 820 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-11-27 23:20:03,900 INFO L231 Difference]: Finished difference. Result has 299 places, 302 transitions, 714 flow [2024-11-27 23:20:03,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=714, PETRI_PLACES=299, PETRI_TRANSITIONS=302} [2024-11-27 23:20:03,901 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, 4 predicate places. [2024-11-27 23:20:03,902 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 302 transitions, 714 flow [2024-11-27 23:20:03,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 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) [2024-11-27 23:20:03,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:20:03,902 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:20:03,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-27 23:20:03,903 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-11-27 23:20:03,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:20:03,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1449918182, now seen corresponding path program 1 times [2024-11-27 23:20:03,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:20:03,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998504164] [2024-11-27 23:20:03,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:20:03,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:20:03,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:20:03,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:20:03,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:20:03,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998504164] [2024-11-27 23:20:03,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998504164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:20:03,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:20:03,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:20:03,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43580858] [2024-11-27 23:20:03,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:20:03,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:20:03,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:20:03,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:20:03,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:20:04,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 292 [2024-11-27 23:20:04,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 302 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 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) [2024-11-27 23:20:04,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:20:04,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 292 [2024-11-27 23:20:04,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:20:09,515 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1065] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [34#L691-3true, 220#L712-1true, 292#true, 303#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 239#L695-2true, 222#L695-2true, Black: 298#true]) [2024-11-27 23:20:09,515 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2024-11-27 23:20:09,515 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-27 23:20:09,515 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-27 23:20:09,515 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-27 23:20:09,515 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1065] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [136#L695-1true, 34#L691-3true, 220#L712-1true, 292#true, 303#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 222#L695-2true, Black: 298#true]) [2024-11-27 23:20:09,515 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2024-11-27 23:20:09,515 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-27 23:20:09,515 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-27 23:20:09,516 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-27 23:20:09,516 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1065] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [34#L691-3true, 220#L712-1true, 292#true, 303#true, 294#true, 80#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, 239#L695-2true, Black: 298#true]) [2024-11-27 23:20:09,516 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2024-11-27 23:20:09,516 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-27 23:20:09,516 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-27 23:20:09,516 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-27 23:20:09,781 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1065] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [34#L691-3true, 220#L712-1true, 303#true, 292#true, 294#true, 80#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, 239#L695-2true, Black: 298#true]) [2024-11-27 23:20:09,781 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2024-11-27 23:20:09,781 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2024-11-27 23:20:09,781 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-27 23:20:09,781 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-27 23:20:09,781 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-27 23:20:09,783 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1065] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [136#L695-1true, 34#L691-3true, 220#L712-1true, 303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true, 222#L695-2true]) [2024-11-27 23:20:09,783 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2024-11-27 23:20:09,783 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-27 23:20:09,783 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2024-11-27 23:20:09,783 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-27 23:20:09,783 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-27 23:20:10,081 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1065] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [34#L691-3true, 220#L712-1true, 292#true, 303#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 239#L695-2true, 222#L695-2true, Black: 298#true]) [2024-11-27 23:20:10,081 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2024-11-27 23:20:10,081 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2024-11-27 23:20:10,081 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-27 23:20:10,081 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-27 23:20:10,081 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-27 23:20:10,082 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1065] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [34#L691-3true, 220#L712-1true, 303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 218#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 239#L695-2true, Black: 298#true]) [2024-11-27 23:20:10,082 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2024-11-27 23:20:10,082 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-27 23:20:10,082 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2024-11-27 23:20:10,082 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-27 23:20:11,214 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1065] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [34#L691-3true, 220#L712-1true, 292#true, 303#true, 104#L695-5true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 218#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 298#true]) [2024-11-27 23:20:11,214 INFO L294 olderBase$Statistics]: this new event has 279 ancestors and is cut-off event [2024-11-27 23:20:11,214 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2024-11-27 23:20:11,214 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2024-11-27 23:20:11,214 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2024-11-27 23:20:11,216 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1065] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [34#L691-3true, 220#L712-1true, 147#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 292#true, 303#true, 294#true, 300#(= |#race~threads_alive~0| 0), 45#L695-5true, 296#true, Black: 298#true]) [2024-11-27 23:20:11,216 INFO L294 olderBase$Statistics]: this new event has 279 ancestors and is cut-off event [2024-11-27 23:20:11,216 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2024-11-27 23:20:11,216 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2024-11-27 23:20:11,216 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2024-11-27 23:20:12,525 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1065] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [34#L691-3true, 220#L712-1true, 292#true, 303#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 218#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 246#L697-3true, Black: 298#true]) [2024-11-27 23:20:12,525 INFO L294 olderBase$Statistics]: this new event has 282 ancestors and is cut-off event [2024-11-27 23:20:12,525 INFO L297 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2024-11-27 23:20:12,525 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-27 23:20:12,525 INFO L297 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2024-11-27 23:20:12,529 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1065] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][157], [34#L691-3true, 220#L712-1true, 147#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true, 125#L697-3true]) [2024-11-27 23:20:12,529 INFO L294 olderBase$Statistics]: this new event has 282 ancestors and is cut-off event [2024-11-27 23:20:12,529 INFO L297 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2024-11-27 23:20:12,529 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-27 23:20:12,529 INFO L297 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event