./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/array-eq-trans.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_4cc2f60e-75d4-4939-8cb1-05a5655bcd31/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc2f60e-75d4-4939-8cb1-05a5655bcd31/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_4cc2f60e-75d4-4939-8cb1-05a5655bcd31/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc2f60e-75d4-4939-8cb1-05a5655bcd31/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/array-eq-trans.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc2f60e-75d4-4939-8cb1-05a5655bcd31/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_4cc2f60e-75d4-4939-8cb1-05a5655bcd31/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 e7f1528a4c77969c5bff279724a3ed43475460be047e2e4b141f1353c3ea9cfe --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:13:39,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:13:40,014 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc2f60e-75d4-4939-8cb1-05a5655bcd31/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-13 15:13:40,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:13:40,022 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:13:40,061 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:13:40,062 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:13:40,062 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:13:40,063 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:13:40,063 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:13:40,064 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:13:40,064 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:13:40,064 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:13:40,064 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:13:40,064 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:13:40,066 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:13:40,066 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:13:40,067 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:13:40,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:13:40,067 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:13:40,067 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:13:40,067 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:13:40,067 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-13 15:13:40,067 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:13:40,067 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 15:13:40,068 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:13:40,068 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:13:40,068 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:13:40,068 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:13:40,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:13:40,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:13:40,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:13:40,069 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:13:40,069 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:13:40,069 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:13:40,069 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:13:40,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:13:40,069 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:13:40,069 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:13:40,069 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:13:40,069 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:13:40,069 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_4cc2f60e-75d4-4939-8cb1-05a5655bcd31/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 -> e7f1528a4c77969c5bff279724a3ed43475460be047e2e4b141f1353c3ea9cfe [2024-11-13 15:13:40,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:13:40,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:13:40,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:13:40,458 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:13:40,459 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:13:40,460 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc2f60e-75d4-4939-8cb1-05a5655bcd31/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/weaver/array-eq-trans.wvr.c Unable to find full path for "g++" [2024-11-13 15:13:42,394 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:13:42,730 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:13:42,737 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc2f60e-75d4-4939-8cb1-05a5655bcd31/sv-benchmarks/c/weaver/array-eq-trans.wvr.c [2024-11-13 15:13:42,758 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc2f60e-75d4-4939-8cb1-05a5655bcd31/bin/uautomizer-verify-qhAvR1uOyd/data/5d59a70a0/9963dcc449d549a5a12acc5cb36dcfd2/FLAGb9ee2ed9d [2024-11-13 15:13:42,819 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc2f60e-75d4-4939-8cb1-05a5655bcd31/bin/uautomizer-verify-qhAvR1uOyd/data/5d59a70a0/9963dcc449d549a5a12acc5cb36dcfd2 [2024-11-13 15:13:42,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:13:42,832 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:13:42,835 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:13:42,835 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:13:42,845 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:13:42,845 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:13:42" (1/1) ... [2024-11-13 15:13:42,850 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8ec550c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:13:42, skipping insertion in model container [2024-11-13 15:13:42,850 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:13:42" (1/1) ... [2024-11-13 15:13:42,877 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:13:43,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:13:43,155 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:13:43,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:13:43,215 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:13:43,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:13:43 WrapperNode [2024-11-13 15:13:43,216 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:13:43,218 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:13:43,218 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:13:43,218 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:13:43,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:13:43" (1/1) ... [2024-11-13 15:13:43,238 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:13:43" (1/1) ... [2024-11-13 15:13:43,283 INFO L138 Inliner]: procedures = 23, calls = 32, calls flagged for inlining = 11, calls inlined = 15, statements flattened = 322 [2024-11-13 15:13:43,285 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:13:43,286 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:13:43,286 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:13:43,286 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:13:43,294 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:13:43" (1/1) ... [2024-11-13 15:13:43,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:13:43" (1/1) ... [2024-11-13 15:13:43,301 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:13:43" (1/1) ... [2024-11-13 15:13:43,301 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:13:43" (1/1) ... [2024-11-13 15:13:43,322 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:13:43" (1/1) ... [2024-11-13 15:13:43,328 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:13:43" (1/1) ... [2024-11-13 15:13:43,331 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:13:43" (1/1) ... [2024-11-13 15:13:43,333 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:13:43" (1/1) ... [2024-11-13 15:13:43,337 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:13:43,338 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:13:43,338 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:13:43,339 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:13:43,340 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:13:43" (1/1) ... [2024-11-13 15:13:43,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:13:43,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc2f60e-75d4-4939-8cb1-05a5655bcd31/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:13:43,388 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc2f60e-75d4-4939-8cb1-05a5655bcd31/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:13:43,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc2f60e-75d4-4939-8cb1-05a5655bcd31/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:13:43,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:13:43,424 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-13 15:13:43,424 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-13 15:13:43,424 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-13 15:13:43,424 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-13 15:13:43,424 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-13 15:13:43,425 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-13 15:13:43,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 15:13:43,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 15:13:43,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 15:13:43,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:13:43,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:13:43,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 15:13:43,427 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 15:13:43,558 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:13:43,562 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:13:44,594 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 15:13:44,594 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:13:44,636 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:13:44,636 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-13 15:13:44,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:13:44 BoogieIcfgContainer [2024-11-13 15:13:44,637 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:13:44,639 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:13:44,639 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:13:44,645 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:13:44,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:13:42" (1/3) ... [2024-11-13 15:13:44,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@409470ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:13:44, skipping insertion in model container [2024-11-13 15:13:44,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:13:43" (2/3) ... [2024-11-13 15:13:44,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@409470ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:13:44, skipping insertion in model container [2024-11-13 15:13:44,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:13:44" (3/3) ... [2024-11-13 15:13:44,649 INFO L112 eAbstractionObserver]: Analyzing ICFG array-eq-trans.wvr.c [2024-11-13 15:13:44,669 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:13:44,672 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG array-eq-trans.wvr.c that has 4 procedures, 593 locations, 1 initial locations, 6 loop locations, and 78 error locations. [2024-11-13 15:13:44,674 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 15:13:44,879 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-13 15:13:44,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 602 places, 625 transitions, 1271 flow [2024-11-13 15:13:45,284 INFO L124 PetriNetUnfolderBase]: 33/622 cut-off events. [2024-11-13 15:13:45,288 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-13 15:13:45,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 635 conditions, 622 events. 33/622 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1424 event pairs, 0 based on Foata normal form. 0/511 useless extension candidates. Maximal degree in co-relation 371. Up to 3 conditions per place. [2024-11-13 15:13:45,305 INFO L82 GeneralOperation]: Start removeDead. Operand has 602 places, 625 transitions, 1271 flow [2024-11-13 15:13:45,320 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 577 places, 597 transitions, 1212 flow [2024-11-13 15:13:45,332 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:13:45,348 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;@39165be2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:13:45,348 INFO L334 AbstractCegarLoop]: Starting to check reachability of 117 error locations. [2024-11-13 15:13:45,357 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 15:13:45,357 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-11-13 15:13:45,357 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 15:13:45,358 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:13:45,359 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] [2024-11-13 15:13:45,360 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-13 15:13:45,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:13:45,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1865759074, now seen corresponding path program 1 times [2024-11-13 15:13:45,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:13:45,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913636751] [2024-11-13 15:13:45,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:13:45,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:13:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:13:45,587 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 15:13:45,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:13:45,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913636751] [2024-11-13 15:13:45,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913636751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:13:45,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:13:45,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:13:45,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110146483] [2024-11-13 15:13:45,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:13:45,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:13:45,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:13:45,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:13:45,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:13:45,720 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 625 [2024-11-13 15:13:45,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 577 places, 597 transitions, 1212 flow. Second operand has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 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 15:13:45,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:13:45,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 625 [2024-11-13 15:13:45,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:13:46,057 INFO L124 PetriNetUnfolderBase]: 30/787 cut-off events. [2024-11-13 15:13:46,057 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-13 15:13:46,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 836 conditions, 787 events. 30/787 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2551 event pairs, 5 based on Foata normal form. 30/670 useless extension candidates. Maximal degree in co-relation 440. Up to 28 conditions per place. [2024-11-13 15:13:46,069 INFO L140 encePairwiseOnDemand]: 608/625 looper letters, 14 selfloop transitions, 2 changer transitions 8/582 dead transitions. [2024-11-13 15:13:46,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 582 transitions, 1214 flow [2024-11-13 15:13:46,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:13:46,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:13:46,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1804 transitions. [2024-11-13 15:13:46,093 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9621333333333333 [2024-11-13 15:13:46,100 INFO L175 Difference]: Start difference. First operand has 577 places, 597 transitions, 1212 flow. Second operand 3 states and 1804 transitions. [2024-11-13 15:13:46,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 582 transitions, 1214 flow [2024-11-13 15:13:46,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 582 transitions, 1202 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-13 15:13:46,143 INFO L231 Difference]: Finished difference. Result has 572 places, 574 transitions, 1158 flow [2024-11-13 15:13:46,147 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1170, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1158, PETRI_PLACES=572, PETRI_TRANSITIONS=574} [2024-11-13 15:13:46,153 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -5 predicate places. [2024-11-13 15:13:46,154 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 574 transitions, 1158 flow [2024-11-13 15:13:46,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 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 15:13:46,155 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:13:46,156 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] [2024-11-13 15:13:46,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:13:46,157 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-13 15:13:46,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:13:46,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1201880995, now seen corresponding path program 1 times [2024-11-13 15:13:46,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:13:46,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494705532] [2024-11-13 15:13:46,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:13:46,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:13:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:13:46,260 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 15:13:46,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:13:46,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494705532] [2024-11-13 15:13:46,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494705532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:13:46,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:13:46,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:13:46,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759608637] [2024-11-13 15:13:46,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:13:46,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:13:46,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:13:46,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:13:46,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:13:46,328 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 625 [2024-11-13 15:13:46,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 574 transitions, 1158 flow. Second operand has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 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 15:13:46,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:13:46,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 625 [2024-11-13 15:13:46,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:13:46,800 INFO L124 PetriNetUnfolderBase]: 38/919 cut-off events. [2024-11-13 15:13:46,800 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-13 15:13:46,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 963 conditions, 919 events. 38/919 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3671 event pairs, 7 based on Foata normal form. 0/750 useless extension candidates. Maximal degree in co-relation 929. Up to 31 conditions per place. [2024-11-13 15:13:46,818 INFO L140 encePairwiseOnDemand]: 622/625 looper letters, 14 selfloop transitions, 2 changer transitions 0/573 dead transitions. [2024-11-13 15:13:46,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 573 transitions, 1188 flow [2024-11-13 15:13:46,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:13:46,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:13:46,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1790 transitions. [2024-11-13 15:13:46,829 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9546666666666667 [2024-11-13 15:13:46,832 INFO L175 Difference]: Start difference. First operand has 572 places, 574 transitions, 1158 flow. Second operand 3 states and 1790 transitions. [2024-11-13 15:13:46,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 573 transitions, 1188 flow [2024-11-13 15:13:46,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 573 transitions, 1184 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 15:13:46,849 INFO L231 Difference]: Finished difference. Result has 563 places, 573 transitions, 1156 flow [2024-11-13 15:13:46,850 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1152, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1156, PETRI_PLACES=563, PETRI_TRANSITIONS=573} [2024-11-13 15:13:46,851 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -14 predicate places. [2024-11-13 15:13:46,851 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 573 transitions, 1156 flow [2024-11-13 15:13:46,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 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 15:13:46,853 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:13:46,853 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] [2024-11-13 15:13:46,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 15:13:46,855 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-13 15:13:46,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:13:46,857 INFO L85 PathProgramCache]: Analyzing trace with hash 2088838469, now seen corresponding path program 1 times [2024-11-13 15:13:46,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:13:46,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737779171] [2024-11-13 15:13:46,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:13:46,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:13:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:13:46,974 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 15:13:46,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:13:46,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737779171] [2024-11-13 15:13:46,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737779171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:13:46,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:13:46,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:13:46,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905553711] [2024-11-13 15:13:46,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:13:46,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:13:46,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:13:46,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:13:46,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:13:47,047 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 625 [2024-11-13 15:13:47,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 573 transitions, 1156 flow. Second operand has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 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 15:13:47,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:13:47,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 625 [2024-11-13 15:13:47,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:13:47,292 INFO L124 PetriNetUnfolderBase]: 26/652 cut-off events. [2024-11-13 15:13:47,292 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-13 15:13:47,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 652 events. 26/652 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1722 event pairs, 7 based on Foata normal form. 0/546 useless extension candidates. Maximal degree in co-relation 648. Up to 28 conditions per place. [2024-11-13 15:13:47,306 INFO L140 encePairwiseOnDemand]: 622/625 looper letters, 14 selfloop transitions, 2 changer transitions 0/572 dead transitions. [2024-11-13 15:13:47,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 572 transitions, 1186 flow [2024-11-13 15:13:47,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:13:47,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:13:47,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1790 transitions. [2024-11-13 15:13:47,316 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9546666666666667 [2024-11-13 15:13:47,317 INFO L175 Difference]: Start difference. First operand has 563 places, 573 transitions, 1156 flow. Second operand 3 states and 1790 transitions. [2024-11-13 15:13:47,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 572 transitions, 1186 flow [2024-11-13 15:13:47,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 572 transitions, 1182 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 15:13:47,335 INFO L231 Difference]: Finished difference. Result has 562 places, 572 transitions, 1154 flow [2024-11-13 15:13:47,336 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1150, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1154, PETRI_PLACES=562, PETRI_TRANSITIONS=572} [2024-11-13 15:13:47,338 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -15 predicate places. [2024-11-13 15:13:47,338 INFO L471 AbstractCegarLoop]: Abstraction has has 562 places, 572 transitions, 1154 flow [2024-11-13 15:13:47,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 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 15:13:47,340 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:13:47,340 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] [2024-11-13 15:13:47,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 15:13:47,340 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-13 15:13:47,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:13:47,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1662944613, now seen corresponding path program 1 times [2024-11-13 15:13:47,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:13:47,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501091710] [2024-11-13 15:13:47,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:13:47,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:13:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:13:47,463 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 15:13:47,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:13:47,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501091710] [2024-11-13 15:13:47,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501091710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:13:47,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:13:47,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:13:47,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261407865] [2024-11-13 15:13:47,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:13:47,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:13:47,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:13:47,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:13:47,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:13:47,507 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 587 out of 625 [2024-11-13 15:13:47,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 572 transitions, 1154 flow. Second operand has 3 states, 3 states have (on average 588.0) internal successors, (1764), 3 states have internal predecessors, (1764), 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 15:13:47,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:13:47,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 587 of 625 [2024-11-13 15:13:47,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:13:47,851 INFO L124 PetriNetUnfolderBase]: 48/971 cut-off events. [2024-11-13 15:13:47,851 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-13 15:13:47,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1032 conditions, 971 events. 48/971 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4106 event pairs, 12 based on Foata normal form. 0/795 useless extension candidates. Maximal degree in co-relation 982. Up to 48 conditions per place. [2024-11-13 15:13:47,869 INFO L140 encePairwiseOnDemand]: 619/625 looper letters, 16 selfloop transitions, 1 changer transitions 0/567 dead transitions. [2024-11-13 15:13:47,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 567 transitions, 1178 flow [2024-11-13 15:13:47,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:13:47,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:13:47,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1783 transitions. [2024-11-13 15:13:47,876 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9509333333333333 [2024-11-13 15:13:47,876 INFO L175 Difference]: Start difference. First operand has 562 places, 572 transitions, 1154 flow. Second operand 3 states and 1783 transitions. [2024-11-13 15:13:47,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 567 transitions, 1178 flow [2024-11-13 15:13:47,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 557 places, 567 transitions, 1174 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 15:13:47,891 INFO L231 Difference]: Finished difference. Result has 557 places, 567 transitions, 1142 flow [2024-11-13 15:13:47,892 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=567, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1142, PETRI_PLACES=557, PETRI_TRANSITIONS=567} [2024-11-13 15:13:47,893 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -20 predicate places. [2024-11-13 15:13:47,893 INFO L471 AbstractCegarLoop]: Abstraction has has 557 places, 567 transitions, 1142 flow [2024-11-13 15:13:47,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 588.0) internal successors, (1764), 3 states have internal predecessors, (1764), 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 15:13:47,896 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:13:47,896 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] [2024-11-13 15:13:47,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 15:13:47,897 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-13 15:13:47,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:13:47,897 INFO L85 PathProgramCache]: Analyzing trace with hash 338403515, now seen corresponding path program 1 times [2024-11-13 15:13:47,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:13:47,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531536697] [2024-11-13 15:13:47,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:13:47,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:13:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:13:49,042 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 15:13:49,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:13:49,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531536697] [2024-11-13 15:13:49,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531536697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:13:49,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:13:49,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:13:49,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362727631] [2024-11-13 15:13:49,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:13:49,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:13:49,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:13:49,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:13:49,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:13:49,709 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 513 out of 625 [2024-11-13 15:13:49,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 557 places, 567 transitions, 1142 flow. Second operand has 6 states, 6 states have (on average 514.5) internal successors, (3087), 6 states have internal predecessors, (3087), 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 15:13:49,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:13:49,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 513 of 625 [2024-11-13 15:13:49,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:13:52,909 INFO L124 PetriNetUnfolderBase]: 2257/12449 cut-off events. [2024-11-13 15:13:52,910 INFO L125 PetriNetUnfolderBase]: For 179/179 co-relation queries the response was YES. [2024-11-13 15:13:52,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15402 conditions, 12449 events. 2257/12449 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 144560 event pairs, 1520 based on Foata normal form. 0/9811 useless extension candidates. Maximal degree in co-relation 15353. Up to 2844 conditions per place. [2024-11-13 15:13:53,055 INFO L140 encePairwiseOnDemand]: 607/625 looper letters, 78 selfloop transitions, 15 changer transitions 0/564 dead transitions. [2024-11-13 15:13:53,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 564 transitions, 1322 flow [2024-11-13 15:13:53,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:13:53,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 15:13:53,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3174 transitions. [2024-11-13 15:13:53,065 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8464 [2024-11-13 15:13:53,065 INFO L175 Difference]: Start difference. First operand has 557 places, 567 transitions, 1142 flow. Second operand 6 states and 3174 transitions. [2024-11-13 15:13:53,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 564 transitions, 1322 flow [2024-11-13 15:13:53,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 564 transitions, 1321 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 15:13:53,076 INFO L231 Difference]: Finished difference. Result has 558 places, 564 transitions, 1165 flow [2024-11-13 15:13:53,077 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1135, PETRI_DIFFERENCE_MINUEND_PLACES=553, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1165, PETRI_PLACES=558, PETRI_TRANSITIONS=564} [2024-11-13 15:13:53,078 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -19 predicate places. [2024-11-13 15:13:53,078 INFO L471 AbstractCegarLoop]: Abstraction has has 558 places, 564 transitions, 1165 flow [2024-11-13 15:13:53,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 514.5) internal successors, (3087), 6 states have internal predecessors, (3087), 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 15:13:53,080 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:13:53,081 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] [2024-11-13 15:13:53,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 15:13:53,081 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-13 15:13:53,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:13:53,082 INFO L85 PathProgramCache]: Analyzing trace with hash -720678912, now seen corresponding path program 1 times [2024-11-13 15:13:53,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:13:53,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760567110] [2024-11-13 15:13:53,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:13:53,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:13:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:13:53,133 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 15:13:53,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:13:53,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760567110] [2024-11-13 15:13:53,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760567110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:13:53,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:13:53,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:13:53,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872928962] [2024-11-13 15:13:53,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:13:53,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:13:53,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:13:53,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:13:53,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:13:53,174 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 625 [2024-11-13 15:13:53,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 564 transitions, 1165 flow. Second operand has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 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 15:13:53,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:13:53,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 625 [2024-11-13 15:13:53,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:13:53,318 INFO L124 PetriNetUnfolderBase]: 27/710 cut-off events. [2024-11-13 15:13:53,318 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-13 15:13:53,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 710 events. 27/710 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2157 event pairs, 5 based on Foata normal form. 0/599 useless extension candidates. Maximal degree in co-relation 711. Up to 24 conditions per place. [2024-11-13 15:13:53,327 INFO L140 encePairwiseOnDemand]: 622/625 looper letters, 13 selfloop transitions, 2 changer transitions 0/563 dead transitions. [2024-11-13 15:13:53,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 563 transitions, 1193 flow [2024-11-13 15:13:53,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:13:53,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:13:53,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1792 transitions. [2024-11-13 15:13:53,332 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9557333333333333 [2024-11-13 15:13:53,332 INFO L175 Difference]: Start difference. First operand has 558 places, 564 transitions, 1165 flow. Second operand 3 states and 1792 transitions. [2024-11-13 15:13:53,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 563 transitions, 1193 flow [2024-11-13 15:13:53,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 563 transitions, 1163 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-13 15:13:53,344 INFO L231 Difference]: Finished difference. Result has 554 places, 563 transitions, 1137 flow [2024-11-13 15:13:53,345 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1133, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1137, PETRI_PLACES=554, PETRI_TRANSITIONS=563} [2024-11-13 15:13:53,346 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -23 predicate places. [2024-11-13 15:13:53,346 INFO L471 AbstractCegarLoop]: Abstraction has has 554 places, 563 transitions, 1137 flow [2024-11-13 15:13:53,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 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 15:13:53,348 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:13:53,348 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] [2024-11-13 15:13:53,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 15:13:53,348 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-13 15:13:53,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:13:53,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1060730949, now seen corresponding path program 1 times [2024-11-13 15:13:53,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:13:53,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414215073] [2024-11-13 15:13:53,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:13:53,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:13:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:13:53,415 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 15:13:53,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:13:53,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414215073] [2024-11-13 15:13:53,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414215073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:13:53,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:13:53,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:13:53,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782130204] [2024-11-13 15:13:53,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:13:53,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:13:53,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:13:53,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:13:53,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:13:53,453 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 587 out of 625 [2024-11-13 15:13:53,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 563 transitions, 1137 flow. Second operand has 3 states, 3 states have (on average 588.0) internal successors, (1764), 3 states have internal predecessors, (1764), 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 15:13:53,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:13:53,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 587 of 625 [2024-11-13 15:13:53,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:13:53,838 INFO L124 PetriNetUnfolderBase]: 74/1297 cut-off events. [2024-11-13 15:13:53,838 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-13 15:13:53,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1383 conditions, 1297 events. 74/1297 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 7142 event pairs, 20 based on Foata normal form. 0/1063 useless extension candidates. Maximal degree in co-relation 1333. Up to 66 conditions per place. [2024-11-13 15:13:53,856 INFO L140 encePairwiseOnDemand]: 619/625 looper letters, 16 selfloop transitions, 1 changer transitions 0/558 dead transitions. [2024-11-13 15:13:53,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 558 transitions, 1161 flow [2024-11-13 15:13:53,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:13:53,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:13:53,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1783 transitions. [2024-11-13 15:13:53,861 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9509333333333333 [2024-11-13 15:13:53,862 INFO L175 Difference]: Start difference. First operand has 554 places, 563 transitions, 1137 flow. Second operand 3 states and 1783 transitions. [2024-11-13 15:13:53,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 558 transitions, 1161 flow [2024-11-13 15:13:53,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 558 transitions, 1157 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 15:13:53,874 INFO L231 Difference]: Finished difference. Result has 549 places, 558 transitions, 1125 flow [2024-11-13 15:13:53,875 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1125, PETRI_PLACES=549, PETRI_TRANSITIONS=558} [2024-11-13 15:13:53,876 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -28 predicate places. [2024-11-13 15:13:53,876 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 558 transitions, 1125 flow [2024-11-13 15:13:53,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 588.0) internal successors, (1764), 3 states have internal predecessors, (1764), 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 15:13:53,878 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:13:53,878 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] [2024-11-13 15:13:53,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 15:13:53,878 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-13 15:13:53,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:13:53,879 INFO L85 PathProgramCache]: Analyzing trace with hash 873886866, now seen corresponding path program 1 times [2024-11-13 15:13:53,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:13:53,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236548060] [2024-11-13 15:13:53,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:13:53,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:13:53,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:13:53,984 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 15:13:53,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:13:53,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236548060] [2024-11-13 15:13:53,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236548060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:13:53,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:13:53,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:13:53,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127584311] [2024-11-13 15:13:53,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:13:53,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:13:53,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:13:53,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:13:53,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:13:54,038 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 625 [2024-11-13 15:13:54,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 558 transitions, 1125 flow. Second operand has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 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 15:13:54,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:13:54,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 625 [2024-11-13 15:13:54,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:13:54,221 INFO L124 PetriNetUnfolderBase]: 35/840 cut-off events. [2024-11-13 15:13:54,221 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-13 15:13:54,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 880 conditions, 840 events. 35/840 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3066 event pairs, 7 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 830. Up to 27 conditions per place. [2024-11-13 15:13:54,230 INFO L140 encePairwiseOnDemand]: 622/625 looper letters, 13 selfloop transitions, 2 changer transitions 0/557 dead transitions. [2024-11-13 15:13:54,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 550 places, 557 transitions, 1153 flow [2024-11-13 15:13:54,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:13:54,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:13:54,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1792 transitions. [2024-11-13 15:13:54,235 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9557333333333333 [2024-11-13 15:13:54,235 INFO L175 Difference]: Start difference. First operand has 549 places, 558 transitions, 1125 flow. Second operand 3 states and 1792 transitions. [2024-11-13 15:13:54,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 550 places, 557 transitions, 1153 flow [2024-11-13 15:13:54,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 557 transitions, 1152 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 15:13:54,247 INFO L231 Difference]: Finished difference. Result has 549 places, 557 transitions, 1126 flow [2024-11-13 15:13:54,249 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1122, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1126, PETRI_PLACES=549, PETRI_TRANSITIONS=557} [2024-11-13 15:13:54,250 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -28 predicate places. [2024-11-13 15:13:54,252 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 557 transitions, 1126 flow [2024-11-13 15:13:54,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 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 15:13:54,253 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:13:54,254 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] [2024-11-13 15:13:54,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 15:13:54,254 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-13 15:13:54,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:13:54,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1510226504, now seen corresponding path program 1 times [2024-11-13 15:13:54,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:13:54,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601415699] [2024-11-13 15:13:54,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:13:54,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:13:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:13:54,375 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 15:13:54,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:13:54,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601415699] [2024-11-13 15:13:54,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601415699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:13:54,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:13:54,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:13:54,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800961718] [2024-11-13 15:13:54,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:13:54,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:13:54,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:13:54,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:13:54,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:13:54,418 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 587 out of 625 [2024-11-13 15:13:54,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 557 transitions, 1126 flow. Second operand has 3 states, 3 states have (on average 588.0) internal successors, (1764), 3 states have internal predecessors, (1764), 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 15:13:54,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:13:54,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 587 of 625 [2024-11-13 15:13:54,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:13:54,758 INFO L124 PetriNetUnfolderBase]: 70/1155 cut-off events. [2024-11-13 15:13:54,758 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-13 15:13:54,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1235 conditions, 1155 events. 70/1155 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5634 event pairs, 20 based on Foata normal form. 0/961 useless extension candidates. Maximal degree in co-relation 1185. Up to 67 conditions per place. [2024-11-13 15:13:54,780 INFO L140 encePairwiseOnDemand]: 619/625 looper letters, 16 selfloop transitions, 1 changer transitions 0/552 dead transitions. [2024-11-13 15:13:54,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 552 transitions, 1150 flow [2024-11-13 15:13:54,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:13:54,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:13:54,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1783 transitions. [2024-11-13 15:13:54,787 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9509333333333333 [2024-11-13 15:13:54,787 INFO L175 Difference]: Start difference. First operand has 549 places, 557 transitions, 1126 flow. Second operand 3 states and 1783 transitions. [2024-11-13 15:13:54,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 552 transitions, 1150 flow [2024-11-13 15:13:54,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 552 transitions, 1146 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 15:13:54,803 INFO L231 Difference]: Finished difference. Result has 544 places, 552 transitions, 1114 flow [2024-11-13 15:13:54,804 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1112, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1114, PETRI_PLACES=544, PETRI_TRANSITIONS=552} [2024-11-13 15:13:54,805 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -33 predicate places. [2024-11-13 15:13:54,805 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 552 transitions, 1114 flow [2024-11-13 15:13:54,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 588.0) internal successors, (1764), 3 states have internal predecessors, (1764), 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 15:13:54,807 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:13:54,807 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] [2024-11-13 15:13:54,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 15:13:54,808 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-13 15:13:54,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:13:54,809 INFO L85 PathProgramCache]: Analyzing trace with hash -138613440, now seen corresponding path program 1 times [2024-11-13 15:13:54,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:13:54,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569720294] [2024-11-13 15:13:54,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:13:54,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:13:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:13:54,916 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 15:13:54,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:13:54,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569720294] [2024-11-13 15:13:54,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569720294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:13:54,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:13:54,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:13:54,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110097434] [2024-11-13 15:13:54,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:13:54,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:13:54,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:13:54,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:13:54,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:13:54,958 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 625 [2024-11-13 15:13:54,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 552 transitions, 1114 flow. Second operand has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 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 15:13:54,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:13:54,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 625 [2024-11-13 15:13:54,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:13:55,121 INFO L124 PetriNetUnfolderBase]: 26/629 cut-off events. [2024-11-13 15:13:55,122 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-13 15:13:55,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 629 events. 26/629 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1675 event pairs, 7 based on Foata normal form. 0/544 useless extension candidates. Maximal degree in co-relation 617. Up to 27 conditions per place. [2024-11-13 15:13:55,129 INFO L140 encePairwiseOnDemand]: 622/625 looper letters, 13 selfloop transitions, 2 changer transitions 0/551 dead transitions. [2024-11-13 15:13:55,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 551 transitions, 1142 flow [2024-11-13 15:13:55,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:13:55,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:13:55,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1792 transitions. [2024-11-13 15:13:55,136 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9557333333333333 [2024-11-13 15:13:55,136 INFO L175 Difference]: Start difference. First operand has 544 places, 552 transitions, 1114 flow. Second operand 3 states and 1792 transitions. [2024-11-13 15:13:55,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 551 transitions, 1142 flow [2024-11-13 15:13:55,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 551 transitions, 1141 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 15:13:55,150 INFO L231 Difference]: Finished difference. Result has 544 places, 551 transitions, 1115 flow [2024-11-13 15:13:55,151 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1111, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1115, PETRI_PLACES=544, PETRI_TRANSITIONS=551} [2024-11-13 15:13:55,153 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -33 predicate places. [2024-11-13 15:13:55,153 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 551 transitions, 1115 flow [2024-11-13 15:13:55,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 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 15:13:55,155 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:13:55,155 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] [2024-11-13 15:13:55,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 15:13:55,156 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-13 15:13:55,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:13:55,157 INFO L85 PathProgramCache]: Analyzing trace with hash 614313204, now seen corresponding path program 1 times [2024-11-13 15:13:55,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:13:55,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654839227] [2024-11-13 15:13:55,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:13:55,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:13:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:13:55,273 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 15:13:55,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:13:55,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654839227] [2024-11-13 15:13:55,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654839227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:13:55,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:13:55,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:13:55,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272985818] [2024-11-13 15:13:55,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:13:55,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:13:55,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:13:55,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:13:55,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:13:55,318 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 625 [2024-11-13 15:13:55,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 551 transitions, 1115 flow. Second operand has 3 states, 3 states have (on average 576.0) internal successors, (1728), 3 states have internal predecessors, (1728), 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 15:13:55,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:13:55,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 625 [2024-11-13 15:13:55,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:13:55,470 INFO L124 PetriNetUnfolderBase]: 44/682 cut-off events. [2024-11-13 15:13:55,470 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-13 15:13:55,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 682 events. 44/682 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2090 event pairs, 2 based on Foata normal form. 0/604 useless extension candidates. Maximal degree in co-relation 737. Up to 63 conditions per place. [2024-11-13 15:13:55,475 INFO L140 encePairwiseOnDemand]: 614/625 looper letters, 25 selfloop transitions, 2 changer transitions 0/544 dead transitions. [2024-11-13 15:13:55,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 544 transitions, 1157 flow [2024-11-13 15:13:55,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:13:55,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:13:55,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1761 transitions. [2024-11-13 15:13:55,480 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9392 [2024-11-13 15:13:55,480 INFO L175 Difference]: Start difference. First operand has 544 places, 551 transitions, 1115 flow. Second operand 3 states and 1761 transitions. [2024-11-13 15:13:55,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 544 transitions, 1157 flow [2024-11-13 15:13:55,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 535 places, 544 transitions, 1153 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 15:13:55,489 INFO L231 Difference]: Finished difference. Result has 535 places, 542 transitions, 1097 flow [2024-11-13 15:13:55,493 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1093, PETRI_DIFFERENCE_MINUEND_PLACES=533, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1097, PETRI_PLACES=535, PETRI_TRANSITIONS=542} [2024-11-13 15:13:55,494 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -42 predicate places. [2024-11-13 15:13:55,495 INFO L471 AbstractCegarLoop]: Abstraction has has 535 places, 542 transitions, 1097 flow [2024-11-13 15:13:55,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 576.0) internal successors, (1728), 3 states have internal predecessors, (1728), 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 15:13:55,496 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:13:55,497 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] [2024-11-13 15:13:55,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 15:13:55,497 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-13 15:13:55,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:13:55,498 INFO L85 PathProgramCache]: Analyzing trace with hash -2035129298, now seen corresponding path program 1 times [2024-11-13 15:13:55,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:13:55,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629870039] [2024-11-13 15:13:55,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:13:55,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:13:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:13:55,589 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 15:13:55,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:13:55,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629870039] [2024-11-13 15:13:55,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629870039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:13:55,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:13:55,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:13:55,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538935433] [2024-11-13 15:13:55,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:13:55,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:13:55,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:13:55,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:13:55,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:13:55,637 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 625 [2024-11-13 15:13:55,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 542 transitions, 1097 flow. Second operand has 3 states, 3 states have (on average 576.3333333333334) internal successors, (1729), 3 states have internal predecessors, (1729), 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 15:13:55,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:13:55,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 625 [2024-11-13 15:13:55,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:13:55,805 INFO L124 PetriNetUnfolderBase]: 47/735 cut-off events. [2024-11-13 15:13:55,805 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-13 15:13:55,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 735 events. 47/735 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2568 event pairs, 18 based on Foata normal form. 0/654 useless extension candidates. Maximal degree in co-relation 779. Up to 62 conditions per place. [2024-11-13 15:13:55,812 INFO L140 encePairwiseOnDemand]: 614/625 looper letters, 25 selfloop transitions, 2 changer transitions 0/535 dead transitions. [2024-11-13 15:13:55,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 535 transitions, 1139 flow [2024-11-13 15:13:55,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:13:55,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:13:55,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1761 transitions. [2024-11-13 15:13:55,817 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9392 [2024-11-13 15:13:55,817 INFO L175 Difference]: Start difference. First operand has 535 places, 542 transitions, 1097 flow. Second operand 3 states and 1761 transitions. [2024-11-13 15:13:55,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 535 transitions, 1139 flow [2024-11-13 15:13:55,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 535 transitions, 1135 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 15:13:55,890 INFO L231 Difference]: Finished difference. Result has 526 places, 533 transitions, 1079 flow [2024-11-13 15:13:55,891 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1075, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1079, PETRI_PLACES=526, PETRI_TRANSITIONS=533} [2024-11-13 15:13:55,892 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -51 predicate places. [2024-11-13 15:13:55,892 INFO L471 AbstractCegarLoop]: Abstraction has has 526 places, 533 transitions, 1079 flow [2024-11-13 15:13:55,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 576.3333333333334) internal successors, (1729), 3 states have internal predecessors, (1729), 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 15:13:55,893 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:13:55,895 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] [2024-11-13 15:13:55,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 15:13:55,895 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-13 15:13:55,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:13:55,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1106086368, now seen corresponding path program 1 times [2024-11-13 15:13:55,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:13:55,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136918156] [2024-11-13 15:13:55,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:13:55,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:13:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:13:55,974 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 15:13:55,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:13:55,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136918156] [2024-11-13 15:13:55,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136918156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:13:55,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:13:55,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:13:55,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884749452] [2024-11-13 15:13:55,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:13:55,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:13:55,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:13:55,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:13:55,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:13:55,995 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 595 out of 625 [2024-11-13 15:13:55,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 533 transitions, 1079 flow. Second operand has 3 states, 3 states have (on average 596.6666666666666) internal successors, (1790), 3 states have internal predecessors, (1790), 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 15:13:55,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:13:55,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 595 of 625 [2024-11-13 15:13:55,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:13:56,160 INFO L124 PetriNetUnfolderBase]: 44/800 cut-off events. [2024-11-13 15:13:56,160 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-13 15:13:56,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 880 conditions, 800 events. 44/800 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2848 event pairs, 12 based on Foata normal form. 0/709 useless extension candidates. Maximal degree in co-relation 831. Up to 39 conditions per place. [2024-11-13 15:13:56,169 INFO L140 encePairwiseOnDemand]: 621/625 looper letters, 14 selfloop transitions, 3 changer transitions 0/536 dead transitions. [2024-11-13 15:13:56,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 536 transitions, 1121 flow [2024-11-13 15:13:56,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:13:56,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:13:56,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1803 transitions. [2024-11-13 15:13:56,174 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9616 [2024-11-13 15:13:56,174 INFO L175 Difference]: Start difference. First operand has 526 places, 533 transitions, 1079 flow. Second operand 3 states and 1803 transitions. [2024-11-13 15:13:56,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 536 transitions, 1121 flow [2024-11-13 15:13:56,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 536 transitions, 1117 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 15:13:56,188 INFO L231 Difference]: Finished difference. Result has 528 places, 534 transitions, 1093 flow [2024-11-13 15:13:56,189 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1075, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1093, PETRI_PLACES=528, PETRI_TRANSITIONS=534} [2024-11-13 15:13:56,190 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -49 predicate places. [2024-11-13 15:13:56,191 INFO L471 AbstractCegarLoop]: Abstraction has has 528 places, 534 transitions, 1093 flow [2024-11-13 15:13:56,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 596.6666666666666) internal successors, (1790), 3 states have internal predecessors, (1790), 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 15:13:56,192 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:13:56,192 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] [2024-11-13 15:13:56,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 15:13:56,193 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-13 15:13:56,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:13:56,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1540490672, now seen corresponding path program 1 times [2024-11-13 15:13:56,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:13:56,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707011729] [2024-11-13 15:13:56,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:13:56,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:13:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:13:56,293 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 15:13:56,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:13:56,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707011729] [2024-11-13 15:13:56,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707011729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:13:56,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:13:56,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:13:56,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557537337] [2024-11-13 15:13:56,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:13:56,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:13:56,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:13:56,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:13:56,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:13:56,352 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 625 [2024-11-13 15:13:56,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 534 transitions, 1093 flow. Second operand has 3 states, 3 states have (on average 576.6666666666666) internal successors, (1730), 3 states have internal predecessors, (1730), 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 15:13:56,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:13:56,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 625 [2024-11-13 15:13:56,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:13:56,514 INFO L124 PetriNetUnfolderBase]: 44/665 cut-off events. [2024-11-13 15:13:56,514 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-13 15:13:56,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 754 conditions, 665 events. 44/665 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2179 event pairs, 2 based on Foata normal form. 0/609 useless extension candidates. Maximal degree in co-relation 704. Up to 61 conditions per place. [2024-11-13 15:13:56,521 INFO L140 encePairwiseOnDemand]: 614/625 looper letters, 25 selfloop transitions, 2 changer transitions 0/527 dead transitions. [2024-11-13 15:13:56,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 527 transitions, 1135 flow [2024-11-13 15:13:56,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:13:56,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:13:56,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1761 transitions. [2024-11-13 15:13:56,526 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9392 [2024-11-13 15:13:56,527 INFO L175 Difference]: Start difference. First operand has 528 places, 534 transitions, 1093 flow. Second operand 3 states and 1761 transitions. [2024-11-13 15:13:56,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 527 transitions, 1135 flow [2024-11-13 15:13:56,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 527 transitions, 1129 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 15:13:56,537 INFO L231 Difference]: Finished difference. Result has 519 places, 525 transitions, 1073 flow [2024-11-13 15:13:56,539 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1069, PETRI_DIFFERENCE_MINUEND_PLACES=517, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1073, PETRI_PLACES=519, PETRI_TRANSITIONS=525} [2024-11-13 15:13:56,540 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -58 predicate places. [2024-11-13 15:13:56,541 INFO L471 AbstractCegarLoop]: Abstraction has has 519 places, 525 transitions, 1073 flow [2024-11-13 15:13:56,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 576.6666666666666) internal successors, (1730), 3 states have internal predecessors, (1730), 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 15:13:56,542 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:13:56,542 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] [2024-11-13 15:13:56,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 15:13:56,543 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-13 15:13:56,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:13:56,543 INFO L85 PathProgramCache]: Analyzing trace with hash -58446936, now seen corresponding path program 1 times [2024-11-13 15:13:56,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:13:56,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122823165] [2024-11-13 15:13:56,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:13:56,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:13:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:13:56,648 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 15:13:56,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:13:56,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122823165] [2024-11-13 15:13:56,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122823165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:13:56,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:13:56,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:13:56,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313301867] [2024-11-13 15:13:56,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:13:56,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:13:56,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:13:56,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:13:56,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:13:56,678 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 590 out of 625 [2024-11-13 15:13:56,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 519 places, 525 transitions, 1073 flow. Second operand has 3 states, 3 states have (on average 591.3333333333334) internal successors, (1774), 3 states have internal predecessors, (1774), 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 15:13:56,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:13:56,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 590 of 625 [2024-11-13 15:13:56,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:13:56,910 INFO L124 PetriNetUnfolderBase]: 62/1077 cut-off events. [2024-11-13 15:13:56,910 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-13 15:13:56,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 1077 events. 62/1077 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4730 event pairs, 2 based on Foata normal form. 0/979 useless extension candidates. Maximal degree in co-relation 1136. Up to 52 conditions per place. [2024-11-13 15:13:56,922 INFO L140 encePairwiseOnDemand]: 617/625 looper letters, 20 selfloop transitions, 4 changer transitions 0/530 dead transitions. [2024-11-13 15:13:56,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 530 transitions, 1136 flow [2024-11-13 15:13:56,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:13:56,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:13:56,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1798 transitions. [2024-11-13 15:13:56,927 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9589333333333333 [2024-11-13 15:13:56,927 INFO L175 Difference]: Start difference. First operand has 519 places, 525 transitions, 1073 flow. Second operand 3 states and 1798 transitions. [2024-11-13 15:13:56,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 530 transitions, 1136 flow [2024-11-13 15:13:56,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 530 transitions, 1132 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 15:13:56,937 INFO L231 Difference]: Finished difference. Result has 516 places, 525 transitions, 1089 flow [2024-11-13 15:13:56,938 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1061, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1089, PETRI_PLACES=516, PETRI_TRANSITIONS=525} [2024-11-13 15:13:56,939 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -61 predicate places. [2024-11-13 15:13:56,939 INFO L471 AbstractCegarLoop]: Abstraction has has 516 places, 525 transitions, 1089 flow [2024-11-13 15:13:56,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 591.3333333333334) internal successors, (1774), 3 states have internal predecessors, (1774), 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 15:13:56,940 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:13:56,940 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] [2024-11-13 15:13:56,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 15:13:56,941 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-13 15:13:56,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:13:56,941 INFO L85 PathProgramCache]: Analyzing trace with hash -850008870, now seen corresponding path program 1 times [2024-11-13 15:13:56,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:13:56,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247400854] [2024-11-13 15:13:56,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:13:56,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:13:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:13:57,018 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 15:13:57,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:13:57,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247400854] [2024-11-13 15:13:57,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247400854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:13:57,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:13:57,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:13:57,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548699712] [2024-11-13 15:13:57,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:13:57,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:13:57,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:13:57,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:13:57,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:13:57,039 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 595 out of 625 [2024-11-13 15:13:57,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 525 transitions, 1089 flow. Second operand has 3 states, 3 states have (on average 597.0) internal successors, (1791), 3 states have internal predecessors, (1791), 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 15:13:57,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:13:57,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 595 of 625 [2024-11-13 15:13:57,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:13:57,274 INFO L124 PetriNetUnfolderBase]: 63/919 cut-off events. [2024-11-13 15:13:57,275 INFO L125 PetriNetUnfolderBase]: For 21/49 co-relation queries the response was YES. [2024-11-13 15:13:57,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 919 events. 63/919 cut-off events. For 21/49 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3835 event pairs, 18 based on Foata normal form. 1/832 useless extension candidates. Maximal degree in co-relation 987. Up to 57 conditions per place. [2024-11-13 15:13:57,288 INFO L140 encePairwiseOnDemand]: 621/625 looper letters, 14 selfloop transitions, 3 changer transitions 0/528 dead transitions. [2024-11-13 15:13:57,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 528 transitions, 1131 flow [2024-11-13 15:13:57,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:13:57,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:13:57,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1803 transitions. [2024-11-13 15:13:57,294 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9616 [2024-11-13 15:13:57,294 INFO L175 Difference]: Start difference. First operand has 516 places, 525 transitions, 1089 flow. Second operand 3 states and 1803 transitions. [2024-11-13 15:13:57,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 528 transitions, 1131 flow [2024-11-13 15:13:57,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 518 places, 528 transitions, 1131 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 15:13:57,304 INFO L231 Difference]: Finished difference. Result has 520 places, 526 transitions, 1107 flow [2024-11-13 15:13:57,305 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1089, PETRI_DIFFERENCE_MINUEND_PLACES=516, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1107, PETRI_PLACES=520, PETRI_TRANSITIONS=526} [2024-11-13 15:13:57,306 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -57 predicate places. [2024-11-13 15:13:57,306 INFO L471 AbstractCegarLoop]: Abstraction has has 520 places, 526 transitions, 1107 flow [2024-11-13 15:13:57,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 597.0) internal successors, (1791), 3 states have internal predecessors, (1791), 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 15:13:57,308 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:13:57,309 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] [2024-11-13 15:13:57,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 15:13:57,309 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-13 15:13:57,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:13:57,309 INFO L85 PathProgramCache]: Analyzing trace with hash -177569615, now seen corresponding path program 1 times [2024-11-13 15:13:57,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:13:57,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209294207] [2024-11-13 15:13:57,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:13:57,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:13:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:13:57,420 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 15:13:57,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:13:57,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209294207] [2024-11-13 15:13:57,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209294207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:13:57,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:13:57,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:13:57,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543066166] [2024-11-13 15:13:57,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:13:57,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:13:57,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:13:57,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:13:57,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:13:57,450 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 590 out of 625 [2024-11-13 15:13:57,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 526 transitions, 1107 flow. Second operand has 3 states, 3 states have (on average 591.6666666666666) internal successors, (1775), 3 states have internal predecessors, (1775), 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 15:13:57,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:13:57,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 590 of 625 [2024-11-13 15:13:57,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:13:57,968 INFO L124 PetriNetUnfolderBase]: 107/1690 cut-off events. [2024-11-13 15:13:57,968 INFO L125 PetriNetUnfolderBase]: For 21/29 co-relation queries the response was YES. [2024-11-13 15:13:57,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1920 conditions, 1690 events. 107/1690 cut-off events. For 21/29 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 9725 event pairs, 8 based on Foata normal form. 1/1548 useless extension candidates. Maximal degree in co-relation 1868. Up to 76 conditions per place. [2024-11-13 15:13:57,983 INFO L140 encePairwiseOnDemand]: 617/625 looper letters, 20 selfloop transitions, 4 changer transitions 0/531 dead transitions. [2024-11-13 15:13:57,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 531 transitions, 1170 flow [2024-11-13 15:13:57,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:13:57,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:13:57,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1798 transitions. [2024-11-13 15:13:57,987 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9589333333333333 [2024-11-13 15:13:57,987 INFO L175 Difference]: Start difference. First operand has 520 places, 526 transitions, 1107 flow. Second operand 3 states and 1798 transitions. [2024-11-13 15:13:57,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 531 transitions, 1170 flow [2024-11-13 15:13:57,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 531 transitions, 1164 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 15:13:57,997 INFO L231 Difference]: Finished difference. Result has 517 places, 526 transitions, 1121 flow [2024-11-13 15:13:57,997 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1093, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=518, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1121, PETRI_PLACES=517, PETRI_TRANSITIONS=526} [2024-11-13 15:13:57,998 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -60 predicate places. [2024-11-13 15:13:57,998 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 526 transitions, 1121 flow [2024-11-13 15:13:58,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 591.6666666666666) internal successors, (1775), 3 states have internal predecessors, (1775), 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 15:13:58,003 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:13:58,003 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 15:13:58,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 15:13:58,003 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-13 15:13:58,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:13:58,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1585332530, now seen corresponding path program 1 times [2024-11-13 15:13:58,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:13:58,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083648134] [2024-11-13 15:13:58,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:13:58,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:13:58,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:13:58,490 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 15:13:58,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:13:58,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083648134] [2024-11-13 15:13:58,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083648134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:13:58,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:13:58,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 15:13:58,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533865067] [2024-11-13 15:13:58,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:13:58,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:13:58,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:13:58,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:13:58,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:13:59,762 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 625 [2024-11-13 15:13:59,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 526 transitions, 1121 flow. Second operand has 8 states, 8 states have (on average 568.125) internal successors, (4545), 8 states have internal predecessors, (4545), 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 15:13:59,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:13:59,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 625 [2024-11-13 15:13:59,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:14:00,667 INFO L124 PetriNetUnfolderBase]: 177/2658 cut-off events. [2024-11-13 15:14:00,667 INFO L125 PetriNetUnfolderBase]: For 17/48 co-relation queries the response was YES. [2024-11-13 15:14:00,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3205 conditions, 2658 events. 177/2658 cut-off events. For 17/48 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 17421 event pairs, 14 based on Foata normal form. 5/2465 useless extension candidates. Maximal degree in co-relation 3150. Up to 115 conditions per place. [2024-11-13 15:14:00,699 INFO L140 encePairwiseOnDemand]: 608/625 looper letters, 79 selfloop transitions, 19 changer transitions 0/578 dead transitions. [2024-11-13 15:14:00,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 578 transitions, 1452 flow [2024-11-13 15:14:00,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:14:00,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-13 15:14:00,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6866 transitions. [2024-11-13 15:14:00,716 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9154666666666667 [2024-11-13 15:14:00,716 INFO L175 Difference]: Start difference. First operand has 517 places, 526 transitions, 1121 flow. Second operand 12 states and 6866 transitions. [2024-11-13 15:14:00,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 578 transitions, 1452 flow [2024-11-13 15:14:00,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 578 transitions, 1452 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 15:14:00,730 INFO L231 Difference]: Finished difference. Result has 533 places, 537 transitions, 1228 flow [2024-11-13 15:14:00,731 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=517, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1228, PETRI_PLACES=533, PETRI_TRANSITIONS=537} [2024-11-13 15:14:00,732 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -44 predicate places. [2024-11-13 15:14:00,732 INFO L471 AbstractCegarLoop]: Abstraction has has 533 places, 537 transitions, 1228 flow [2024-11-13 15:14:00,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 568.125) internal successors, (4545), 8 states have internal predecessors, (4545), 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 15:14:00,734 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:14:00,736 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, 1, 1] [2024-11-13 15:14:00,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 15:14:00,736 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-13 15:14:00,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:14:00,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1040217001, now seen corresponding path program 1 times [2024-11-13 15:14:00,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:14:00,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112028341] [2024-11-13 15:14:00,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:14:00,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:14:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:14:01,172 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 15:14:01,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:14:01,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112028341] [2024-11-13 15:14:01,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112028341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:14:01,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:14:01,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 15:14:01,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719992330] [2024-11-13 15:14:01,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:14:01,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:14:01,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:14:01,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:14:01,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:14:02,316 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 625 [2024-11-13 15:14:02,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 533 places, 537 transitions, 1228 flow. Second operand has 8 states, 8 states have (on average 568.25) internal successors, (4546), 8 states have internal predecessors, (4546), 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 15:14:02,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:14:02,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 625 [2024-11-13 15:14:02,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:14:03,885 INFO L124 PetriNetUnfolderBase]: 396/5290 cut-off events. [2024-11-13 15:14:03,885 INFO L125 PetriNetUnfolderBase]: For 214/302 co-relation queries the response was YES. [2024-11-13 15:14:03,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6466 conditions, 5290 events. 396/5290 cut-off events. For 214/302 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 47102 event pairs, 62 based on Foata normal form. 14/4853 useless extension candidates. Maximal degree in co-relation 6400. Up to 201 conditions per place. [2024-11-13 15:14:03,954 INFO L140 encePairwiseOnDemand]: 608/625 looper letters, 74 selfloop transitions, 19 changer transitions 0/579 dead transitions. [2024-11-13 15:14:03,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 579 transitions, 1528 flow [2024-11-13 15:14:03,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:14:03,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-13 15:14:03,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6856 transitions. [2024-11-13 15:14:03,968 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9141333333333334 [2024-11-13 15:14:03,968 INFO L175 Difference]: Start difference. First operand has 533 places, 537 transitions, 1228 flow. Second operand 12 states and 6856 transitions. [2024-11-13 15:14:03,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 579 transitions, 1528 flow [2024-11-13 15:14:03,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 579 transitions, 1528 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 15:14:03,985 INFO L231 Difference]: Finished difference. Result has 549 places, 548 transitions, 1335 flow [2024-11-13 15:14:03,985 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1228, PETRI_DIFFERENCE_MINUEND_PLACES=533, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1335, PETRI_PLACES=549, PETRI_TRANSITIONS=548} [2024-11-13 15:14:03,986 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -28 predicate places. [2024-11-13 15:14:03,986 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 548 transitions, 1335 flow [2024-11-13 15:14:03,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 568.25) internal successors, (4546), 8 states have internal predecessors, (4546), 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 15:14:03,988 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:14:03,988 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, 1, 1, 1] [2024-11-13 15:14:03,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 15:14:03,988 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-13 15:14:03,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:14:03,989 INFO L85 PathProgramCache]: Analyzing trace with hash -922961918, now seen corresponding path program 1 times [2024-11-13 15:14:03,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:14:03,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312627695] [2024-11-13 15:14:03,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:14:03,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:14:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:14:04,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:14:04,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:14:04,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312627695] [2024-11-13 15:14:04,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312627695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:14:04,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:14:04,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:14:04,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66465797] [2024-11-13 15:14:04,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:14:04,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:14:04,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:14:04,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:14:04,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:14:04,079 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 595 out of 625 [2024-11-13 15:14:04,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 548 transitions, 1335 flow. Second operand has 3 states, 3 states have (on average 597.3333333333334) internal successors, (1792), 3 states have internal predecessors, (1792), 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 15:14:04,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:14:04,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 595 of 625 [2024-11-13 15:14:04,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:14:05,252 INFO L124 PetriNetUnfolderBase]: 618/5400 cut-off events. [2024-11-13 15:14:05,252 INFO L125 PetriNetUnfolderBase]: For 453/585 co-relation queries the response was YES. [2024-11-13 15:14:05,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6776 conditions, 5400 events. 618/5400 cut-off events. For 453/585 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 48507 event pairs, 209 based on Foata normal form. 0/4816 useless extension candidates. Maximal degree in co-relation 6702. Up to 631 conditions per place. [2024-11-13 15:14:05,306 INFO L140 encePairwiseOnDemand]: 621/625 looper letters, 14 selfloop transitions, 3 changer transitions 0/551 dead transitions. [2024-11-13 15:14:05,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 551 transitions, 1377 flow [2024-11-13 15:14:05,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:14:05,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:14:05,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1803 transitions. [2024-11-13 15:14:05,310 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9616 [2024-11-13 15:14:05,310 INFO L175 Difference]: Start difference. First operand has 549 places, 548 transitions, 1335 flow. Second operand 3 states and 1803 transitions. [2024-11-13 15:14:05,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 551 transitions, 1377 flow [2024-11-13 15:14:05,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 551 transitions, 1377 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 15:14:05,320 INFO L231 Difference]: Finished difference. Result has 553 places, 549 transitions, 1353 flow [2024-11-13 15:14:05,321 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1335, PETRI_DIFFERENCE_MINUEND_PLACES=549, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1353, PETRI_PLACES=553, PETRI_TRANSITIONS=549} [2024-11-13 15:14:05,321 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -24 predicate places. [2024-11-13 15:14:05,321 INFO L471 AbstractCegarLoop]: Abstraction has has 553 places, 549 transitions, 1353 flow [2024-11-13 15:14:05,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 597.3333333333334) internal successors, (1792), 3 states have internal predecessors, (1792), 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 15:14:05,322 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:14:05,322 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:14:05,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 15:14:05,322 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-13 15:14:05,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:14:05,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1411044200, now seen corresponding path program 1 times [2024-11-13 15:14:05,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:14:05,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666356521] [2024-11-13 15:14:05,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:14:05,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:14:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:14:05,641 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 15:14:05,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:14:05,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666356521] [2024-11-13 15:14:05,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666356521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:14:05,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:14:05,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 15:14:05,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462158930] [2024-11-13 15:14:05,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:14:05,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:14:05,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:14:05,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:14:05,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:14:06,388 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 625 [2024-11-13 15:14:06,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 549 transitions, 1353 flow. Second operand has 8 states, 8 states have (on average 568.375) internal successors, (4547), 8 states have internal predecessors, (4547), 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 15:14:06,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:14:06,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 625 [2024-11-13 15:14:06,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:14:08,505 INFO L124 PetriNetUnfolderBase]: 663/7300 cut-off events. [2024-11-13 15:14:08,505 INFO L125 PetriNetUnfolderBase]: For 637/745 co-relation queries the response was YES. [2024-11-13 15:14:08,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9268 conditions, 7300 events. 663/7300 cut-off events. For 637/745 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 72934 event pairs, 135 based on Foata normal form. 9/6617 useless extension candidates. Maximal degree in co-relation 9189. Up to 372 conditions per place. [2024-11-13 15:14:08,583 INFO L140 encePairwiseOnDemand]: 608/625 looper letters, 86 selfloop transitions, 22 changer transitions 0/601 dead transitions. [2024-11-13 15:14:08,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 601 transitions, 1748 flow [2024-11-13 15:14:08,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 15:14:08,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-13 15:14:08,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 7431 transitions. [2024-11-13 15:14:08,596 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9145846153846153 [2024-11-13 15:14:08,596 INFO L175 Difference]: Start difference. First operand has 553 places, 549 transitions, 1353 flow. Second operand 13 states and 7431 transitions. [2024-11-13 15:14:08,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 601 transitions, 1748 flow [2024-11-13 15:14:08,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 601 transitions, 1732 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 15:14:08,616 INFO L231 Difference]: Finished difference. Result has 566 places, 556 transitions, 1439 flow [2024-11-13 15:14:08,617 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1347, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1439, PETRI_PLACES=566, PETRI_TRANSITIONS=556} [2024-11-13 15:14:08,618 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -11 predicate places. [2024-11-13 15:14:08,618 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 556 transitions, 1439 flow [2024-11-13 15:14:08,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 568.375) internal successors, (4547), 8 states have internal predecessors, (4547), 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 15:14:08,620 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:14:08,620 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:14:08,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 15:14:08,620 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-13 15:14:08,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:14:08,621 INFO L85 PathProgramCache]: Analyzing trace with hash -2072216435, now seen corresponding path program 1 times [2024-11-13 15:14:08,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:14:08,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884373292] [2024-11-13 15:14:08,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:14:08,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:14:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:14:08,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:14:08,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:14:08,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884373292] [2024-11-13 15:14:08,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884373292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:14:08,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:14:08,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 15:14:08,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631905919] [2024-11-13 15:14:08,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:14:08,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:14:08,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:14:08,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:14:08,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:14:09,728 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 625 [2024-11-13 15:14:09,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 556 transitions, 1439 flow. Second operand has 8 states, 8 states have (on average 568.25) internal successors, (4546), 8 states have internal predecessors, (4546), 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 15:14:09,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:14:09,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 625 [2024-11-13 15:14:09,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:14:11,095 INFO L124 PetriNetUnfolderBase]: 288/5457 cut-off events. [2024-11-13 15:14:11,095 INFO L125 PetriNetUnfolderBase]: For 262/387 co-relation queries the response was YES. [2024-11-13 15:14:11,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6809 conditions, 5457 events. 288/5457 cut-off events. For 262/387 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 44006 event pairs, 37 based on Foata normal form. 13/5095 useless extension candidates. Maximal degree in co-relation 6722. Up to 193 conditions per place. [2024-11-13 15:14:11,142 INFO L140 encePairwiseOnDemand]: 608/625 looper letters, 79 selfloop transitions, 24 changer transitions 0/597 dead transitions. [2024-11-13 15:14:11,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 597 transitions, 1789 flow [2024-11-13 15:14:11,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:14:11,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-13 15:14:11,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6859 transitions. [2024-11-13 15:14:11,152 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9145333333333333 [2024-11-13 15:14:11,152 INFO L175 Difference]: Start difference. First operand has 566 places, 556 transitions, 1439 flow. Second operand 12 states and 6859 transitions. [2024-11-13 15:14:11,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 597 transitions, 1789 flow [2024-11-13 15:14:11,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 597 transitions, 1772 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-13 15:14:11,168 INFO L231 Difference]: Finished difference. Result has 574 places, 563 transitions, 1545 flow [2024-11-13 15:14:11,169 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1422, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1545, PETRI_PLACES=574, PETRI_TRANSITIONS=563} [2024-11-13 15:14:11,169 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -3 predicate places. [2024-11-13 15:14:11,169 INFO L471 AbstractCegarLoop]: Abstraction has has 574 places, 563 transitions, 1545 flow [2024-11-13 15:14:11,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 568.25) internal successors, (4546), 8 states have internal predecessors, (4546), 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 15:14:11,171 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:14:11,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:14:11,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 15:14:11,171 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-13 15:14:11,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:14:11,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1511555494, now seen corresponding path program 1 times [2024-11-13 15:14:11,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:14:11,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064063068] [2024-11-13 15:14:11,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:14:11,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:14:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:14:11,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:14:11,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:14:11,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064063068] [2024-11-13 15:14:11,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064063068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:14:11,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:14:11,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 15:14:11,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685938732] [2024-11-13 15:14:11,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:14:11,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:14:11,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:14:11,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:14:11,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:14:12,264 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 625 [2024-11-13 15:14:12,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 563 transitions, 1545 flow. Second operand has 8 states, 8 states have (on average 568.375) internal successors, (4547), 8 states have internal predecessors, (4547), 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 15:14:12,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:14:12,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 625 [2024-11-13 15:14:12,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:14:14,587 INFO L124 PetriNetUnfolderBase]: 611/8988 cut-off events. [2024-11-13 15:14:14,587 INFO L125 PetriNetUnfolderBase]: For 811/985 co-relation queries the response was YES. [2024-11-13 15:14:14,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11486 conditions, 8988 events. 611/8988 cut-off events. For 811/985 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 89516 event pairs, 119 based on Foata normal form. 22/8299 useless extension candidates. Maximal degree in co-relation 11390. Up to 264 conditions per place. [2024-11-13 15:14:14,633 INFO L140 encePairwiseOnDemand]: 608/625 looper letters, 73 selfloop transitions, 27 changer transitions 0/601 dead transitions. [2024-11-13 15:14:14,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 601 transitions, 1884 flow [2024-11-13 15:14:14,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 15:14:14,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-13 15:14:14,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 7416 transitions. [2024-11-13 15:14:14,639 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9127384615384615 [2024-11-13 15:14:14,639 INFO L175 Difference]: Start difference. First operand has 574 places, 563 transitions, 1545 flow. Second operand 13 states and 7416 transitions. [2024-11-13 15:14:14,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 601 transitions, 1884 flow [2024-11-13 15:14:14,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 601 transitions, 1867 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-13 15:14:14,653 INFO L231 Difference]: Finished difference. Result has 585 places, 575 transitions, 1676 flow [2024-11-13 15:14:14,654 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1528, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=543, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1676, PETRI_PLACES=585, PETRI_TRANSITIONS=575} [2024-11-13 15:14:14,655 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 8 predicate places. [2024-11-13 15:14:14,655 INFO L471 AbstractCegarLoop]: Abstraction has has 585 places, 575 transitions, 1676 flow [2024-11-13 15:14:14,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 568.375) internal successors, (4547), 8 states have internal predecessors, (4547), 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 15:14:14,657 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:14:14,657 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, 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 15:14:14,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 15:14:14,657 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-13 15:14:14,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:14:14,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1754381353, now seen corresponding path program 1 times [2024-11-13 15:14:14,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:14:14,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068835584] [2024-11-13 15:14:14,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:14:14,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:14:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:14:14,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:14:14,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:14:14,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068835584] [2024-11-13 15:14:14,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068835584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:14:14,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:14:14,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 15:14:14,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950187735] [2024-11-13 15:14:14,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:14:14,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:14:14,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:14:14,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:14:14,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:14:15,708 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 625 [2024-11-13 15:14:15,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 585 places, 575 transitions, 1676 flow. Second operand has 8 states, 8 states have (on average 568.5) internal successors, (4548), 8 states have internal predecessors, (4548), 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 15:14:15,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:14:15,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 625 [2024-11-13 15:14:15,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:14:17,548 INFO L124 PetriNetUnfolderBase]: 659/8213 cut-off events. [2024-11-13 15:14:17,548 INFO L125 PetriNetUnfolderBase]: For 1123/1229 co-relation queries the response was YES. [2024-11-13 15:14:17,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10829 conditions, 8213 events. 659/8213 cut-off events. For 1123/1229 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 82146 event pairs, 147 based on Foata normal form. 11/7526 useless extension candidates. Maximal degree in co-relation 10722. Up to 389 conditions per place. [2024-11-13 15:14:17,606 INFO L140 encePairwiseOnDemand]: 608/625 looper letters, 73 selfloop transitions, 24 changer transitions 0/604 dead transitions. [2024-11-13 15:14:17,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 596 places, 604 transitions, 1984 flow [2024-11-13 15:14:17,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:14:17,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-13 15:14:17,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6848 transitions. [2024-11-13 15:14:17,611 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9130666666666667 [2024-11-13 15:14:17,611 INFO L175 Difference]: Start difference. First operand has 585 places, 575 transitions, 1676 flow. Second operand 12 states and 6848 transitions. [2024-11-13 15:14:17,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 596 places, 604 transitions, 1984 flow [2024-11-13 15:14:17,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 595 places, 604 transitions, 1980 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-13 15:14:17,623 INFO L231 Difference]: Finished difference. Result has 598 places, 581 transitions, 1787 flow [2024-11-13 15:14:17,623 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1672, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1787, PETRI_PLACES=598, PETRI_TRANSITIONS=581} [2024-11-13 15:14:17,624 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 21 predicate places. [2024-11-13 15:14:17,624 INFO L471 AbstractCegarLoop]: Abstraction has has 598 places, 581 transitions, 1787 flow [2024-11-13 15:14:17,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 568.5) internal successors, (4548), 8 states have internal predecessors, (4548), 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 15:14:17,625 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:14:17,625 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, 1, 1, 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 15:14:17,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-13 15:14:17,626 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-13 15:14:17,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:14:17,626 INFO L85 PathProgramCache]: Analyzing trace with hash -853255310, now seen corresponding path program 1 times [2024-11-13 15:14:17,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:14:17,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122570211] [2024-11-13 15:14:17,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:14:17,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:14:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:14:18,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:14:18,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:14:18,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122570211] [2024-11-13 15:14:18,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122570211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:14:18,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:14:18,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:14:18,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232348207] [2024-11-13 15:14:18,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:14:18,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:14:18,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:14:18,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:14:18,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:14:19,347 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 625 [2024-11-13 15:14:19,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 581 transitions, 1787 flow. Second operand has 6 states, 6 states have (on average 577.8333333333334) internal successors, (3467), 6 states have internal predecessors, (3467), 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 15:14:19,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:14:19,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 625 [2024-11-13 15:14:19,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:14:21,941 INFO L124 PetriNetUnfolderBase]: 307/8437 cut-off events. [2024-11-13 15:14:21,941 INFO L125 PetriNetUnfolderBase]: For 654/727 co-relation queries the response was YES. [2024-11-13 15:14:22,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10321 conditions, 8437 events. 307/8437 cut-off events. For 654/727 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 76531 event pairs, 16 based on Foata normal form. 20/7889 useless extension candidates. Maximal degree in co-relation 10207. Up to 177 conditions per place. [2024-11-13 15:14:22,021 INFO L140 encePairwiseOnDemand]: 614/625 looper letters, 38 selfloop transitions, 10 changer transitions 0/594 dead transitions. [2024-11-13 15:14:22,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 594 transitions, 1920 flow [2024-11-13 15:14:22,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:14:22,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 15:14:22,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3499 transitions. [2024-11-13 15:14:22,025 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9330666666666667 [2024-11-13 15:14:22,025 INFO L175 Difference]: Start difference. First operand has 598 places, 581 transitions, 1787 flow. Second operand 6 states and 3499 transitions. [2024-11-13 15:14:22,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 594 transitions, 1920 flow [2024-11-13 15:14:22,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 594 places, 594 transitions, 1901 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-13 15:14:22,038 INFO L231 Difference]: Finished difference. Result has 598 places, 583 transitions, 1816 flow [2024-11-13 15:14:22,039 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1764, PETRI_DIFFERENCE_MINUEND_PLACES=589, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1816, PETRI_PLACES=598, PETRI_TRANSITIONS=583} [2024-11-13 15:14:22,039 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 21 predicate places. [2024-11-13 15:14:22,039 INFO L471 AbstractCegarLoop]: Abstraction has has 598 places, 583 transitions, 1816 flow [2024-11-13 15:14:22,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 577.8333333333334) internal successors, (3467), 6 states have internal predecessors, (3467), 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 15:14:22,041 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:14:22,041 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:14:22,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-13 15:14:22,041 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-13 15:14:22,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:14:22,042 INFO L85 PathProgramCache]: Analyzing trace with hash 847316169, now seen corresponding path program 1 times [2024-11-13 15:14:22,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:14:22,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538751659] [2024-11-13 15:14:22,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:14:22,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:14:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:14:22,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:14:22,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:14:22,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538751659] [2024-11-13 15:14:22,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538751659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:14:22,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:14:22,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:14:22,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999467344] [2024-11-13 15:14:22,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:14:22,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:14:22,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:14:22,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:14:22,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:14:23,758 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 625 [2024-11-13 15:14:23,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 583 transitions, 1816 flow. Second operand has 6 states, 6 states have (on average 578.0) internal successors, (3468), 6 states have internal predecessors, (3468), 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 15:14:23,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:14:23,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 625 [2024-11-13 15:14:23,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:14:26,570 INFO L124 PetriNetUnfolderBase]: 407/10840 cut-off events. [2024-11-13 15:14:26,570 INFO L125 PetriNetUnfolderBase]: For 723/958 co-relation queries the response was YES. [2024-11-13 15:14:26,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13244 conditions, 10840 events. 407/10840 cut-off events. For 723/958 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 107170 event pairs, 18 based on Foata normal form. 35/10181 useless extension candidates. Maximal degree in co-relation 13127. Up to 294 conditions per place. [2024-11-13 15:14:26,627 INFO L140 encePairwiseOnDemand]: 614/625 looper letters, 37 selfloop transitions, 10 changer transitions 0/595 dead transitions. [2024-11-13 15:14:26,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 595 transitions, 1944 flow [2024-11-13 15:14:26,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:14:26,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 15:14:26,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3498 transitions. [2024-11-13 15:14:26,630 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9328 [2024-11-13 15:14:26,630 INFO L175 Difference]: Start difference. First operand has 598 places, 583 transitions, 1816 flow. Second operand 6 states and 3498 transitions. [2024-11-13 15:14:26,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 595 transitions, 1944 flow [2024-11-13 15:14:26,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 600 places, 595 transitions, 1940 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 15:14:26,639 INFO L231 Difference]: Finished difference. Result has 604 places, 585 transitions, 1860 flow [2024-11-13 15:14:26,640 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1808, PETRI_DIFFERENCE_MINUEND_PLACES=595, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1860, PETRI_PLACES=604, PETRI_TRANSITIONS=585} [2024-11-13 15:14:26,640 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 27 predicate places. [2024-11-13 15:14:26,640 INFO L471 AbstractCegarLoop]: Abstraction has has 604 places, 585 transitions, 1860 flow [2024-11-13 15:14:26,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 578.0) internal successors, (3468), 6 states have internal predecessors, (3468), 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 15:14:26,641 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:14:26,641 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:14:26,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-13 15:14:26,641 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-13 15:14:26,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:14:26,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1772899317, now seen corresponding path program 1 times [2024-11-13 15:14:26,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:14:26,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956447614] [2024-11-13 15:14:26,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:14:26,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:14:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:14:26,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:14:26,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:14:26,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956447614] [2024-11-13 15:14:26,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956447614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:14:26,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:14:26,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:14:26,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509161577] [2024-11-13 15:14:26,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:14:26,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:14:26,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:14:26,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:14:26,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:14:26,730 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 590 out of 625 [2024-11-13 15:14:26,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 585 transitions, 1860 flow. Second operand has 3 states, 3 states have (on average 591.6666666666666) internal successors, (1775), 3 states have internal predecessors, (1775), 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 15:14:26,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:14:26,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 590 of 625 [2024-11-13 15:14:26,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:14:31,045 INFO L124 PetriNetUnfolderBase]: 863/16330 cut-off events. [2024-11-13 15:14:31,045 INFO L125 PetriNetUnfolderBase]: For 1342/1363 co-relation queries the response was YES. [2024-11-13 15:14:31,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20836 conditions, 16330 events. 863/16330 cut-off events. For 1342/1363 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 183105 event pairs, 169 based on Foata normal form. 0/15345 useless extension candidates. Maximal degree in co-relation 20717. Up to 946 conditions per place. [2024-11-13 15:14:31,172 INFO L140 encePairwiseOnDemand]: 617/625 looper letters, 19 selfloop transitions, 4 changer transitions 0/589 dead transitions. [2024-11-13 15:14:31,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 589 transitions, 1918 flow [2024-11-13 15:14:31,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:14:31,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:14:31,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1797 transitions. [2024-11-13 15:14:31,174 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9584 [2024-11-13 15:14:31,175 INFO L175 Difference]: Start difference. First operand has 604 places, 585 transitions, 1860 flow. Second operand 3 states and 1797 transitions. [2024-11-13 15:14:31,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 589 transitions, 1918 flow [2024-11-13 15:14:31,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 589 transitions, 1914 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 15:14:31,209 INFO L231 Difference]: Finished difference. Result has 602 places, 585 transitions, 1876 flow [2024-11-13 15:14:31,210 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1848, PETRI_DIFFERENCE_MINUEND_PLACES=599, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1876, PETRI_PLACES=602, PETRI_TRANSITIONS=585} [2024-11-13 15:14:31,211 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 25 predicate places. [2024-11-13 15:14:31,211 INFO L471 AbstractCegarLoop]: Abstraction has has 602 places, 585 transitions, 1876 flow [2024-11-13 15:14:31,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 591.6666666666666) internal successors, (1775), 3 states have internal predecessors, (1775), 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 15:14:31,212 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:14:31,212 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:14:31,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-13 15:14:31,212 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-13 15:14:31,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:14:31,213 INFO L85 PathProgramCache]: Analyzing trace with hash 127203770, now seen corresponding path program 1 times [2024-11-13 15:14:31,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:14:31,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300625272] [2024-11-13 15:14:31,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:14:31,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:14:31,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:14:32,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:14:32,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:14:32,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300625272] [2024-11-13 15:14:32,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300625272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:14:32,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:14:32,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:14:32,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634501125] [2024-11-13 15:14:32,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:14:32,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:14:32,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:14:32,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:14:32,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:14:33,143 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 625 [2024-11-13 15:14:33,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 602 places, 585 transitions, 1876 flow. Second operand has 6 states, 6 states have (on average 577.8333333333334) internal successors, (3467), 6 states have internal predecessors, (3467), 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 15:14:33,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:14:33,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 625 [2024-11-13 15:14:33,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:14:36,207 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1591] thread3EXIT-->L97: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][554], [Black: 646#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 652#true, 840#(= |#race~C~0| 0), Black: 658#(not |thread2Thread1of1ForFork0_#t~short6|), 634#(= |#race~Cn~0| 0), Black: 781#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~Cn~0 0) (= ~i_BC~0 0)), Black: 787#(and (<= ~Cn~0 0) (= ~i_BC~0 0) (not |thread2Thread1of1ForFork0_#t~short6|)), Black: 661#true, Black: 770#(= ~i_BC~0 0), Black: 774#(and (<= ~Cn~0 0) (= ~i_BC~0 0)), Black: 779#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), 768#true, 654#(= |#race~A~0| 0), Black: 678#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~An~0 0) (= ~i_AB~0 0)), Black: 667#(= ~i_AB~0 0), Black: 801#(and (= ~i_AC~0 0) (<= ~Cn~0 0)), Black: 684#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~An~0 0) (= ~i_AB~0 0)), Black: 671#(and (<= ~An~0 0) (= ~i_AB~0 0)), Black: 676#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~i_AB~0 0)), Black: 814#(and (not |thread3Thread1of1ForFork1_#t~short11|) (= ~i_AC~0 0) (<= ~Cn~0 0)), Black: 818#true, Black: 822#(and (= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) 0)), 616#(= |#race~An~0| 0), Black: 820#(= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) 0), Black: 821#(and (= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) 0)), 531#L97true, Black: 830#(= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) ~B~0.offset)) 0), Black: 832#(and (= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) ~B~0.offset 1)) 0)), Black: 831#(and (= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) ~B~0.offset 1)) 0)), Black: 701#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), Black: 709#(and (<= ~Bn~0 0) (= ~i_BC~0 0) (not |thread2Thread1of1ForFork0_#t~short6|)), 722#(= ~i_AC~0 0), Black: 692#(= ~i_BC~0 0), Black: 696#(and (<= ~Bn~0 0) (= ~i_BC~0 0)), Black: 838#true, 628#(= |#race~Bn~0| 0), Black: 703#(and (<= ~Bn~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), 665#true, Black: 717#(not |thread3Thread1of1ForFork1_#t~short11|), 797#(= ~i_AC~0 0), 847#(and (= (select (select |#race| ~B~0.base) (+ (* ~i_AB~0 4) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_AB~0 4) 3 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 1)) 0)), Black: 739#(and (not |thread3Thread1of1ForFork1_#t~short11|) (= ~i_AC~0 0) (<= ~An~0 0)), Black: 726#(and (= ~i_AC~0 0) (<= ~An~0 0)), 745#true, 828#true, Black: 764#(and (<= ~Bn~0 0) (not |thread1Thread1of1ForFork2_#t~short1|) (= ~i_AB~0 0)), 663#(= |#race~B~0| 0), Black: 751#(and (<= ~Bn~0 0) (= ~i_AB~0 0)), Black: 747#(= ~i_AB~0 0)]) [2024-11-13 15:14:36,208 INFO L294 olderBase$Statistics]: this new event has 436 ancestors and is cut-off event [2024-11-13 15:14:36,208 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-11-13 15:14:36,208 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2024-11-13 15:14:36,208 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-11-13 15:14:36,360 INFO L124 PetriNetUnfolderBase]: 446/11911 cut-off events. [2024-11-13 15:14:36,360 INFO L125 PetriNetUnfolderBase]: For 859/1036 co-relation queries the response was YES. [2024-11-13 15:14:36,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15286 conditions, 11911 events. 446/11911 cut-off events. For 859/1036 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 120085 event pairs, 25 based on Foata normal form. 64/11418 useless extension candidates. Maximal degree in co-relation 15164. Up to 273 conditions per place. [2024-11-13 15:14:36,447 INFO L140 encePairwiseOnDemand]: 614/625 looper letters, 38 selfloop transitions, 10 changer transitions 0/598 dead transitions. [2024-11-13 15:14:36,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 605 places, 598 transitions, 2009 flow [2024-11-13 15:14:36,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:14:36,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 15:14:36,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3499 transitions. [2024-11-13 15:14:36,451 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9330666666666667 [2024-11-13 15:14:36,451 INFO L175 Difference]: Start difference. First operand has 602 places, 585 transitions, 1876 flow. Second operand 6 states and 3499 transitions. [2024-11-13 15:14:36,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 605 places, 598 transitions, 2009 flow [2024-11-13 15:14:36,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 598 transitions, 2009 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 15:14:36,477 INFO L231 Difference]: Finished difference. Result has 609 places, 587 transitions, 1924 flow [2024-11-13 15:14:36,478 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1872, PETRI_DIFFERENCE_MINUEND_PLACES=600, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1924, PETRI_PLACES=609, PETRI_TRANSITIONS=587} [2024-11-13 15:14:36,482 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 32 predicate places. [2024-11-13 15:14:36,482 INFO L471 AbstractCegarLoop]: Abstraction has has 609 places, 587 transitions, 1924 flow [2024-11-13 15:14:36,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 577.8333333333334) internal successors, (3467), 6 states have internal predecessors, (3467), 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 15:14:36,484 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:14:36,484 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:14:36,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-13 15:14:36,484 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-13 15:14:36,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:14:36,485 INFO L85 PathProgramCache]: Analyzing trace with hash 548023438, now seen corresponding path program 1 times [2024-11-13 15:14:36,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:14:36,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029593412] [2024-11-13 15:14:36,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:14:36,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:14:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:14:37,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:14:37,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:14:37,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029593412] [2024-11-13 15:14:37,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029593412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:14:37,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:14:37,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:14:37,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175004442] [2024-11-13 15:14:37,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:14:37,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:14:37,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:14:37,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:14:37,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:14:38,111 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 625 [2024-11-13 15:14:38,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 609 places, 587 transitions, 1924 flow. Second operand has 6 states, 6 states have (on average 578.1666666666666) internal successors, (3469), 6 states have internal predecessors, (3469), 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 15:14:38,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:14:38,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 625 [2024-11-13 15:14:38,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:14:43,088 INFO L124 PetriNetUnfolderBase]: 936/17156 cut-off events. [2024-11-13 15:14:43,089 INFO L125 PetriNetUnfolderBase]: For 1488/1543 co-relation queries the response was YES. [2024-11-13 15:14:43,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22790 conditions, 17156 events. 936/17156 cut-off events. For 1488/1543 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 198225 event pairs, 75 based on Foata normal form. 4/16363 useless extension candidates. Maximal degree in co-relation 22664. Up to 660 conditions per place. [2024-11-13 15:14:43,261 INFO L140 encePairwiseOnDemand]: 614/625 looper letters, 36 selfloop transitions, 10 changer transitions 0/598 dead transitions. [2024-11-13 15:14:43,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 598 transitions, 2047 flow [2024-11-13 15:14:43,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:14:43,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 15:14:43,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3497 transitions. [2024-11-13 15:14:43,266 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9325333333333333 [2024-11-13 15:14:43,266 INFO L175 Difference]: Start difference. First operand has 609 places, 587 transitions, 1924 flow. Second operand 6 states and 3497 transitions. [2024-11-13 15:14:43,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 598 transitions, 2047 flow [2024-11-13 15:14:43,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 598 transitions, 2043 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 15:14:43,297 INFO L231 Difference]: Finished difference. Result has 615 places, 589 transitions, 1968 flow [2024-11-13 15:14:43,297 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1916, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1968, PETRI_PLACES=615, PETRI_TRANSITIONS=589} [2024-11-13 15:14:43,300 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 38 predicate places. [2024-11-13 15:14:43,301 INFO L471 AbstractCegarLoop]: Abstraction has has 615 places, 589 transitions, 1968 flow [2024-11-13 15:14:43,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 578.1666666666666) internal successors, (3469), 6 states have internal predecessors, (3469), 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 15:14:43,302 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:14:43,302 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:14:43,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-13 15:14:43,302 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-13 15:14:43,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:14:43,303 INFO L85 PathProgramCache]: Analyzing trace with hash 958487601, now seen corresponding path program 1 times [2024-11-13 15:14:43,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:14:43,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144259850] [2024-11-13 15:14:43,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:14:43,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:14:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:14:44,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:14:44,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:14:44,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144259850] [2024-11-13 15:14:44,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144259850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:14:44,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:14:44,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:14:44,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529821843] [2024-11-13 15:14:44,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:14:44,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:14:44,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:14:44,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:14:44,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:14:44,983 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 625 [2024-11-13 15:14:44,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 615 places, 589 transitions, 1968 flow. Second operand has 6 states, 6 states have (on average 578.0) internal successors, (3468), 6 states have internal predecessors, (3468), 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 15:14:44,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:14:44,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 625 [2024-11-13 15:14:44,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:14:49,710 INFO L124 PetriNetUnfolderBase]: 613/15272 cut-off events. [2024-11-13 15:14:49,710 INFO L125 PetriNetUnfolderBase]: For 1263/1644 co-relation queries the response was YES. [2024-11-13 15:14:49,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20836 conditions, 15272 events. 613/15272 cut-off events. For 1263/1644 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 164117 event pairs, 40 based on Foata normal form. 52/14784 useless extension candidates. Maximal degree in co-relation 20706. Up to 416 conditions per place. [2024-11-13 15:14:49,866 INFO L140 encePairwiseOnDemand]: 614/625 looper letters, 37 selfloop transitions, 10 changer transitions 0/601 dead transitions. [2024-11-13 15:14:49,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 618 places, 601 transitions, 2096 flow [2024-11-13 15:14:49,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:14:49,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 15:14:49,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3498 transitions. [2024-11-13 15:14:49,870 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9328 [2024-11-13 15:14:49,870 INFO L175 Difference]: Start difference. First operand has 615 places, 589 transitions, 1968 flow. Second operand 6 states and 3498 transitions. [2024-11-13 15:14:49,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 618 places, 601 transitions, 2096 flow [2024-11-13 15:14:49,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 617 places, 601 transitions, 2092 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 15:14:49,904 INFO L231 Difference]: Finished difference. Result has 621 places, 591 transitions, 2012 flow [2024-11-13 15:14:49,904 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1960, PETRI_DIFFERENCE_MINUEND_PLACES=612, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2012, PETRI_PLACES=621, PETRI_TRANSITIONS=591} [2024-11-13 15:14:49,906 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 44 predicate places. [2024-11-13 15:14:49,906 INFO L471 AbstractCegarLoop]: Abstraction has has 621 places, 591 transitions, 2012 flow [2024-11-13 15:14:49,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 578.0) internal successors, (3468), 6 states have internal predecessors, (3468), 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 15:14:49,908 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:14:49,908 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:14:49,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-13 15:14:49,908 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-13 15:14:49,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:14:49,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1724281086, now seen corresponding path program 1 times [2024-11-13 15:14:49,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:14:49,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734754852] [2024-11-13 15:14:49,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:14:49,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:14:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:14:49,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:14:49,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:14:49,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734754852] [2024-11-13 15:14:49,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734754852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:14:49,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:14:49,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:14:49,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374604006] [2024-11-13 15:14:49,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:14:49,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:14:49,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:14:49,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:14:49,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:14:50,051 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 625 [2024-11-13 15:14:50,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 591 transitions, 2012 flow. Second operand has 3 states, 3 states have (on average 592.0) internal successors, (1776), 3 states have internal predecessors, (1776), 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 15:14:50,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:14:50,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 625 [2024-11-13 15:14:50,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:14:54,543 INFO L124 PetriNetUnfolderBase]: 570/15087 cut-off events. [2024-11-13 15:14:54,543 INFO L125 PetriNetUnfolderBase]: For 1320/1733 co-relation queries the response was YES. [2024-11-13 15:14:54,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21315 conditions, 15087 events. 570/15087 cut-off events. For 1320/1733 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 158727 event pairs, 101 based on Foata normal form. 7/14601 useless extension candidates. Maximal degree in co-relation 21183. Up to 712 conditions per place. [2024-11-13 15:14:54,661 INFO L140 encePairwiseOnDemand]: 622/625 looper letters, 19 selfloop transitions, 2 changer transitions 0/592 dead transitions. [2024-11-13 15:14:54,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 622 places, 592 transitions, 2058 flow [2024-11-13 15:14:54,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:14:54,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:14:54,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1789 transitions. [2024-11-13 15:14:54,664 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9541333333333334 [2024-11-13 15:14:54,664 INFO L175 Difference]: Start difference. First operand has 621 places, 591 transitions, 2012 flow. Second operand 3 states and 1789 transitions. [2024-11-13 15:14:54,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 622 places, 592 transitions, 2058 flow [2024-11-13 15:14:54,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 621 places, 592 transitions, 2054 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 15:14:54,704 INFO L231 Difference]: Finished difference. Result has 621 places, 590 transitions, 2010 flow [2024-11-13 15:14:54,705 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=2006, PETRI_DIFFERENCE_MINUEND_PLACES=619, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2010, PETRI_PLACES=621, PETRI_TRANSITIONS=590} [2024-11-13 15:14:54,705 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 44 predicate places. [2024-11-13 15:14:54,706 INFO L471 AbstractCegarLoop]: Abstraction has has 621 places, 590 transitions, 2010 flow [2024-11-13 15:14:54,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.0) internal successors, (1776), 3 states have internal predecessors, (1776), 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 15:14:54,706 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:14:54,706 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:14:54,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-13 15:14:54,707 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-13 15:14:54,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:14:54,707 INFO L85 PathProgramCache]: Analyzing trace with hash -289829994, now seen corresponding path program 1 times [2024-11-13 15:14:54,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:14:54,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976815105] [2024-11-13 15:14:54,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:14:54,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:14:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:14:55,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:14:55,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:14:55,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976815105] [2024-11-13 15:14:55,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976815105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:14:55,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:14:55,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:14:55,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775491420] [2024-11-13 15:14:55,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:14:55,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:14:55,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:14:55,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:14:55,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:14:56,264 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 625 [2024-11-13 15:14:56,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 590 transitions, 2010 flow. Second operand has 6 states, 6 states have (on average 578.1666666666666) internal successors, (3469), 6 states have internal predecessors, (3469), 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 15:14:56,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:14:56,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 625 [2024-11-13 15:14:56,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:15:01,604 INFO L124 PetriNetUnfolderBase]: 939/17051 cut-off events. [2024-11-13 15:15:01,605 INFO L125 PetriNetUnfolderBase]: For 1874/1932 co-relation queries the response was YES. [2024-11-13 15:15:01,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24197 conditions, 17051 events. 939/17051 cut-off events. For 1874/1932 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 195661 event pairs, 61 based on Foata normal form. 76/16474 useless extension candidates. Maximal degree in co-relation 24062. Up to 606 conditions per place. [2024-11-13 15:15:01,750 INFO L140 encePairwiseOnDemand]: 614/625 looper letters, 29 selfloop transitions, 6 changer transitions 173/601 dead transitions. [2024-11-13 15:15:01,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 601 transitions, 2131 flow [2024-11-13 15:15:01,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:15:01,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 15:15:01,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3496 transitions. [2024-11-13 15:15:01,755 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9322666666666667 [2024-11-13 15:15:01,756 INFO L175 Difference]: Start difference. First operand has 621 places, 590 transitions, 2010 flow. Second operand 6 states and 3496 transitions. [2024-11-13 15:15:01,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 601 transitions, 2131 flow [2024-11-13 15:15:01,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 622 places, 601 transitions, 2127 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 15:15:01,802 INFO L231 Difference]: Finished difference. Result has 622 places, 420 transitions, 1411 flow [2024-11-13 15:15:01,803 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=2002, PETRI_DIFFERENCE_MINUEND_PLACES=617, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1411, PETRI_PLACES=622, PETRI_TRANSITIONS=420} [2024-11-13 15:15:01,804 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 45 predicate places. [2024-11-13 15:15:01,804 INFO L471 AbstractCegarLoop]: Abstraction has has 622 places, 420 transitions, 1411 flow [2024-11-13 15:15:01,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 578.1666666666666) internal successors, (3469), 6 states have internal predecessors, (3469), 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 15:15:01,805 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:15:01,805 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:15:01,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-13 15:15:01,805 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-13 15:15:01,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:15:01,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1241039513, now seen corresponding path program 1 times [2024-11-13 15:15:01,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:15:01,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777942265] [2024-11-13 15:15:01,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:15:01,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:15:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:15:01,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:15:01,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:15:01,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777942265] [2024-11-13 15:15:01,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777942265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:15:01,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:15:01,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:15:01,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313314818] [2024-11-13 15:15:01,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:15:01,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:15:01,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:15:01,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:15:01,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:15:01,951 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 625 [2024-11-13 15:15:01,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 420 transitions, 1411 flow. Second operand has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 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 15:15:01,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:15:01,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 625 [2024-11-13 15:15:01,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:15:03,850 INFO L124 PetriNetUnfolderBase]: 407/4947 cut-off events. [2024-11-13 15:15:03,850 INFO L125 PetriNetUnfolderBase]: For 1417/1429 co-relation queries the response was YES. [2024-11-13 15:15:03,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8375 conditions, 4947 events. 407/4947 cut-off events. For 1417/1429 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 38336 event pairs, 208 based on Foata normal form. 0/4694 useless extension candidates. Maximal degree in co-relation 8242. Up to 520 conditions per place. [2024-11-13 15:15:03,908 INFO L140 encePairwiseOnDemand]: 622/625 looper letters, 14 selfloop transitions, 2 changer transitions 10/421 dead transitions. [2024-11-13 15:15:03,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 421 transitions, 1447 flow [2024-11-13 15:15:03,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:15:03,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:15:03,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1784 transitions. [2024-11-13 15:15:03,910 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9514666666666667 [2024-11-13 15:15:03,910 INFO L175 Difference]: Start difference. First operand has 622 places, 420 transitions, 1411 flow. Second operand 3 states and 1784 transitions. [2024-11-13 15:15:03,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 498 places, 421 transitions, 1447 flow [2024-11-13 15:15:03,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 421 transitions, 1297 flow, removed 5 selfloop flow, removed 56 redundant places. [2024-11-13 15:15:03,934 INFO L231 Difference]: Finished difference. Result has 442 places, 409 transitions, 1191 flow [2024-11-13 15:15:03,934 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1191, PETRI_PLACES=442, PETRI_TRANSITIONS=409} [2024-11-13 15:15:03,935 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -135 predicate places. [2024-11-13 15:15:03,935 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 409 transitions, 1191 flow [2024-11-13 15:15:03,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 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 15:15:03,936 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:15:03,936 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:15:03,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-13 15:15:03,936 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-13 15:15:03,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:15:03,937 INFO L85 PathProgramCache]: Analyzing trace with hash -669847138, now seen corresponding path program 1 times [2024-11-13 15:15:03,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:15:03,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562267102] [2024-11-13 15:15:03,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:15:03,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:15:03,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:15:04,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:15:04,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:15:04,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562267102] [2024-11-13 15:15:04,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562267102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:15:04,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:15:04,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:15:04,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290882578] [2024-11-13 15:15:04,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:15:04,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:15:04,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:15:04,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:15:04,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:15:04,069 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 625 [2024-11-13 15:15:04,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 409 transitions, 1191 flow. Second operand has 3 states, 3 states have (on average 592.6666666666666) internal successors, (1778), 3 states have internal predecessors, (1778), 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 15:15:04,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:15:04,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 625 [2024-11-13 15:15:04,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:15:04,982 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1590] thread2EXIT-->L96: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][270], [247#L96true, Black: 701#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), Black: 709#(and (<= ~Bn~0 0) (= ~i_BC~0 0) (not |thread2Thread1of1ForFork0_#t~short6|)), Black: 692#(= ~i_BC~0 0), Black: 646#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 696#(and (<= ~Bn~0 0) (= ~i_BC~0 0)), Black: 838#true, 628#(= |#race~Bn~0| 0), Black: 703#(and (<= ~Bn~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), Black: 717#(not |thread3Thread1of1ForFork1_#t~short11|), Black: 652#true, 840#(= |#race~C~0| 0), Black: 658#(not |thread2Thread1of1ForFork0_#t~short6|), 634#(= |#race~Cn~0| 0), Black: 661#true, 165#L71-3true, Black: 779#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), 720#true, 768#true, 654#(= |#race~A~0| 0), 884#true, Black: 739#(and (not |thread3Thread1of1ForFork1_#t~short11|) (= ~i_AC~0 0) (<= ~An~0 0)), Black: 722#(= ~i_AC~0 0), Black: 726#(and (= ~i_AC~0 0) (<= ~An~0 0)), 747#(= ~i_AB~0 0), Black: 678#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~An~0 0) (= ~i_AB~0 0)), Black: 684#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~An~0 0) (= ~i_AB~0 0)), Black: 671#(and (<= ~An~0 0) (= ~i_AB~0 0)), Black: 676#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~i_AB~0 0)), 667#(= ~i_AB~0 0), 881#true, 616#(= |#race~An~0| 0), Black: 764#(and (<= ~Bn~0 0) (not |thread1Thread1of1ForFork2_#t~short1|) (= ~i_AB~0 0)), Black: 751#(and (<= ~Bn~0 0) (= ~i_AB~0 0)), 663#(= |#race~B~0| 0)]) [2024-11-13 15:15:04,982 INFO L294 olderBase$Statistics]: this new event has 441 ancestors and is cut-off event [2024-11-13 15:15:04,982 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2024-11-13 15:15:04,982 INFO L297 olderBase$Statistics]: existing Event has 368 ancestors and is cut-off event [2024-11-13 15:15:04,982 INFO L297 olderBase$Statistics]: existing Event has 396 ancestors and is cut-off event [2024-11-13 15:15:05,003 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1553] L71-10-->L71-11: Formula: (= |v_#race~C~0_4| 0) InVars {} OutVars{#race~C~0=|v_#race~C~0_4|} AuxVars[] AssignedVars[#race~C~0][359], [Black: 701#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), Black: 709#(and (<= ~Bn~0 0) (= ~i_BC~0 0) (not |thread2Thread1of1ForFork0_#t~short6|)), Black: 692#(= ~i_BC~0 0), Black: 646#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 696#(and (<= ~Bn~0 0) (= ~i_BC~0 0)), Black: 838#true, 628#(= |#race~Bn~0| 0), 373#L71-11true, Black: 703#(and (<= ~Bn~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), Black: 717#(not |thread3Thread1of1ForFork1_#t~short11|), Black: 652#true, 840#(= |#race~C~0| 0), Black: 658#(not |thread2Thread1of1ForFork0_#t~short6|), 634#(= |#race~Cn~0| 0), Black: 661#true, Black: 779#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), 720#true, 768#true, 654#(= |#race~A~0| 0), 884#true, Black: 739#(and (not |thread3Thread1of1ForFork1_#t~short11|) (= ~i_AC~0 0) (<= ~An~0 0)), Black: 722#(= ~i_AC~0 0), Black: 726#(and (= ~i_AC~0 0) (<= ~An~0 0)), 108#L95-1true, 747#(= ~i_AB~0 0), Black: 678#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~An~0 0) (= ~i_AB~0 0)), Black: 684#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~An~0 0) (= ~i_AB~0 0)), Black: 671#(and (<= ~An~0 0) (= ~i_AB~0 0)), Black: 676#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~i_AB~0 0)), 667#(= ~i_AB~0 0), 507#L60-11true, 881#true, 616#(= |#race~An~0| 0), Black: 764#(and (<= ~Bn~0 0) (not |thread1Thread1of1ForFork2_#t~short1|) (= ~i_AB~0 0)), Black: 751#(and (<= ~Bn~0 0) (= ~i_AB~0 0)), 663#(= |#race~B~0| 0)]) [2024-11-13 15:15:05,003 INFO L294 olderBase$Statistics]: this new event has 434 ancestors and is cut-off event [2024-11-13 15:15:05,003 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2024-11-13 15:15:05,003 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-11-13 15:15:05,003 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2024-11-13 15:15:05,048 INFO L124 PetriNetUnfolderBase]: 489/4087 cut-off events. [2024-11-13 15:15:05,048 INFO L125 PetriNetUnfolderBase]: For 712/740 co-relation queries the response was YES. [2024-11-13 15:15:05,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5913 conditions, 4087 events. 489/4087 cut-off events. For 712/740 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 32375 event pairs, 216 based on Foata normal form. 0/3853 useless extension candidates. Maximal degree in co-relation 5813. Up to 517 conditions per place. [2024-11-13 15:15:05,088 INFO L140 encePairwiseOnDemand]: 622/625 looper letters, 0 selfloop transitions, 0 changer transitions 410/410 dead transitions. [2024-11-13 15:15:05,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 410 transitions, 1227 flow [2024-11-13 15:15:05,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:15:05,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:15:05,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1784 transitions. [2024-11-13 15:15:05,090 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9514666666666667 [2024-11-13 15:15:05,090 INFO L175 Difference]: Start difference. First operand has 442 places, 409 transitions, 1191 flow. Second operand 3 states and 1784 transitions. [2024-11-13 15:15:05,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 410 transitions, 1227 flow [2024-11-13 15:15:05,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 410 transitions, 1194 flow, removed 5 selfloop flow, removed 12 redundant places. [2024-11-13 15:15:05,100 INFO L231 Difference]: Finished difference. Result has 426 places, 0 transitions, 0 flow [2024-11-13 15:15:05,100 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1156, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=426, PETRI_TRANSITIONS=0} [2024-11-13 15:15:05,101 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -151 predicate places. [2024-11-13 15:15:05,101 INFO L471 AbstractCegarLoop]: Abstraction has has 426 places, 0 transitions, 0 flow [2024-11-13 15:15:05,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.6666666666666) internal successors, (1778), 3 states have internal predecessors, (1778), 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 15:15:05,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (116 of 117 remaining) [2024-11-13 15:15:05,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (115 of 117 remaining) [2024-11-13 15:15:05,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (114 of 117 remaining) [2024-11-13 15:15:05,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (113 of 117 remaining) [2024-11-13 15:15:05,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (112 of 117 remaining) [2024-11-13 15:15:05,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (111 of 117 remaining) [2024-11-13 15:15:05,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (110 of 117 remaining) [2024-11-13 15:15:05,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (109 of 117 remaining) [2024-11-13 15:15:05,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (108 of 117 remaining) [2024-11-13 15:15:05,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (107 of 117 remaining) [2024-11-13 15:15:05,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (106 of 117 remaining) [2024-11-13 15:15:05,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (105 of 117 remaining) [2024-11-13 15:15:05,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (104 of 117 remaining) [2024-11-13 15:15:05,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (103 of 117 remaining) [2024-11-13 15:15:05,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (102 of 117 remaining) [2024-11-13 15:15:05,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (101 of 117 remaining) [2024-11-13 15:15:05,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (100 of 117 remaining) [2024-11-13 15:15:05,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (99 of 117 remaining) [2024-11-13 15:15:05,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (98 of 117 remaining) [2024-11-13 15:15:05,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (97 of 117 remaining) [2024-11-13 15:15:05,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (96 of 117 remaining) [2024-11-13 15:15:05,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (95 of 117 remaining) [2024-11-13 15:15:05,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (94 of 117 remaining) [2024-11-13 15:15:05,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (93 of 117 remaining) [2024-11-13 15:15:05,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (92 of 117 remaining) [2024-11-13 15:15:05,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (91 of 117 remaining) [2024-11-13 15:15:05,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (90 of 117 remaining) [2024-11-13 15:15:05,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (89 of 117 remaining) [2024-11-13 15:15:05,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (88 of 117 remaining) [2024-11-13 15:15:05,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (87 of 117 remaining) [2024-11-13 15:15:05,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (86 of 117 remaining) [2024-11-13 15:15:05,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (85 of 117 remaining) [2024-11-13 15:15:05,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (84 of 117 remaining) [2024-11-13 15:15:05,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (83 of 117 remaining) [2024-11-13 15:15:05,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (82 of 117 remaining) [2024-11-13 15:15:05,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (81 of 117 remaining) [2024-11-13 15:15:05,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (80 of 117 remaining) [2024-11-13 15:15:05,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (79 of 117 remaining) [2024-11-13 15:15:05,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (78 of 117 remaining) [2024-11-13 15:15:05,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (77 of 117 remaining) [2024-11-13 15:15:05,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (76 of 117 remaining) [2024-11-13 15:15:05,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (75 of 117 remaining) [2024-11-13 15:15:05,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (74 of 117 remaining) [2024-11-13 15:15:05,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (73 of 117 remaining) [2024-11-13 15:15:05,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (72 of 117 remaining) [2024-11-13 15:15:05,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (71 of 117 remaining) [2024-11-13 15:15:05,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (70 of 117 remaining) [2024-11-13 15:15:05,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (69 of 117 remaining) [2024-11-13 15:15:05,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (68 of 117 remaining) [2024-11-13 15:15:05,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (67 of 117 remaining) [2024-11-13 15:15:05,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (66 of 117 remaining) [2024-11-13 15:15:05,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (65 of 117 remaining) [2024-11-13 15:15:05,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (64 of 117 remaining) [2024-11-13 15:15:05,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (63 of 117 remaining) [2024-11-13 15:15:05,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (62 of 117 remaining) [2024-11-13 15:15:05,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (61 of 117 remaining) [2024-11-13 15:15:05,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (60 of 117 remaining) [2024-11-13 15:15:05,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (59 of 117 remaining) [2024-11-13 15:15:05,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (58 of 117 remaining) [2024-11-13 15:15:05,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (57 of 117 remaining) [2024-11-13 15:15:05,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (56 of 117 remaining) [2024-11-13 15:15:05,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (55 of 117 remaining) [2024-11-13 15:15:05,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (54 of 117 remaining) [2024-11-13 15:15:05,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (53 of 117 remaining) [2024-11-13 15:15:05,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE (52 of 117 remaining) [2024-11-13 15:15:05,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE (51 of 117 remaining) [2024-11-13 15:15:05,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (50 of 117 remaining) [2024-11-13 15:15:05,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE (49 of 117 remaining) [2024-11-13 15:15:05,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (48 of 117 remaining) [2024-11-13 15:15:05,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONDATA_RACE (47 of 117 remaining) [2024-11-13 15:15:05,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (46 of 117 remaining) [2024-11-13 15:15:05,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONDATA_RACE (45 of 117 remaining) [2024-11-13 15:15:05,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONDATA_RACE (44 of 117 remaining) [2024-11-13 15:15:05,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE (43 of 117 remaining) [2024-11-13 15:15:05,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONDATA_RACE (42 of 117 remaining) [2024-11-13 15:15:05,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONDATA_RACE (41 of 117 remaining) [2024-11-13 15:15:05,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONDATA_RACE (40 of 117 remaining) [2024-11-13 15:15:05,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONDATA_RACE (39 of 117 remaining) [2024-11-13 15:15:05,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 117 remaining) [2024-11-13 15:15:05,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 117 remaining) [2024-11-13 15:15:05,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 117 remaining) [2024-11-13 15:15:05,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (35 of 117 remaining) [2024-11-13 15:15:05,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (34 of 117 remaining) [2024-11-13 15:15:05,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (33 of 117 remaining) [2024-11-13 15:15:05,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (32 of 117 remaining) [2024-11-13 15:15:05,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (31 of 117 remaining) [2024-11-13 15:15:05,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (30 of 117 remaining) [2024-11-13 15:15:05,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (29 of 117 remaining) [2024-11-13 15:15:05,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (28 of 117 remaining) [2024-11-13 15:15:05,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (27 of 117 remaining) [2024-11-13 15:15:05,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (26 of 117 remaining) [2024-11-13 15:15:05,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (25 of 117 remaining) [2024-11-13 15:15:05,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (24 of 117 remaining) [2024-11-13 15:15:05,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (23 of 117 remaining) [2024-11-13 15:15:05,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (22 of 117 remaining) [2024-11-13 15:15:05,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (21 of 117 remaining) [2024-11-13 15:15:05,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (20 of 117 remaining) [2024-11-13 15:15:05,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (19 of 117 remaining) [2024-11-13 15:15:05,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (18 of 117 remaining) [2024-11-13 15:15:05,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (17 of 117 remaining) [2024-11-13 15:15:05,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (16 of 117 remaining) [2024-11-13 15:15:05,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (15 of 117 remaining) [2024-11-13 15:15:05,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (14 of 117 remaining) [2024-11-13 15:15:05,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (13 of 117 remaining) [2024-11-13 15:15:05,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (12 of 117 remaining) [2024-11-13 15:15:05,112 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (11 of 117 remaining) [2024-11-13 15:15:05,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (10 of 117 remaining) [2024-11-13 15:15:05,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (9 of 117 remaining) [2024-11-13 15:15:05,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (8 of 117 remaining) [2024-11-13 15:15:05,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (7 of 117 remaining) [2024-11-13 15:15:05,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (6 of 117 remaining) [2024-11-13 15:15:05,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (5 of 117 remaining) [2024-11-13 15:15:05,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (4 of 117 remaining) [2024-11-13 15:15:05,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (3 of 117 remaining) [2024-11-13 15:15:05,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (2 of 117 remaining) [2024-11-13 15:15:05,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (1 of 117 remaining) [2024-11-13 15:15:05,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (0 of 117 remaining) [2024-11-13 15:15:05,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-13 15:15:05,115 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:15:05,121 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 15:15:05,121 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 15:15:05,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 03:15:05 BasicIcfg [2024-11-13 15:15:05,128 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 15:15:05,129 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 15:15:05,129 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 15:15:05,129 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 15:15:05,130 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:13:44" (3/4) ... [2024-11-13 15:15:05,132 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 15:15:05,136 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-13 15:15:05,136 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-13 15:15:05,136 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-13 15:15:05,145 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2024-11-13 15:15:05,146 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-13 15:15:05,146 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-13 15:15:05,147 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 15:15:05,425 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc2f60e-75d4-4939-8cb1-05a5655bcd31/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 15:15:05,425 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc2f60e-75d4-4939-8cb1-05a5655bcd31/bin/uautomizer-verify-qhAvR1uOyd/witness.yml [2024-11-13 15:15:05,425 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 15:15:05,429 INFO L158 Benchmark]: Toolchain (without parser) took 82598.87ms. Allocated memory was 142.6MB in the beginning and 10.1GB in the end (delta: 9.9GB). Free memory was 119.4MB in the beginning and 8.4GB in the end (delta: -8.3GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2024-11-13 15:15:05,429 INFO L158 Benchmark]: CDTParser took 1.75ms. Allocated memory is still 167.8MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:15:05,429 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.17ms. Allocated memory is still 142.6MB. Free memory was 119.0MB in the beginning and 105.6MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:15:05,430 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.50ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 102.5MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:15:05,430 INFO L158 Benchmark]: Boogie Preprocessor took 52.09ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 99.7MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:15:05,431 INFO L158 Benchmark]: RCFGBuilder took 1298.34ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 54.9MB in the end (delta: 44.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-13 15:15:05,432 INFO L158 Benchmark]: TraceAbstraction took 80489.84ms. Allocated memory was 142.6MB in the beginning and 10.1GB in the end (delta: 9.9GB). Free memory was 54.3MB in the beginning and 8.0GB in the end (delta: -8.0GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2024-11-13 15:15:05,434 INFO L158 Benchmark]: Witness Printer took 296.54ms. Allocated memory is still 10.1GB. Free memory was 8.0GB in the beginning and 8.4GB in the end (delta: -406.8MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. [2024-11-13 15:15:05,436 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.75ms. Allocated memory is still 167.8MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 382.17ms. Allocated memory is still 142.6MB. Free memory was 119.0MB in the beginning and 105.6MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.50ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 102.5MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.09ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 99.7MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1298.34ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 54.9MB in the end (delta: 44.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 80489.84ms. Allocated memory was 142.6MB in the beginning and 10.1GB in the end (delta: 9.9GB). Free memory was 54.3MB in the beginning and 8.0GB in the end (delta: -8.0GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. * Witness Printer took 296.54ms. Allocated memory is still 10.1GB. Free memory was 8.0GB in the beginning and 8.4GB in the end (delta: -406.8MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: 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: 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: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: 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: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: 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: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: 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: 88]: 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: 113]: 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: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: 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, 788 locations, 117 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: 80.2s, OverallIterations: 34, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 69.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7105 SdHoareTripleChecker+Valid, 13.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4471 mSDsluCounter, 4508 SdHoareTripleChecker+Invalid, 11.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3576 mSDsCounter, 1378 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12231 IncrementalHoareTripleChecker+Invalid, 13609 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1378 mSolverCounterUnsat, 932 mSDtfsCounter, 12231 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 173 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2012occurred in iteration=30, InterpolantAutomatonStates: 179, 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.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 5389 NumberOfCodeBlocks, 5389 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 5355 ConstructedInterpolants, 0 QuantifiedInterpolants, 10193 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 23/23 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 78 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-13 15:15:05,482 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc2f60e-75d4-4939-8cb1-05a5655bcd31/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE