./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e9e153-2e7b-4722-929e-13086e80d5ec/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e9e153-2e7b-4722-929e-13086e80d5ec/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e9e153-2e7b-4722-929e-13086e80d5ec/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e9e153-2e7b-4722-929e-13086e80d5ec/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e9e153-2e7b-4722-929e-13086e80d5ec/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e9e153-2e7b-4722-929e-13086e80d5ec/bin/uautomizer-verify-qhAvR1uOyd --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 d2c89f010e0f73e8ba7e81bb150b82b70d39c0827c0d616dd2c3347839d51e01 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:33:44,168 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:33:44,265 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e9e153-2e7b-4722-929e-13086e80d5ec/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-13 14:33:44,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:33:44,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:33:44,310 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:33:44,311 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:33:44,311 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:33:44,311 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:33:44,311 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:33:44,312 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:33:44,312 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:33:44,312 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:33:44,312 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:33:44,312 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:33:44,314 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:33:44,314 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:33:44,314 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:33:44,314 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:33:44,314 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:33:44,314 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:33:44,314 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:33:44,315 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-13 14:33:44,315 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:33:44,315 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 14:33:44,315 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:33:44,315 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:33:44,315 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:33:44,315 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:33:44,315 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:33:44,315 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:33:44,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:33:44,316 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:33:44,316 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:33:44,316 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:33:44,316 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:33:44,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:33:44,316 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:33:44,316 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:33:44,316 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:33:44,316 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:33:44,316 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_c9e9e153-2e7b-4722-929e-13086e80d5ec/bin/uautomizer-verify-qhAvR1uOyd 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 -> d2c89f010e0f73e8ba7e81bb150b82b70d39c0827c0d616dd2c3347839d51e01 [2024-11-13 14:33:44,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:33:44,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:33:44,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:33:44,667 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:33:44,667 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:33:44,668 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e9e153-2e7b-4722-929e-13086e80d5ec/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c Unable to find full path for "g++" [2024-11-13 14:33:46,690 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:33:46,968 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:33:46,969 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e9e153-2e7b-4722-929e-13086e80d5ec/sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c [2024-11-13 14:33:46,977 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e9e153-2e7b-4722-929e-13086e80d5ec/bin/uautomizer-verify-qhAvR1uOyd/data/d55d1cc99/0ee3f827ea604bce8c1238b4730a177a/FLAG4bc5c4898 [2024-11-13 14:33:47,283 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e9e153-2e7b-4722-929e-13086e80d5ec/bin/uautomizer-verify-qhAvR1uOyd/data/d55d1cc99/0ee3f827ea604bce8c1238b4730a177a [2024-11-13 14:33:47,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:33:47,287 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:33:47,289 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:33:47,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:33:47,293 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:33:47,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:33:47" (1/1) ... [2024-11-13 14:33:47,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f45b44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:47, skipping insertion in model container [2024-11-13 14:33:47,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:33:47" (1/1) ... [2024-11-13 14:33:47,314 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:33:47,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:33:47,548 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:33:47,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:33:47,600 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:33:47,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:47 WrapperNode [2024-11-13 14:33:47,601 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:33:47,602 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:33:47,602 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:33:47,603 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:33:47,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:47" (1/1) ... [2024-11-13 14:33:47,619 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:47" (1/1) ... [2024-11-13 14:33:47,670 INFO L138 Inliner]: procedures = 24, calls = 41, calls flagged for inlining = 17, calls inlined = 19, statements flattened = 455 [2024-11-13 14:33:47,675 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:33:47,675 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:33:47,679 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:33:47,680 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:33:47,690 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:47" (1/1) ... [2024-11-13 14:33:47,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:47" (1/1) ... [2024-11-13 14:33:47,702 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:47" (1/1) ... [2024-11-13 14:33:47,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:47" (1/1) ... [2024-11-13 14:33:47,724 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:47" (1/1) ... [2024-11-13 14:33:47,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:47" (1/1) ... [2024-11-13 14:33:47,739 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:47" (1/1) ... [2024-11-13 14:33:47,744 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:47" (1/1) ... [2024-11-13 14:33:47,749 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:33:47,751 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:33:47,752 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:33:47,752 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:33:47,753 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:47" (1/1) ... [2024-11-13 14:33:47,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:33:47,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e9e153-2e7b-4722-929e-13086e80d5ec/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:33:47,795 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e9e153-2e7b-4722-929e-13086e80d5ec/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:33:47,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e9e153-2e7b-4722-929e-13086e80d5ec/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:33:47,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:33:47,832 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-13 14:33:47,832 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-13 14:33:47,832 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-13 14:33:47,832 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-13 14:33:47,833 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-13 14:33:47,833 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-13 14:33:47,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 14:33:47,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 14:33:47,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-13 14:33:47,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-13 14:33:47,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 14:33:47,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:33:47,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:33:47,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 14:33:47,835 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 14:33:47,954 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:33:47,956 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:33:48,846 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 14:33:48,846 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:33:49,407 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:33:49,409 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-13 14:33:49,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:33:49 BoogieIcfgContainer [2024-11-13 14:33:49,410 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:33:49,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:33:49,414 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:33:49,419 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:33:49,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:33:47" (1/3) ... [2024-11-13 14:33:49,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef9f05b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:33:49, skipping insertion in model container [2024-11-13 14:33:49,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:47" (2/3) ... [2024-11-13 14:33:49,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef9f05b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:33:49, skipping insertion in model container [2024-11-13 14:33:49,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:33:49" (3/3) ... [2024-11-13 14:33:49,423 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-3.wvr.c [2024-11-13 14:33:49,445 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:33:49,447 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-queue-add-3.wvr.c that has 4 procedures, 338 locations, 1 initial locations, 5 loop locations, and 67 error locations. [2024-11-13 14:33:49,448 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 14:33:49,596 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-13 14:33:49,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 347 places, 355 transitions, 731 flow [2024-11-13 14:33:49,870 INFO L124 PetriNetUnfolderBase]: 18/352 cut-off events. [2024-11-13 14:33:49,873 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-13 14:33:49,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 352 events. 18/352 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 526 event pairs, 0 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 299. Up to 3 conditions per place. [2024-11-13 14:33:49,891 INFO L82 GeneralOperation]: Start removeDead. Operand has 347 places, 355 transitions, 731 flow [2024-11-13 14:33:49,905 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 328 places, 335 transitions, 688 flow [2024-11-13 14:33:49,919 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:33:49,938 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;@6926c503, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:33:49,939 INFO L334 AbstractCegarLoop]: Starting to check reachability of 119 error locations. [2024-11-13 14:33:49,950 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 14:33:49,950 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2024-11-13 14:33:49,950 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 14:33:49,951 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:49,952 INFO L204 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] [2024-11-13 14:33:49,953 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-13 14:33:49,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:49,959 INFO L85 PathProgramCache]: Analyzing trace with hash -599997001, now seen corresponding path program 1 times [2024-11-13 14:33:49,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:49,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907056644] [2024-11-13 14:33:49,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:49,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:50,181 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-13 14:33:50,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:50,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907056644] [2024-11-13 14:33:50,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907056644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:50,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:50,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:50,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892315616] [2024-11-13 14:33:50,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:50,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:50,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:50,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:50,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:50,293 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 355 [2024-11-13 14:33:50,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 335 transitions, 688 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-13 14:33:50,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:50,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 355 [2024-11-13 14:33:50,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:50,628 INFO L124 PetriNetUnfolderBase]: 78/610 cut-off events. [2024-11-13 14:33:50,629 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2024-11-13 14:33:50,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 787 conditions, 610 events. 78/610 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2350 event pairs, 51 based on Foata normal form. 50/573 useless extension candidates. Maximal degree in co-relation 513. Up to 128 conditions per place. [2024-11-13 14:33:50,635 INFO L140 encePairwiseOnDemand]: 296/355 looper letters, 17 selfloop transitions, 2 changer transitions 5/278 dead transitions. [2024-11-13 14:33:50,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 278 transitions, 612 flow [2024-11-13 14:33:50,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:50,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:50,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 904 transitions. [2024-11-13 14:33:50,659 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8488262910798122 [2024-11-13 14:33:50,661 INFO L175 Difference]: Start difference. First operand has 328 places, 335 transitions, 688 flow. Second operand 3 states and 904 transitions. [2024-11-13 14:33:50,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 278 transitions, 612 flow [2024-11-13 14:33:50,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 278 transitions, 600 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-13 14:33:50,678 INFO L231 Difference]: Finished difference. Result has 279 places, 273 transitions, 556 flow [2024-11-13 14:33:50,681 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=279, PETRI_TRANSITIONS=273} [2024-11-13 14:33:50,686 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -49 predicate places. [2024-11-13 14:33:50,687 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 273 transitions, 556 flow [2024-11-13 14:33:50,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-13 14:33:50,688 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:50,689 INFO L204 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] [2024-11-13 14:33:50,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:33:50,689 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-13 14:33:50,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:50,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1720143263, now seen corresponding path program 1 times [2024-11-13 14:33:50,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:50,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043131900] [2024-11-13 14:33:50,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:50,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:50,783 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-13 14:33:50,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:50,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043131900] [2024-11-13 14:33:50,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043131900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:50,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:50,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:50,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238690636] [2024-11-13 14:33:50,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:50,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:50,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:50,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:50,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:50,815 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 355 [2024-11-13 14:33:50,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 273 transitions, 556 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 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-13 14:33:50,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:50,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 355 [2024-11-13 14:33:50,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:51,006 INFO L124 PetriNetUnfolderBase]: 72/552 cut-off events. [2024-11-13 14:33:51,006 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-11-13 14:33:51,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 680 conditions, 552 events. 72/552 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1929 event pairs, 38 based on Foata normal form. 0/473 useless extension candidates. Maximal degree in co-relation 644. Up to 109 conditions per place. [2024-11-13 14:33:51,012 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 15 selfloop transitions, 2 changer transitions 0/272 dead transitions. [2024-11-13 14:33:51,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 272 transitions, 588 flow [2024-11-13 14:33:51,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:51,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:51,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 852 transitions. [2024-11-13 14:33:51,015 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8 [2024-11-13 14:33:51,016 INFO L175 Difference]: Start difference. First operand has 279 places, 273 transitions, 556 flow. Second operand 3 states and 852 transitions. [2024-11-13 14:33:51,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 272 transitions, 588 flow [2024-11-13 14:33:51,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 272 transitions, 584 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:33:51,036 INFO L231 Difference]: Finished difference. Result has 273 places, 272 transitions, 554 flow [2024-11-13 14:33:51,036 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=554, PETRI_PLACES=273, PETRI_TRANSITIONS=272} [2024-11-13 14:33:51,037 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -55 predicate places. [2024-11-13 14:33:51,038 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 272 transitions, 554 flow [2024-11-13 14:33:51,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 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-13 14:33:51,039 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:51,039 INFO L204 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] [2024-11-13 14:33:51,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:33:51,039 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-13 14:33:51,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:51,040 INFO L85 PathProgramCache]: Analyzing trace with hash -656296879, now seen corresponding path program 1 times [2024-11-13 14:33:51,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:51,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749497716] [2024-11-13 14:33:51,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:51,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:51,111 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-13 14:33:51,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:51,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749497716] [2024-11-13 14:33:51,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749497716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:51,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:51,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:51,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303483120] [2024-11-13 14:33:51,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:51,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:51,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:51,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:51,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:51,134 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 355 [2024-11-13 14:33:51,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 272 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 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-13 14:33:51,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:51,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 355 [2024-11-13 14:33:51,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:51,333 INFO L124 PetriNetUnfolderBase]: 72/551 cut-off events. [2024-11-13 14:33:51,335 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-11-13 14:33:51,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 551 events. 72/551 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1919 event pairs, 38 based on Foata normal form. 0/473 useless extension candidates. Maximal degree in co-relation 635. Up to 109 conditions per place. [2024-11-13 14:33:51,339 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 15 selfloop transitions, 2 changer transitions 0/271 dead transitions. [2024-11-13 14:33:51,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 271 transitions, 586 flow [2024-11-13 14:33:51,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:51,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:51,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 852 transitions. [2024-11-13 14:33:51,347 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8 [2024-11-13 14:33:51,347 INFO L175 Difference]: Start difference. First operand has 273 places, 272 transitions, 554 flow. Second operand 3 states and 852 transitions. [2024-11-13 14:33:51,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 271 transitions, 586 flow [2024-11-13 14:33:51,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 271 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:33:51,355 INFO L231 Difference]: Finished difference. Result has 272 places, 271 transitions, 552 flow [2024-11-13 14:33:51,355 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=272, PETRI_TRANSITIONS=271} [2024-11-13 14:33:51,356 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -56 predicate places. [2024-11-13 14:33:51,357 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 271 transitions, 552 flow [2024-11-13 14:33:51,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 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-13 14:33:51,358 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:51,358 INFO L204 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] [2024-11-13 14:33:51,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:33:51,359 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-13 14:33:51,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:51,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1750793152, now seen corresponding path program 1 times [2024-11-13 14:33:51,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:51,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122771644] [2024-11-13 14:33:51,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:51,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:51,452 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-13 14:33:51,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:51,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122771644] [2024-11-13 14:33:51,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122771644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:51,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:51,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:51,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043668375] [2024-11-13 14:33:51,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:51,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:51,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:51,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:51,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:51,475 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 355 [2024-11-13 14:33:51,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 271 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 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-13 14:33:51,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:51,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 355 [2024-11-13 14:33:51,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:51,642 INFO L124 PetriNetUnfolderBase]: 72/550 cut-off events. [2024-11-13 14:33:51,642 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-11-13 14:33:51,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 678 conditions, 550 events. 72/550 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1920 event pairs, 38 based on Foata normal form. 0/473 useless extension candidates. Maximal degree in co-relation 626. Up to 109 conditions per place. [2024-11-13 14:33:51,646 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 15 selfloop transitions, 2 changer transitions 0/270 dead transitions. [2024-11-13 14:33:51,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 270 transitions, 584 flow [2024-11-13 14:33:51,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:51,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:51,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 852 transitions. [2024-11-13 14:33:51,650 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8 [2024-11-13 14:33:51,650 INFO L175 Difference]: Start difference. First operand has 272 places, 271 transitions, 552 flow. Second operand 3 states and 852 transitions. [2024-11-13 14:33:51,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 270 transitions, 584 flow [2024-11-13 14:33:51,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 270 transitions, 580 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:33:51,657 INFO L231 Difference]: Finished difference. Result has 271 places, 270 transitions, 550 flow [2024-11-13 14:33:51,658 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=550, PETRI_PLACES=271, PETRI_TRANSITIONS=270} [2024-11-13 14:33:51,659 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -57 predicate places. [2024-11-13 14:33:51,659 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 270 transitions, 550 flow [2024-11-13 14:33:51,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 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-13 14:33:51,660 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:51,660 INFO L204 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] [2024-11-13 14:33:51,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 14:33:51,660 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-13 14:33:51,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:51,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1985576641, now seen corresponding path program 1 times [2024-11-13 14:33:51,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:51,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324332981] [2024-11-13 14:33:51,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:51,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:51,716 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-13 14:33:51,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:51,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324332981] [2024-11-13 14:33:51,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324332981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:51,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:51,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:51,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868084172] [2024-11-13 14:33:51,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:51,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:51,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:51,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:51,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:51,730 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 355 [2024-11-13 14:33:51,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 270 transitions, 550 flow. Second operand has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 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-13 14:33:51,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:51,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 355 [2024-11-13 14:33:51,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:51,899 INFO L124 PetriNetUnfolderBase]: 75/598 cut-off events. [2024-11-13 14:33:51,899 INFO L125 PetriNetUnfolderBase]: For 9/10 co-relation queries the response was YES. [2024-11-13 14:33:51,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 598 events. 75/598 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2352 event pairs, 18 based on Foata normal form. 0/521 useless extension candidates. Maximal degree in co-relation 665. Up to 81 conditions per place. [2024-11-13 14:33:51,903 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 18 selfloop transitions, 2 changer transitions 0/275 dead transitions. [2024-11-13 14:33:51,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 275 transitions, 602 flow [2024-11-13 14:33:51,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:51,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:51,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 867 transitions. [2024-11-13 14:33:51,906 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8140845070422535 [2024-11-13 14:33:51,906 INFO L175 Difference]: Start difference. First operand has 271 places, 270 transitions, 550 flow. Second operand 3 states and 867 transitions. [2024-11-13 14:33:51,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 275 transitions, 602 flow [2024-11-13 14:33:51,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 275 transitions, 598 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:33:51,912 INFO L231 Difference]: Finished difference. Result has 271 places, 270 transitions, 554 flow [2024-11-13 14:33:51,913 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=554, PETRI_PLACES=271, PETRI_TRANSITIONS=270} [2024-11-13 14:33:51,914 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -57 predicate places. [2024-11-13 14:33:51,914 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 270 transitions, 554 flow [2024-11-13 14:33:51,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 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-13 14:33:51,915 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:51,915 INFO L204 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] [2024-11-13 14:33:51,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 14:33:51,915 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-13 14:33:51,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:51,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1719663813, now seen corresponding path program 1 times [2024-11-13 14:33:51,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:51,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737543] [2024-11-13 14:33:51,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:51,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:51,988 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-13 14:33:51,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:51,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737543] [2024-11-13 14:33:51,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:51,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:51,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:51,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142969247] [2024-11-13 14:33:51,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:51,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:51,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:51,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:51,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:52,007 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 355 [2024-11-13 14:33:52,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 270 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 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-13 14:33:52,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:52,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 355 [2024-11-13 14:33:52,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:52,148 INFO L124 PetriNetUnfolderBase]: 72/552 cut-off events. [2024-11-13 14:33:52,148 INFO L125 PetriNetUnfolderBase]: For 31/32 co-relation queries the response was YES. [2024-11-13 14:33:52,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 714 conditions, 552 events. 72/552 cut-off events. For 31/32 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1985 event pairs, 38 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 302. Up to 110 conditions per place. [2024-11-13 14:33:52,155 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 15 selfloop transitions, 2 changer transitions 0/269 dead transitions. [2024-11-13 14:33:52,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 269 transitions, 586 flow [2024-11-13 14:33:52,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:52,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:52,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 854 transitions. [2024-11-13 14:33:52,160 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8018779342723005 [2024-11-13 14:33:52,160 INFO L175 Difference]: Start difference. First operand has 271 places, 270 transitions, 554 flow. Second operand 3 states and 854 transitions. [2024-11-13 14:33:52,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 269 transitions, 586 flow [2024-11-13 14:33:52,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 269 transitions, 584 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 14:33:52,166 INFO L231 Difference]: Finished difference. Result has 271 places, 269 transitions, 554 flow [2024-11-13 14:33:52,167 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=554, PETRI_PLACES=271, PETRI_TRANSITIONS=269} [2024-11-13 14:33:52,169 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -57 predicate places. [2024-11-13 14:33:52,170 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 269 transitions, 554 flow [2024-11-13 14:33:52,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 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-13 14:33:52,171 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:52,171 INFO L204 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] [2024-11-13 14:33:52,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 14:33:52,171 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-13 14:33:52,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:52,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1379468705, now seen corresponding path program 1 times [2024-11-13 14:33:52,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:52,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251295124] [2024-11-13 14:33:52,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:52,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:52,256 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-13 14:33:52,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:52,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251295124] [2024-11-13 14:33:52,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251295124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:52,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:52,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:52,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023889217] [2024-11-13 14:33:52,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:52,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:52,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:52,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:52,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:52,281 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 355 [2024-11-13 14:33:52,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 269 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 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-13 14:33:52,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:52,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 355 [2024-11-13 14:33:52,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:52,425 INFO L124 PetriNetUnfolderBase]: 72/551 cut-off events. [2024-11-13 14:33:52,425 INFO L125 PetriNetUnfolderBase]: For 30/31 co-relation queries the response was YES. [2024-11-13 14:33:52,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 551 events. 72/551 cut-off events. For 30/31 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1964 event pairs, 38 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 636. Up to 111 conditions per place. [2024-11-13 14:33:52,429 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 16 selfloop transitions, 2 changer transitions 0/268 dead transitions. [2024-11-13 14:33:52,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 268 transitions, 588 flow [2024-11-13 14:33:52,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:52,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:52,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 852 transitions. [2024-11-13 14:33:52,432 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8 [2024-11-13 14:33:52,432 INFO L175 Difference]: Start difference. First operand has 271 places, 269 transitions, 554 flow. Second operand 3 states and 852 transitions. [2024-11-13 14:33:52,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 268 transitions, 588 flow [2024-11-13 14:33:52,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 268 transitions, 584 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:33:52,438 INFO L231 Difference]: Finished difference. Result has 270 places, 268 transitions, 552 flow [2024-11-13 14:33:52,439 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=270, PETRI_TRANSITIONS=268} [2024-11-13 14:33:52,440 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -58 predicate places. [2024-11-13 14:33:52,441 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 268 transitions, 552 flow [2024-11-13 14:33:52,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 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-13 14:33:52,441 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:52,441 INFO L204 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] [2024-11-13 14:33:52,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 14:33:52,442 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-13 14:33:52,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:52,442 INFO L85 PathProgramCache]: Analyzing trace with hash 624526047, now seen corresponding path program 1 times [2024-11-13 14:33:52,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:52,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017189705] [2024-11-13 14:33:52,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:52,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:52,495 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-13 14:33:52,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:52,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017189705] [2024-11-13 14:33:52,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017189705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:52,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:52,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:52,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489246355] [2024-11-13 14:33:52,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:52,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:52,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:52,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:52,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:52,508 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 355 [2024-11-13 14:33:52,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 268 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 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-13 14:33:52,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:52,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 355 [2024-11-13 14:33:52,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:52,662 INFO L124 PetriNetUnfolderBase]: 83/654 cut-off events. [2024-11-13 14:33:52,662 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-11-13 14:33:52,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 818 conditions, 654 events. 83/654 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2732 event pairs, 20 based on Foata normal form. 0/567 useless extension candidates. Maximal degree in co-relation 741. Up to 66 conditions per place. [2024-11-13 14:33:52,666 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 21 selfloop transitions, 2 changer transitions 0/275 dead transitions. [2024-11-13 14:33:52,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 275 transitions, 618 flow [2024-11-13 14:33:52,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:52,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:52,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 868 transitions. [2024-11-13 14:33:52,669 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8150234741784037 [2024-11-13 14:33:52,669 INFO L175 Difference]: Start difference. First operand has 270 places, 268 transitions, 552 flow. Second operand 3 states and 868 transitions. [2024-11-13 14:33:52,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 275 transitions, 618 flow [2024-11-13 14:33:52,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 275 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:33:52,674 INFO L231 Difference]: Finished difference. Result has 270 places, 268 transitions, 556 flow [2024-11-13 14:33:52,675 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=270, PETRI_TRANSITIONS=268} [2024-11-13 14:33:52,677 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -58 predicate places. [2024-11-13 14:33:52,677 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 268 transitions, 556 flow [2024-11-13 14:33:52,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 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-13 14:33:52,678 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:52,681 INFO L204 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] [2024-11-13 14:33:52,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 14:33:52,681 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-13 14:33:52,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:52,682 INFO L85 PathProgramCache]: Analyzing trace with hash 392899469, now seen corresponding path program 1 times [2024-11-13 14:33:52,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:52,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403101542] [2024-11-13 14:33:52,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:52,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:52,759 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-13 14:33:52,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:52,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403101542] [2024-11-13 14:33:52,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403101542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:52,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:52,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:52,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048629301] [2024-11-13 14:33:52,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:52,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:52,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:52,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:52,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:52,774 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 355 [2024-11-13 14:33:52,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 268 transitions, 556 flow. Second operand has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 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-13 14:33:52,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:52,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 355 [2024-11-13 14:33:52,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:52,916 INFO L124 PetriNetUnfolderBase]: 83/564 cut-off events. [2024-11-13 14:33:52,917 INFO L125 PetriNetUnfolderBase]: For 57/58 co-relation queries the response was YES. [2024-11-13 14:33:52,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 564 events. 83/564 cut-off events. For 57/58 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1998 event pairs, 38 based on Foata normal form. 0/485 useless extension candidates. Maximal degree in co-relation 450. Up to 123 conditions per place. [2024-11-13 14:33:52,920 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 16 selfloop transitions, 2 changer transitions 0/267 dead transitions. [2024-11-13 14:33:52,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 267 transitions, 590 flow [2024-11-13 14:33:52,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:52,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:52,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 854 transitions. [2024-11-13 14:33:52,923 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8018779342723005 [2024-11-13 14:33:52,923 INFO L175 Difference]: Start difference. First operand has 270 places, 268 transitions, 556 flow. Second operand 3 states and 854 transitions. [2024-11-13 14:33:52,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 267 transitions, 590 flow [2024-11-13 14:33:52,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 267 transitions, 588 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 14:33:52,927 INFO L231 Difference]: Finished difference. Result has 270 places, 267 transitions, 556 flow [2024-11-13 14:33:52,928 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=270, PETRI_TRANSITIONS=267} [2024-11-13 14:33:52,929 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -58 predicate places. [2024-11-13 14:33:52,929 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 267 transitions, 556 flow [2024-11-13 14:33:52,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 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-13 14:33:52,930 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:52,930 INFO L204 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] [2024-11-13 14:33:52,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 14:33:52,930 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-13 14:33:52,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:52,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1083544212, now seen corresponding path program 1 times [2024-11-13 14:33:52,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:52,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136509408] [2024-11-13 14:33:52,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:52,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:52,968 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-13 14:33:52,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:52,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136509408] [2024-11-13 14:33:52,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136509408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:52,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:52,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:52,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276228536] [2024-11-13 14:33:52,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:52,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:52,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:52,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:52,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:52,979 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 355 [2024-11-13 14:33:52,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 267 transitions, 556 flow. Second operand has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 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-13 14:33:52,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:52,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 355 [2024-11-13 14:33:52,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:53,107 INFO L124 PetriNetUnfolderBase]: 83/563 cut-off events. [2024-11-13 14:33:53,107 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2024-11-13 14:33:53,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 755 conditions, 563 events. 83/563 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1999 event pairs, 38 based on Foata normal form. 0/485 useless extension candidates. Maximal degree in co-relation 669. Up to 121 conditions per place. [2024-11-13 14:33:53,111 INFO L140 encePairwiseOnDemand]: 353/355 looper letters, 15 selfloop transitions, 1 changer transitions 0/266 dead transitions. [2024-11-13 14:33:53,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 266 transitions, 586 flow [2024-11-13 14:33:53,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:53,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:53,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 861 transitions. [2024-11-13 14:33:53,114 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8084507042253521 [2024-11-13 14:33:53,114 INFO L175 Difference]: Start difference. First operand has 270 places, 267 transitions, 556 flow. Second operand 3 states and 861 transitions. [2024-11-13 14:33:53,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 266 transitions, 586 flow [2024-11-13 14:33:53,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 266 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:33:53,119 INFO L231 Difference]: Finished difference. Result has 269 places, 266 transitions, 552 flow [2024-11-13 14:33:53,120 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=269, PETRI_TRANSITIONS=266} [2024-11-13 14:33:53,120 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -59 predicate places. [2024-11-13 14:33:53,120 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 266 transitions, 552 flow [2024-11-13 14:33:53,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 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-13 14:33:53,121 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:53,121 INFO L204 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] [2024-11-13 14:33:53,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 14:33:53,122 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-13 14:33:53,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:53,122 INFO L85 PathProgramCache]: Analyzing trace with hash -298191291, now seen corresponding path program 1 times [2024-11-13 14:33:53,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:53,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159520631] [2024-11-13 14:33:53,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:53,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:53,961 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-13 14:33:53,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:53,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159520631] [2024-11-13 14:33:53,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159520631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:53,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:53,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:33:53,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523450701] [2024-11-13 14:33:53,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:53,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:33:53,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:53,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:33:53,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:33:54,221 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 355 [2024-11-13 14:33:54,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 266 transitions, 552 flow. Second operand has 6 states, 6 states have (on average 259.5) internal successors, (1557), 6 states have internal predecessors, (1557), 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-13 14:33:54,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:54,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 355 [2024-11-13 14:33:54,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:54,388 INFO L124 PetriNetUnfolderBase]: 83/561 cut-off events. [2024-11-13 14:33:54,389 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2024-11-13 14:33:54,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 561 events. 83/561 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2001 event pairs, 38 based on Foata normal form. 0/485 useless extension candidates. Maximal degree in co-relation 690. Up to 136 conditions per place. [2024-11-13 14:33:54,392 INFO L140 encePairwiseOnDemand]: 343/355 looper letters, 29 selfloop transitions, 10 changer transitions 0/264 dead transitions. [2024-11-13 14:33:54,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 264 transitions, 626 flow [2024-11-13 14:33:54,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:33:54,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 14:33:54,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1587 transitions. [2024-11-13 14:33:54,397 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7450704225352113 [2024-11-13 14:33:54,399 INFO L175 Difference]: Start difference. First operand has 269 places, 266 transitions, 552 flow. Second operand 6 states and 1587 transitions. [2024-11-13 14:33:54,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 264 transitions, 626 flow [2024-11-13 14:33:54,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 264 transitions, 625 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 14:33:54,406 INFO L231 Difference]: Finished difference. Result has 271 places, 264 transitions, 567 flow [2024-11-13 14:33:54,406 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=567, PETRI_PLACES=271, PETRI_TRANSITIONS=264} [2024-11-13 14:33:54,407 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -57 predicate places. [2024-11-13 14:33:54,407 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 264 transitions, 567 flow [2024-11-13 14:33:54,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 259.5) internal successors, (1557), 6 states have internal predecessors, (1557), 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-13 14:33:54,408 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:54,409 INFO L204 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] [2024-11-13 14:33:54,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 14:33:54,409 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-13 14:33:54,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:54,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1681925529, now seen corresponding path program 1 times [2024-11-13 14:33:54,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:54,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726877612] [2024-11-13 14:33:54,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:54,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:54,477 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-13 14:33:54,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:54,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726877612] [2024-11-13 14:33:54,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726877612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:54,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:54,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:54,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781990046] [2024-11-13 14:33:54,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:54,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:54,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:54,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:54,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:54,493 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 355 [2024-11-13 14:33:54,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 264 transitions, 567 flow. Second operand has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 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-13 14:33:54,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:54,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 355 [2024-11-13 14:33:54,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:54,650 INFO L124 PetriNetUnfolderBase]: 83/560 cut-off events. [2024-11-13 14:33:54,650 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2024-11-13 14:33:54,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 763 conditions, 560 events. 83/560 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1998 event pairs, 38 based on Foata normal form. 0/485 useless extension candidates. Maximal degree in co-relation 728. Up to 123 conditions per place. [2024-11-13 14:33:54,654 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 16 selfloop transitions, 2 changer transitions 0/263 dead transitions. [2024-11-13 14:33:54,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 263 transitions, 601 flow [2024-11-13 14:33:54,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:54,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:54,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 854 transitions. [2024-11-13 14:33:54,658 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8018779342723005 [2024-11-13 14:33:54,658 INFO L175 Difference]: Start difference. First operand has 271 places, 264 transitions, 567 flow. Second operand 3 states and 854 transitions. [2024-11-13 14:33:54,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 263 transitions, 601 flow [2024-11-13 14:33:54,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 263 transitions, 581 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-13 14:33:54,665 INFO L231 Difference]: Finished difference. Result has 267 places, 263 transitions, 549 flow [2024-11-13 14:33:54,666 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=549, PETRI_PLACES=267, PETRI_TRANSITIONS=263} [2024-11-13 14:33:54,668 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -61 predicate places. [2024-11-13 14:33:54,668 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 263 transitions, 549 flow [2024-11-13 14:33:54,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 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-13 14:33:54,669 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:54,669 INFO L204 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] [2024-11-13 14:33:54,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 14:33:54,669 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-13 14:33:54,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:54,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1405463253, now seen corresponding path program 1 times [2024-11-13 14:33:54,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:54,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717624144] [2024-11-13 14:33:54,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:54,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:54,737 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-13 14:33:54,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:54,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717624144] [2024-11-13 14:33:54,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717624144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:54,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:54,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:54,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399555654] [2024-11-13 14:33:54,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:54,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:54,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:54,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:54,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:54,748 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 355 [2024-11-13 14:33:54,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 263 transitions, 549 flow. Second operand has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 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-13 14:33:54,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:54,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 355 [2024-11-13 14:33:54,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:54,876 INFO L124 PetriNetUnfolderBase]: 83/559 cut-off events. [2024-11-13 14:33:54,876 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2024-11-13 14:33:54,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 559 events. 83/559 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1997 event pairs, 38 based on Foata normal form. 0/485 useless extension candidates. Maximal degree in co-relation 666. Up to 121 conditions per place. [2024-11-13 14:33:54,880 INFO L140 encePairwiseOnDemand]: 353/355 looper letters, 15 selfloop transitions, 1 changer transitions 0/262 dead transitions. [2024-11-13 14:33:54,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 262 transitions, 579 flow [2024-11-13 14:33:54,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:54,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:54,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 861 transitions. [2024-11-13 14:33:54,882 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8084507042253521 [2024-11-13 14:33:54,882 INFO L175 Difference]: Start difference. First operand has 267 places, 263 transitions, 549 flow. Second operand 3 states and 861 transitions. [2024-11-13 14:33:54,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 262 transitions, 579 flow [2024-11-13 14:33:54,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 262 transitions, 575 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:33:54,888 INFO L231 Difference]: Finished difference. Result has 266 places, 262 transitions, 545 flow [2024-11-13 14:33:54,888 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=545, PETRI_PLACES=266, PETRI_TRANSITIONS=262} [2024-11-13 14:33:54,890 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -62 predicate places. [2024-11-13 14:33:54,890 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 262 transitions, 545 flow [2024-11-13 14:33:54,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 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-13 14:33:54,891 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:54,892 INFO L204 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] [2024-11-13 14:33:54,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 14:33:54,892 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-13 14:33:54,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:54,892 INFO L85 PathProgramCache]: Analyzing trace with hash -365756973, now seen corresponding path program 1 times [2024-11-13 14:33:54,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:54,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747638133] [2024-11-13 14:33:54,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:54,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:54,959 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-13 14:33:54,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:54,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747638133] [2024-11-13 14:33:54,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747638133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:54,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:54,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:54,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250606437] [2024-11-13 14:33:54,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:54,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:54,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:54,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:54,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:54,978 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 355 [2024-11-13 14:33:54,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 262 transitions, 545 flow. Second operand has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 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-13 14:33:54,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:54,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 355 [2024-11-13 14:33:54,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:55,108 INFO L124 PetriNetUnfolderBase]: 83/558 cut-off events. [2024-11-13 14:33:55,109 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2024-11-13 14:33:55,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 558 events. 83/558 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1998 event pairs, 38 based on Foata normal form. 0/485 useless extension candidates. Maximal degree in co-relation 666. Up to 123 conditions per place. [2024-11-13 14:33:55,113 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 16 selfloop transitions, 2 changer transitions 0/261 dead transitions. [2024-11-13 14:33:55,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 261 transitions, 579 flow [2024-11-13 14:33:55,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:55,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:55,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 854 transitions. [2024-11-13 14:33:55,116 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8018779342723005 [2024-11-13 14:33:55,116 INFO L175 Difference]: Start difference. First operand has 266 places, 262 transitions, 545 flow. Second operand 3 states and 854 transitions. [2024-11-13 14:33:55,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 261 transitions, 579 flow [2024-11-13 14:33:55,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 261 transitions, 578 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 14:33:55,121 INFO L231 Difference]: Finished difference. Result has 266 places, 261 transitions, 546 flow [2024-11-13 14:33:55,122 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=546, PETRI_PLACES=266, PETRI_TRANSITIONS=261} [2024-11-13 14:33:55,123 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -62 predicate places. [2024-11-13 14:33:55,123 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 261 transitions, 546 flow [2024-11-13 14:33:55,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 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-13 14:33:55,124 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:55,124 INFO L204 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] [2024-11-13 14:33:55,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 14:33:55,124 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-13 14:33:55,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:55,125 INFO L85 PathProgramCache]: Analyzing trace with hash 2093198491, now seen corresponding path program 1 times [2024-11-13 14:33:55,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:55,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889315817] [2024-11-13 14:33:55,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:55,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:55,188 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-13 14:33:55,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:55,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889315817] [2024-11-13 14:33:55,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889315817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:55,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:55,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:55,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816906661] [2024-11-13 14:33:55,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:55,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:55,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:55,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:55,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:55,211 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 355 [2024-11-13 14:33:55,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 261 transitions, 546 flow. Second operand has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 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-13 14:33:55,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:55,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 355 [2024-11-13 14:33:55,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:55,390 INFO L124 PetriNetUnfolderBase]: 112/669 cut-off events. [2024-11-13 14:33:55,390 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-11-13 14:33:55,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 945 conditions, 669 events. 112/669 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2876 event pairs, 64 based on Foata normal form. 1/588 useless extension candidates. Maximal degree in co-relation 859. Up to 171 conditions per place. [2024-11-13 14:33:55,393 INFO L140 encePairwiseOnDemand]: 351/355 looper letters, 17 selfloop transitions, 1 changer transitions 2/258 dead transitions. [2024-11-13 14:33:55,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 258 transitions, 578 flow [2024-11-13 14:33:55,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:55,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:55,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 848 transitions. [2024-11-13 14:33:55,396 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7962441314553991 [2024-11-13 14:33:55,396 INFO L175 Difference]: Start difference. First operand has 266 places, 261 transitions, 546 flow. Second operand 3 states and 848 transitions. [2024-11-13 14:33:55,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 258 transitions, 578 flow [2024-11-13 14:33:55,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 258 transitions, 574 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:33:55,401 INFO L231 Difference]: Finished difference. Result has 263 places, 256 transitions, 534 flow [2024-11-13 14:33:55,401 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=534, PETRI_PLACES=263, PETRI_TRANSITIONS=256} [2024-11-13 14:33:55,402 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -65 predicate places. [2024-11-13 14:33:55,402 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 256 transitions, 534 flow [2024-11-13 14:33:55,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 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-13 14:33:55,402 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:55,403 INFO L204 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] [2024-11-13 14:33:55,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 14:33:55,403 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-13 14:33:55,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:55,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1690068322, now seen corresponding path program 1 times [2024-11-13 14:33:55,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:55,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079434760] [2024-11-13 14:33:55,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:55,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:55,542 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-13 14:33:55,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:55,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079434760] [2024-11-13 14:33:55,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079434760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:55,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:55,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:55,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353010277] [2024-11-13 14:33:55,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:55,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:55,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:55,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:55,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:55,555 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 355 [2024-11-13 14:33:55,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 256 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 284.0) internal successors, (852), 3 states have internal predecessors, (852), 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-13 14:33:55,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:55,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 355 [2024-11-13 14:33:55,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:55,716 INFO L124 PetriNetUnfolderBase]: 158/619 cut-off events. [2024-11-13 14:33:55,717 INFO L125 PetriNetUnfolderBase]: For 86/87 co-relation queries the response was YES. [2024-11-13 14:33:55,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 950 conditions, 619 events. 158/619 cut-off events. For 86/87 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2290 event pairs, 53 based on Foata normal form. 0/559 useless extension candidates. Maximal degree in co-relation 865. Up to 156 conditions per place. [2024-11-13 14:33:55,721 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 20 selfloop transitions, 2 changer transitions 0/261 dead transitions. [2024-11-13 14:33:55,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 261 transitions, 594 flow [2024-11-13 14:33:55,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:55,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:55,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 866 transitions. [2024-11-13 14:33:55,724 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8131455399061033 [2024-11-13 14:33:55,724 INFO L175 Difference]: Start difference. First operand has 263 places, 256 transitions, 534 flow. Second operand 3 states and 866 transitions. [2024-11-13 14:33:55,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 261 transitions, 594 flow [2024-11-13 14:33:55,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 261 transitions, 593 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 14:33:55,729 INFO L231 Difference]: Finished difference. Result has 261 places, 255 transitions, 535 flow [2024-11-13 14:33:55,730 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=535, PETRI_PLACES=261, PETRI_TRANSITIONS=255} [2024-11-13 14:33:55,731 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -67 predicate places. [2024-11-13 14:33:55,731 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 255 transitions, 535 flow [2024-11-13 14:33:55,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.0) internal successors, (852), 3 states have internal predecessors, (852), 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-13 14:33:55,731 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:55,732 INFO L204 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] [2024-11-13 14:33:55,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 14:33:55,732 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-13 14:33:55,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:55,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1046316069, now seen corresponding path program 1 times [2024-11-13 14:33:55,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:55,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007472180] [2024-11-13 14:33:55,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:55,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:55,819 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-13 14:33:55,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:55,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007472180] [2024-11-13 14:33:55,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007472180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:55,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:55,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:55,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165588582] [2024-11-13 14:33:55,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:55,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:55,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:55,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:55,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:55,833 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 355 [2024-11-13 14:33:55,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 255 transitions, 535 flow. Second operand has 3 states, 3 states have (on average 282.6666666666667) internal successors, (848), 3 states have internal predecessors, (848), 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-13 14:33:55,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:55,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 355 [2024-11-13 14:33:55,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:56,023 INFO L124 PetriNetUnfolderBase]: 208/659 cut-off events. [2024-11-13 14:33:56,023 INFO L125 PetriNetUnfolderBase]: For 107/107 co-relation queries the response was YES. [2024-11-13 14:33:56,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1106 conditions, 659 events. 208/659 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2459 event pairs, 83 based on Foata normal form. 0/604 useless extension candidates. Maximal degree in co-relation 1021. Up to 228 conditions per place. [2024-11-13 14:33:56,027 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 22 selfloop transitions, 2 changer transitions 0/260 dead transitions. [2024-11-13 14:33:56,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 260 transitions, 599 flow [2024-11-13 14:33:56,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:56,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:56,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 862 transitions. [2024-11-13 14:33:56,030 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8093896713615023 [2024-11-13 14:33:56,030 INFO L175 Difference]: Start difference. First operand has 261 places, 255 transitions, 535 flow. Second operand 3 states and 862 transitions. [2024-11-13 14:33:56,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 260 transitions, 599 flow [2024-11-13 14:33:56,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 260 transitions, 595 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:33:56,035 INFO L231 Difference]: Finished difference. Result has 260 places, 254 transitions, 533 flow [2024-11-13 14:33:56,036 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=533, PETRI_PLACES=260, PETRI_TRANSITIONS=254} [2024-11-13 14:33:56,036 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -68 predicate places. [2024-11-13 14:33:56,036 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 254 transitions, 533 flow [2024-11-13 14:33:56,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 282.6666666666667) internal successors, (848), 3 states have internal predecessors, (848), 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-13 14:33:56,037 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:56,037 INFO L204 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] [2024-11-13 14:33:56,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 14:33:56,037 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-13 14:33:56,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:56,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1808194672, now seen corresponding path program 1 times [2024-11-13 14:33:56,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:56,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516508488] [2024-11-13 14:33:56,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:56,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:56,129 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-13 14:33:56,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:56,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516508488] [2024-11-13 14:33:56,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516508488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:56,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:56,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:56,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301320295] [2024-11-13 14:33:56,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:56,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:56,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:56,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:56,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:56,147 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 355 [2024-11-13 14:33:56,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 254 transitions, 533 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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-13 14:33:56,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:56,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 355 [2024-11-13 14:33:56,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:56,349 INFO L124 PetriNetUnfolderBase]: 167/729 cut-off events. [2024-11-13 14:33:56,349 INFO L125 PetriNetUnfolderBase]: For 93/105 co-relation queries the response was YES. [2024-11-13 14:33:56,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1087 conditions, 729 events. 167/729 cut-off events. For 93/105 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3170 event pairs, 56 based on Foata normal form. 1/659 useless extension candidates. Maximal degree in co-relation 1002. Up to 161 conditions per place. [2024-11-13 14:33:56,353 INFO L140 encePairwiseOnDemand]: 350/355 looper letters, 20 selfloop transitions, 2 changer transitions 2/259 dead transitions. [2024-11-13 14:33:56,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 259 transitions, 597 flow [2024-11-13 14:33:56,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:56,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:56,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 860 transitions. [2024-11-13 14:33:56,356 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8075117370892019 [2024-11-13 14:33:56,357 INFO L175 Difference]: Start difference. First operand has 260 places, 254 transitions, 533 flow. Second operand 3 states and 860 transitions. [2024-11-13 14:33:56,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 259 transitions, 597 flow [2024-11-13 14:33:56,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 259 transitions, 593 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:33:56,361 INFO L231 Difference]: Finished difference. Result has 258 places, 250 transitions, 524 flow [2024-11-13 14:33:56,362 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=258, PETRI_TRANSITIONS=250} [2024-11-13 14:33:56,362 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -70 predicate places. [2024-11-13 14:33:56,362 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 250 transitions, 524 flow [2024-11-13 14:33:56,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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-13 14:33:56,363 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:33:56,363 INFO L204 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] [2024-11-13 14:33:56,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 14:33:56,363 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-13 14:33:56,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:56,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1042768755, now seen corresponding path program 1 times [2024-11-13 14:33:56,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:56,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808134116] [2024-11-13 14:33:56,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:56,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:56,448 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-13 14:33:56,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:56,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808134116] [2024-11-13 14:33:56,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808134116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:56,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:56,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:33:56,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016293724] [2024-11-13 14:33:56,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:56,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:33:56,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:56,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:33:56,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:33:56,468 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 355 [2024-11-13 14:33:56,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 250 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 281.6666666666667) internal successors, (845), 3 states have internal predecessors, (845), 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-13 14:33:56,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:33:56,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 355 [2024-11-13 14:33:56,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:33:56,671 INFO L124 PetriNetUnfolderBase]: 223/771 cut-off events. [2024-11-13 14:33:56,672 INFO L125 PetriNetUnfolderBase]: For 130/156 co-relation queries the response was YES. [2024-11-13 14:33:56,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 771 events. 223/771 cut-off events. For 130/156 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3350 event pairs, 92 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 1146. Up to 242 conditions per place. [2024-11-13 14:33:56,674 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 0 selfloop transitions, 0 changer transitions 256/256 dead transitions. [2024-11-13 14:33:56,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 256 transitions, 590 flow [2024-11-13 14:33:56,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:33:56,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:33:56,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 859 transitions. [2024-11-13 14:33:56,677 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8065727699530516 [2024-11-13 14:33:56,677 INFO L175 Difference]: Start difference. First operand has 258 places, 250 transitions, 524 flow. Second operand 3 states and 859 transitions. [2024-11-13 14:33:56,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 256 transitions, 590 flow [2024-11-13 14:33:56,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 256 transitions, 586 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:33:56,680 INFO L231 Difference]: Finished difference. Result has 255 places, 0 transitions, 0 flow [2024-11-13 14:33:56,680 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=255, PETRI_TRANSITIONS=0} [2024-11-13 14:33:56,681 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -73 predicate places. [2024-11-13 14:33:56,681 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 0 transitions, 0 flow [2024-11-13 14:33:56,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.6666666666667) internal successors, (845), 3 states have internal predecessors, (845), 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-13 14:33:56,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (118 of 119 remaining) [2024-11-13 14:33:56,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (117 of 119 remaining) [2024-11-13 14:33:56,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (116 of 119 remaining) [2024-11-13 14:33:56,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (115 of 119 remaining) [2024-11-13 14:33:56,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (114 of 119 remaining) [2024-11-13 14:33:56,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (113 of 119 remaining) [2024-11-13 14:33:56,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (112 of 119 remaining) [2024-11-13 14:33:56,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (111 of 119 remaining) [2024-11-13 14:33:56,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (110 of 119 remaining) [2024-11-13 14:33:56,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (109 of 119 remaining) [2024-11-13 14:33:56,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (108 of 119 remaining) [2024-11-13 14:33:56,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (107 of 119 remaining) [2024-11-13 14:33:56,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (106 of 119 remaining) [2024-11-13 14:33:56,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (105 of 119 remaining) [2024-11-13 14:33:56,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (104 of 119 remaining) [2024-11-13 14:33:56,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (103 of 119 remaining) [2024-11-13 14:33:56,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (102 of 119 remaining) [2024-11-13 14:33:56,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (101 of 119 remaining) [2024-11-13 14:33:56,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (100 of 119 remaining) [2024-11-13 14:33:56,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (99 of 119 remaining) [2024-11-13 14:33:56,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (98 of 119 remaining) [2024-11-13 14:33:56,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (97 of 119 remaining) [2024-11-13 14:33:56,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (96 of 119 remaining) [2024-11-13 14:33:56,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (95 of 119 remaining) [2024-11-13 14:33:56,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (94 of 119 remaining) [2024-11-13 14:33:56,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (93 of 119 remaining) [2024-11-13 14:33:56,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (92 of 119 remaining) [2024-11-13 14:33:56,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (91 of 119 remaining) [2024-11-13 14:33:56,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (90 of 119 remaining) [2024-11-13 14:33:56,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (89 of 119 remaining) [2024-11-13 14:33:56,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (88 of 119 remaining) [2024-11-13 14:33:56,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (87 of 119 remaining) [2024-11-13 14:33:56,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (86 of 119 remaining) [2024-11-13 14:33:56,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (85 of 119 remaining) [2024-11-13 14:33:56,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (84 of 119 remaining) [2024-11-13 14:33:56,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (83 of 119 remaining) [2024-11-13 14:33:56,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (82 of 119 remaining) [2024-11-13 14:33:56,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (81 of 119 remaining) [2024-11-13 14:33:56,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (80 of 119 remaining) [2024-11-13 14:33:56,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (79 of 119 remaining) [2024-11-13 14:33:56,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (78 of 119 remaining) [2024-11-13 14:33:56,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (77 of 119 remaining) [2024-11-13 14:33:56,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (76 of 119 remaining) [2024-11-13 14:33:56,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (75 of 119 remaining) [2024-11-13 14:33:56,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (74 of 119 remaining) [2024-11-13 14:33:56,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (73 of 119 remaining) [2024-11-13 14:33:56,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (72 of 119 remaining) [2024-11-13 14:33:56,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (71 of 119 remaining) [2024-11-13 14:33:56,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (70 of 119 remaining) [2024-11-13 14:33:56,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (69 of 119 remaining) [2024-11-13 14:33:56,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (68 of 119 remaining) [2024-11-13 14:33:56,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (67 of 119 remaining) [2024-11-13 14:33:56,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (66 of 119 remaining) [2024-11-13 14:33:56,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (65 of 119 remaining) [2024-11-13 14:33:56,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (64 of 119 remaining) [2024-11-13 14:33:56,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (63 of 119 remaining) [2024-11-13 14:33:56,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (62 of 119 remaining) [2024-11-13 14:33:56,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (61 of 119 remaining) [2024-11-13 14:33:56,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (60 of 119 remaining) [2024-11-13 14:33:56,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (59 of 119 remaining) [2024-11-13 14:33:56,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (58 of 119 remaining) [2024-11-13 14:33:56,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (57 of 119 remaining) [2024-11-13 14:33:56,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (56 of 119 remaining) [2024-11-13 14:33:56,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (55 of 119 remaining) [2024-11-13 14:33:56,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (54 of 119 remaining) [2024-11-13 14:33:56,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (53 of 119 remaining) [2024-11-13 14:33:56,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (52 of 119 remaining) [2024-11-13 14:33:56,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 119 remaining) [2024-11-13 14:33:56,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 119 remaining) [2024-11-13 14:33:56,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 119 remaining) [2024-11-13 14:33:56,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (48 of 119 remaining) [2024-11-13 14:33:56,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (47 of 119 remaining) [2024-11-13 14:33:56,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (46 of 119 remaining) [2024-11-13 14:33:56,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (45 of 119 remaining) [2024-11-13 14:33:56,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (44 of 119 remaining) [2024-11-13 14:33:56,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (43 of 119 remaining) [2024-11-13 14:33:56,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (42 of 119 remaining) [2024-11-13 14:33:56,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (41 of 119 remaining) [2024-11-13 14:33:56,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (40 of 119 remaining) [2024-11-13 14:33:56,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (39 of 119 remaining) [2024-11-13 14:33:56,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (38 of 119 remaining) [2024-11-13 14:33:56,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (37 of 119 remaining) [2024-11-13 14:33:56,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (36 of 119 remaining) [2024-11-13 14:33:56,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (35 of 119 remaining) [2024-11-13 14:33:56,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (34 of 119 remaining) [2024-11-13 14:33:56,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (33 of 119 remaining) [2024-11-13 14:33:56,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (32 of 119 remaining) [2024-11-13 14:33:56,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (31 of 119 remaining) [2024-11-13 14:33:56,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (30 of 119 remaining) [2024-11-13 14:33:56,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (29 of 119 remaining) [2024-11-13 14:33:56,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (28 of 119 remaining) [2024-11-13 14:33:56,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (27 of 119 remaining) [2024-11-13 14:33:56,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (26 of 119 remaining) [2024-11-13 14:33:56,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (25 of 119 remaining) [2024-11-13 14:33:56,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (24 of 119 remaining) [2024-11-13 14:33:56,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (23 of 119 remaining) [2024-11-13 14:33:56,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (22 of 119 remaining) [2024-11-13 14:33:56,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (21 of 119 remaining) [2024-11-13 14:33:56,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (20 of 119 remaining) [2024-11-13 14:33:56,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (19 of 119 remaining) [2024-11-13 14:33:56,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (18 of 119 remaining) [2024-11-13 14:33:56,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (17 of 119 remaining) [2024-11-13 14:33:56,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (16 of 119 remaining) [2024-11-13 14:33:56,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (15 of 119 remaining) [2024-11-13 14:33:56,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (14 of 119 remaining) [2024-11-13 14:33:56,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (13 of 119 remaining) [2024-11-13 14:33:56,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (12 of 119 remaining) [2024-11-13 14:33:56,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (11 of 119 remaining) [2024-11-13 14:33:56,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (10 of 119 remaining) [2024-11-13 14:33:56,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (9 of 119 remaining) [2024-11-13 14:33:56,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (8 of 119 remaining) [2024-11-13 14:33:56,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (7 of 119 remaining) [2024-11-13 14:33:56,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (6 of 119 remaining) [2024-11-13 14:33:56,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (5 of 119 remaining) [2024-11-13 14:33:56,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (4 of 119 remaining) [2024-11-13 14:33:56,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (3 of 119 remaining) [2024-11-13 14:33:56,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (2 of 119 remaining) [2024-11-13 14:33:56,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (1 of 119 remaining) [2024-11-13 14:33:56,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (0 of 119 remaining) [2024-11-13 14:33:56,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 14:33:56,698 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:33:56,704 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 14:33:56,704 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:33:56,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:33:56 BasicIcfg [2024-11-13 14:33:56,712 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:33:56,712 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:33:56,712 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:33:56,712 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:33:56,714 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:33:49" (3/4) ... [2024-11-13 14:33:56,716 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 14:33:56,719 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-13 14:33:56,720 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-13 14:33:56,720 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-13 14:33:56,727 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2024-11-13 14:33:56,728 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-13 14:33:56,729 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-13 14:33:56,729 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 14:33:56,841 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e9e153-2e7b-4722-929e-13086e80d5ec/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 14:33:56,841 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e9e153-2e7b-4722-929e-13086e80d5ec/bin/uautomizer-verify-qhAvR1uOyd/witness.yml [2024-11-13 14:33:56,841 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:33:56,844 INFO L158 Benchmark]: Toolchain (without parser) took 9554.99ms. Allocated memory was 117.4MB in the beginning and 243.3MB in the end (delta: 125.8MB). Free memory was 92.7MB in the beginning and 179.1MB in the end (delta: -86.4MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. [2024-11-13 14:33:56,845 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 117.4MB. Free memory is still 74.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:33:56,846 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.79ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 79.2MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 14:33:56,846 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.69ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 76.0MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:33:56,847 INFO L158 Benchmark]: Boogie Preprocessor took 74.68ms. Allocated memory is still 117.4MB. Free memory was 76.0MB in the beginning and 73.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:33:56,847 INFO L158 Benchmark]: RCFGBuilder took 1659.08ms. Allocated memory is still 117.4MB. Free memory was 73.5MB in the beginning and 62.9MB in the end (delta: 10.6MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. [2024-11-13 14:33:56,848 INFO L158 Benchmark]: TraceAbstraction took 7299.60ms. Allocated memory was 117.4MB in the beginning and 243.3MB in the end (delta: 125.8MB). Free memory was 62.9MB in the beginning and 185.3MB in the end (delta: -122.4MB). Peak memory consumption was 107.1MB. Max. memory is 16.1GB. [2024-11-13 14:33:56,851 INFO L158 Benchmark]: Witness Printer took 129.19ms. Allocated memory is still 243.3MB. Free memory was 185.3MB in the beginning and 179.1MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:33:56,853 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 117.4MB. Free memory is still 74.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.79ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 79.2MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.69ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 76.0MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 74.68ms. Allocated memory is still 117.4MB. Free memory was 76.0MB in the beginning and 73.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1659.08ms. Allocated memory is still 117.4MB. Free memory was 73.5MB in the beginning and 62.9MB in the end (delta: 10.6MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7299.60ms. Allocated memory was 117.4MB in the beginning and 243.3MB in the end (delta: 125.8MB). Free memory was 62.9MB in the beginning and 185.3MB in the end (delta: -122.4MB). Peak memory consumption was 107.1MB. Max. memory is 16.1GB. * Witness Printer took 129.19ms. Allocated memory is still 243.3MB. Free memory was 185.3MB in the beginning and 179.1MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 435 locations, 119 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.1s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 355 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 159 mSDsluCounter, 87 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 766 IncrementalHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 87 mSDtfsCounter, 766 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=688occurred in iteration=0, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1877 NumberOfCodeBlocks, 1877 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1858 ConstructedInterpolants, 0 QuantifiedInterpolants, 2009 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 67 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-13 14:33:56,892 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9e9e153-2e7b-4722-929e-13086e80d5ec/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE