./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --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 fdebcc32a5907a5601109dc3fb4ac7750aa88ce6953c83cffe48f47befc15286 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:32:36,294 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:32:36,347 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:32:36,353 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:32:36,355 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:32:36,375 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:32:36,377 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:32:36,377 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:32:36,377 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:32:36,377 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:32:36,378 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:32:36,378 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:32:36,378 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:32:36,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:32:36,378 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:32:36,378 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:32:36,379 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:32:36,379 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:32:36,379 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:32:36,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:32:36,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:32:36,379 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:32:36,379 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:32:36,379 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:32:36,379 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:32:36,379 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:32:36,379 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:32:36,380 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:32:36,380 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:32:36,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:32:36,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:32:36,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:36,380 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:32:36,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:32:36,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:32:36,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:36,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:32:36,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:32:36,380 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:32:36,381 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:32:36,381 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:32:36,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:32:36,381 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:32:36,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:32:36,381 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:32:36,381 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:32:36,381 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 -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux 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 -> fdebcc32a5907a5601109dc3fb4ac7750aa88ce6953c83cffe48f47befc15286 [2025-01-09 21:32:36,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:32:36,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:32:36,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:32:36,621 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:32:36,622 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:32:36,624 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2025-01-09 21:32:37,990 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7dce9620e/633935ba8cd747ddb431da2037e97b1a/FLAG68c4e7365 [2025-01-09 21:32:38,233 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:32:38,234 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2025-01-09 21:32:38,249 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7dce9620e/633935ba8cd747ddb431da2037e97b1a/FLAG68c4e7365 [2025-01-09 21:32:38,306 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7dce9620e/633935ba8cd747ddb431da2037e97b1a [2025-01-09 21:32:38,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:32:38,310 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:32:38,312 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:32:38,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:32:38,316 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:32:38,317 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:32:38" (1/1) ... [2025-01-09 21:32:38,318 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4128f156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:38, skipping insertion in model container [2025-01-09 21:32:38,318 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:32:38" (1/1) ... [2025-01-09 21:32:38,333 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:32:38,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:32:38,474 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:32:38,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:32:38,515 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:32:38,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:38 WrapperNode [2025-01-09 21:32:38,516 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:32:38,520 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:32:38,520 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:32:38,521 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:32:38,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:38" (1/1) ... [2025-01-09 21:32:38,537 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:38" (1/1) ... [2025-01-09 21:32:38,568 INFO L138 Inliner]: procedures = 25, calls = 60, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 601 [2025-01-09 21:32:38,570 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:32:38,570 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:32:38,570 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:32:38,571 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:32:38,575 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:38" (1/1) ... [2025-01-09 21:32:38,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:38" (1/1) ... [2025-01-09 21:32:38,583 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:38" (1/1) ... [2025-01-09 21:32:38,583 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:38" (1/1) ... [2025-01-09 21:32:38,591 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:38" (1/1) ... [2025-01-09 21:32:38,592 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:38" (1/1) ... [2025-01-09 21:32:38,595 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:38" (1/1) ... [2025-01-09 21:32:38,596 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:38" (1/1) ... [2025-01-09 21:32:38,597 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:38" (1/1) ... [2025-01-09 21:32:38,599 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:32:38,600 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:32:38,600 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:32:38,600 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:32:38,603 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:38" (1/1) ... [2025-01-09 21:32:38,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:38,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:32:38,641 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:32:38,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:32:38,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:32:38,667 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:32:38,667 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:32:38,667 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:32:38,667 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:32:38,667 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:32:38,667 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:32:38,667 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-09 21:32:38,667 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-09 21:32:38,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:32:38,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:32:38,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:32:38,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:32:38,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:32:38,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:32:38,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:32:38,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:32:38,669 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:32:38,765 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:32:38,767 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:32:39,372 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:32:39,372 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:32:39,852 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:32:39,852 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:32:39,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:39 BoogieIcfgContainer [2025-01-09 21:32:39,852 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:32:39,853 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:32:39,854 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:32:39,859 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:32:39,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:32:38" (1/3) ... [2025-01-09 21:32:39,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c0e771e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:32:39, skipping insertion in model container [2025-01-09 21:32:39,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:38" (2/3) ... [2025-01-09 21:32:39,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c0e771e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:32:39, skipping insertion in model container [2025-01-09 21:32:39,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:39" (3/3) ... [2025-01-09 21:32:39,866 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt3.wvr.c [2025-01-09 21:32:39,877 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:32:39,879 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-buffer-mult-alt3.wvr.c that has 5 procedures, 421 locations, 1 initial locations, 6 loop locations, and 95 error locations. [2025-01-09 21:32:39,879 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:32:39,961 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-09 21:32:40,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 433 places, 437 transitions, 902 flow [2025-01-09 21:32:40,102 INFO L124 PetriNetUnfolderBase]: 17/433 cut-off events. [2025-01-09 21:32:40,104 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:32:40,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 433 events. 17/433 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 625 event pairs, 0 based on Foata normal form. 0/321 useless extension candidates. Maximal degree in co-relation 385. Up to 2 conditions per place. [2025-01-09 21:32:40,109 INFO L82 GeneralOperation]: Start removeDead. Operand has 433 places, 437 transitions, 902 flow [2025-01-09 21:32:40,119 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 413 places, 416 transitions, 856 flow [2025-01-09 21:32:40,126 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:32:40,136 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;@1b5790dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:32:40,136 INFO L334 AbstractCegarLoop]: Starting to check reachability of 169 error locations. [2025-01-09 21:32:40,142 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:32:40,144 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-01-09 21:32:40,144 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:32:40,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:40,144 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:40,145 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-01-09 21:32:40,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:40,148 INFO L85 PathProgramCache]: Analyzing trace with hash 588588670, now seen corresponding path program 1 times [2025-01-09 21:32:40,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:40,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232452382] [2025-01-09 21:32:40,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:40,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:40,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:32:40,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:32:40,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:40,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:40,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:40,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:40,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232452382] [2025-01-09 21:32:40,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232452382] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:40,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:40,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:40,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797878605] [2025-01-09 21:32:40,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:40,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:40,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:40,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:40,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:40,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 437 [2025-01-09 21:32:40,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 416 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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) [2025-01-09 21:32:40,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:40,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 437 [2025-01-09 21:32:40,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:40,844 INFO L124 PetriNetUnfolderBase]: 748/1716 cut-off events. [2025-01-09 21:32:40,844 INFO L125 PetriNetUnfolderBase]: For 214/214 co-relation queries the response was YES. [2025-01-09 21:32:40,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2919 conditions, 1716 events. 748/1716 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8816 event pairs, 485 based on Foata normal form. 6/1555 useless extension candidates. Maximal degree in co-relation 2496. Up to 1009 conditions per place. [2025-01-09 21:32:40,857 INFO L140 encePairwiseOnDemand]: 358/437 looper letters, 27 selfloop transitions, 2 changer transitions 6/339 dead transitions. [2025-01-09 21:32:40,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 339 transitions, 760 flow [2025-01-09 21:32:40,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:40,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:40,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1090 transitions. [2025-01-09 21:32:40,875 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8314263920671243 [2025-01-09 21:32:40,880 INFO L175 Difference]: Start difference. First operand has 413 places, 416 transitions, 856 flow. Second operand 3 states and 1090 transitions. [2025-01-09 21:32:40,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 339 transitions, 760 flow [2025-01-09 21:32:40,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 339 transitions, 744 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-09 21:32:40,890 INFO L231 Difference]: Finished difference. Result has 336 places, 333 transitions, 678 flow [2025-01-09 21:32:40,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=678, PETRI_PLACES=336, PETRI_TRANSITIONS=333} [2025-01-09 21:32:40,897 INFO L279 CegarLoopForPetriNet]: 413 programPoint places, -77 predicate places. [2025-01-09 21:32:40,897 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 333 transitions, 678 flow [2025-01-09 21:32:40,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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) [2025-01-09 21:32:40,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:40,898 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:40,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:32:40,898 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-01-09 21:32:40,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:40,899 INFO L85 PathProgramCache]: Analyzing trace with hash -337326970, now seen corresponding path program 1 times [2025-01-09 21:32:40,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:40,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149226003] [2025-01-09 21:32:40,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:40,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:40,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 21:32:40,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 21:32:40,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:40,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:40,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:40,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:40,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149226003] [2025-01-09 21:32:40,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149226003] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:40,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:40,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:40,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988293805] [2025-01-09 21:32:40,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:40,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:40,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:40,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:40,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:40,957 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 437 [2025-01-09 21:32:40,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 333 transitions, 678 flow. Second operand has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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) [2025-01-09 21:32:40,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:40,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 437 [2025-01-09 21:32:40,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:41,277 INFO L124 PetriNetUnfolderBase]: 748/1709 cut-off events. [2025-01-09 21:32:41,277 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-09 21:32:41,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2793 conditions, 1709 events. 748/1709 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8815 event pairs, 485 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 2753. Up to 1009 conditions per place. [2025-01-09 21:32:41,285 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 27 selfloop transitions, 2 changer transitions 0/332 dead transitions. [2025-01-09 21:32:41,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 332 transitions, 734 flow [2025-01-09 21:32:41,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:41,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:41,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1014 transitions. [2025-01-09 21:32:41,291 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7734553775743707 [2025-01-09 21:32:41,291 INFO L175 Difference]: Start difference. First operand has 336 places, 333 transitions, 678 flow. Second operand 3 states and 1014 transitions. [2025-01-09 21:32:41,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 332 transitions, 734 flow [2025-01-09 21:32:41,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 332 transitions, 730 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:41,295 INFO L231 Difference]: Finished difference. Result has 329 places, 332 transitions, 676 flow [2025-01-09 21:32:41,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=676, PETRI_PLACES=329, PETRI_TRANSITIONS=332} [2025-01-09 21:32:41,296 INFO L279 CegarLoopForPetriNet]: 413 programPoint places, -84 predicate places. [2025-01-09 21:32:41,296 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 332 transitions, 676 flow [2025-01-09 21:32:41,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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) [2025-01-09 21:32:41,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:41,297 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:41,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:32:41,297 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-01-09 21:32:41,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:41,298 INFO L85 PathProgramCache]: Analyzing trace with hash -180797403, now seen corresponding path program 1 times [2025-01-09 21:32:41,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:41,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962161568] [2025-01-09 21:32:41,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:41,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:41,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 21:32:41,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 21:32:41,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:41,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:41,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:41,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:41,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962161568] [2025-01-09 21:32:41,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962161568] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:41,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:41,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:41,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302526472] [2025-01-09 21:32:41,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:41,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:41,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:41,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:41,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:41,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 437 [2025-01-09 21:32:41,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 332 transitions, 676 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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) [2025-01-09 21:32:41,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:41,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 437 [2025-01-09 21:32:41,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:41,700 INFO L124 PetriNetUnfolderBase]: 748/1708 cut-off events. [2025-01-09 21:32:41,700 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-09 21:32:41,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2791 conditions, 1708 events. 748/1708 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8850 event pairs, 485 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 2743. Up to 1008 conditions per place. [2025-01-09 21:32:41,711 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 26 selfloop transitions, 2 changer transitions 0/331 dead transitions. [2025-01-09 21:32:41,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 331 transitions, 730 flow [2025-01-09 21:32:41,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:41,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:41,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1016 transitions. [2025-01-09 21:32:41,714 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7749809305873379 [2025-01-09 21:32:41,714 INFO L175 Difference]: Start difference. First operand has 329 places, 332 transitions, 676 flow. Second operand 3 states and 1016 transitions. [2025-01-09 21:32:41,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 331 transitions, 730 flow [2025-01-09 21:32:41,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 331 transitions, 726 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:41,720 INFO L231 Difference]: Finished difference. Result has 328 places, 331 transitions, 674 flow [2025-01-09 21:32:41,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=674, PETRI_PLACES=328, PETRI_TRANSITIONS=331} [2025-01-09 21:32:41,721 INFO L279 CegarLoopForPetriNet]: 413 programPoint places, -85 predicate places. [2025-01-09 21:32:41,722 INFO L471 AbstractCegarLoop]: Abstraction has has 328 places, 331 transitions, 674 flow [2025-01-09 21:32:41,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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) [2025-01-09 21:32:41,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:41,723 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:41,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:32:41,723 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-01-09 21:32:41,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:41,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1289366515, now seen corresponding path program 1 times [2025-01-09 21:32:41,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:41,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658024937] [2025-01-09 21:32:41,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:41,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:41,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 21:32:41,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 21:32:41,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:41,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:41,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:41,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:41,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658024937] [2025-01-09 21:32:41,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658024937] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:41,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:41,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:41,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378315926] [2025-01-09 21:32:41,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:41,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:41,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:41,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:41,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:41,806 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 437 [2025-01-09 21:32:41,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 331 transitions, 674 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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) [2025-01-09 21:32:41,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:41,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 437 [2025-01-09 21:32:41,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:42,044 INFO L124 PetriNetUnfolderBase]: 748/1707 cut-off events. [2025-01-09 21:32:42,044 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-09 21:32:42,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2790 conditions, 1707 events. 748/1707 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8791 event pairs, 485 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 2734. Up to 1008 conditions per place. [2025-01-09 21:32:42,053 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 26 selfloop transitions, 2 changer transitions 0/330 dead transitions. [2025-01-09 21:32:42,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 330 transitions, 728 flow [2025-01-09 21:32:42,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:42,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:42,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1016 transitions. [2025-01-09 21:32:42,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7749809305873379 [2025-01-09 21:32:42,056 INFO L175 Difference]: Start difference. First operand has 328 places, 331 transitions, 674 flow. Second operand 3 states and 1016 transitions. [2025-01-09 21:32:42,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 330 transitions, 728 flow [2025-01-09 21:32:42,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 330 transitions, 724 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:42,060 INFO L231 Difference]: Finished difference. Result has 327 places, 330 transitions, 672 flow [2025-01-09 21:32:42,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=672, PETRI_PLACES=327, PETRI_TRANSITIONS=330} [2025-01-09 21:32:42,062 INFO L279 CegarLoopForPetriNet]: 413 programPoint places, -86 predicate places. [2025-01-09 21:32:42,062 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 330 transitions, 672 flow [2025-01-09 21:32:42,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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) [2025-01-09 21:32:42,063 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:42,064 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:42,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:32:42,064 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-01-09 21:32:42,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:42,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1109907325, now seen corresponding path program 1 times [2025-01-09 21:32:42,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:42,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008337231] [2025-01-09 21:32:42,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:42,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:42,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 21:32:42,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 21:32:42,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:42,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:42,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:42,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:42,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008337231] [2025-01-09 21:32:42,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008337231] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:42,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:42,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:42,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156844330] [2025-01-09 21:32:42,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:42,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:42,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:42,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:42,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:42,138 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 437 [2025-01-09 21:32:42,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 330 transitions, 672 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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) [2025-01-09 21:32:42,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:42,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 437 [2025-01-09 21:32:42,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:42,420 INFO L124 PetriNetUnfolderBase]: 748/1706 cut-off events. [2025-01-09 21:32:42,421 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-09 21:32:42,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2789 conditions, 1706 events. 748/1706 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8797 event pairs, 485 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 2725. Up to 1008 conditions per place. [2025-01-09 21:32:42,429 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 26 selfloop transitions, 2 changer transitions 0/329 dead transitions. [2025-01-09 21:32:42,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 329 transitions, 726 flow [2025-01-09 21:32:42,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:42,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:42,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1016 transitions. [2025-01-09 21:32:42,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7749809305873379 [2025-01-09 21:32:42,432 INFO L175 Difference]: Start difference. First operand has 327 places, 330 transitions, 672 flow. Second operand 3 states and 1016 transitions. [2025-01-09 21:32:42,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 329 transitions, 726 flow [2025-01-09 21:32:42,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 329 transitions, 722 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:42,436 INFO L231 Difference]: Finished difference. Result has 326 places, 329 transitions, 670 flow [2025-01-09 21:32:42,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=670, PETRI_PLACES=326, PETRI_TRANSITIONS=329} [2025-01-09 21:32:42,437 INFO L279 CegarLoopForPetriNet]: 413 programPoint places, -87 predicate places. [2025-01-09 21:32:42,437 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 329 transitions, 670 flow [2025-01-09 21:32:42,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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) [2025-01-09 21:32:42,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:42,438 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:42,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:32:42,438 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-01-09 21:32:42,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:42,439 INFO L85 PathProgramCache]: Analyzing trace with hash -711581069, now seen corresponding path program 1 times [2025-01-09 21:32:42,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:42,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440791874] [2025-01-09 21:32:42,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:42,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:42,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 21:32:42,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 21:32:42,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:42,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:42,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:42,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:42,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440791874] [2025-01-09 21:32:42,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440791874] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:42,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:42,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:42,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097947888] [2025-01-09 21:32:42,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:42,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:42,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:42,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:42,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:42,493 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 437 [2025-01-09 21:32:42,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 329 transitions, 670 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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) [2025-01-09 21:32:42,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:42,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 437 [2025-01-09 21:32:42,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:42,797 INFO L124 PetriNetUnfolderBase]: 748/1705 cut-off events. [2025-01-09 21:32:42,797 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-09 21:32:42,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2788 conditions, 1705 events. 748/1705 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8811 event pairs, 485 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 2716. Up to 1008 conditions per place. [2025-01-09 21:32:42,807 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 26 selfloop transitions, 2 changer transitions 0/328 dead transitions. [2025-01-09 21:32:42,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 328 transitions, 724 flow [2025-01-09 21:32:42,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:42,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:42,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1016 transitions. [2025-01-09 21:32:42,810 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7749809305873379 [2025-01-09 21:32:42,810 INFO L175 Difference]: Start difference. First operand has 326 places, 329 transitions, 670 flow. Second operand 3 states and 1016 transitions. [2025-01-09 21:32:42,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 328 transitions, 724 flow [2025-01-09 21:32:42,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 328 transitions, 720 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:42,816 INFO L231 Difference]: Finished difference. Result has 325 places, 328 transitions, 668 flow [2025-01-09 21:32:42,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=668, PETRI_PLACES=325, PETRI_TRANSITIONS=328} [2025-01-09 21:32:42,818 INFO L279 CegarLoopForPetriNet]: 413 programPoint places, -88 predicate places. [2025-01-09 21:32:42,818 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 328 transitions, 668 flow [2025-01-09 21:32:42,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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) [2025-01-09 21:32:42,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:42,819 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:42,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:32:42,819 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-01-09 21:32:42,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:42,820 INFO L85 PathProgramCache]: Analyzing trace with hash 2109782741, now seen corresponding path program 1 times [2025-01-09 21:32:42,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:42,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208407077] [2025-01-09 21:32:42,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:42,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:42,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 21:32:42,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 21:32:42,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:42,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:42,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:42,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:42,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208407077] [2025-01-09 21:32:42,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208407077] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:42,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:42,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:42,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775978161] [2025-01-09 21:32:42,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:42,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:42,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:42,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:42,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:42,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 437 [2025-01-09 21:32:42,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 328 transitions, 668 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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) [2025-01-09 21:32:42,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:42,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 437 [2025-01-09 21:32:42,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:43,235 INFO L124 PetriNetUnfolderBase]: 748/1704 cut-off events. [2025-01-09 21:32:43,235 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-09 21:32:43,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2787 conditions, 1704 events. 748/1704 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8836 event pairs, 485 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 2707. Up to 1008 conditions per place. [2025-01-09 21:32:43,243 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 26 selfloop transitions, 2 changer transitions 0/327 dead transitions. [2025-01-09 21:32:43,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 327 transitions, 722 flow [2025-01-09 21:32:43,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:43,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:43,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1016 transitions. [2025-01-09 21:32:43,245 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7749809305873379 [2025-01-09 21:32:43,245 INFO L175 Difference]: Start difference. First operand has 325 places, 328 transitions, 668 flow. Second operand 3 states and 1016 transitions. [2025-01-09 21:32:43,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 327 transitions, 722 flow [2025-01-09 21:32:43,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 327 transitions, 718 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:43,250 INFO L231 Difference]: Finished difference. Result has 324 places, 327 transitions, 666 flow [2025-01-09 21:32:43,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=666, PETRI_PLACES=324, PETRI_TRANSITIONS=327} [2025-01-09 21:32:43,252 INFO L279 CegarLoopForPetriNet]: 413 programPoint places, -89 predicate places. [2025-01-09 21:32:43,252 INFO L471 AbstractCegarLoop]: Abstraction has has 324 places, 327 transitions, 666 flow [2025-01-09 21:32:43,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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) [2025-01-09 21:32:43,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:43,253 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:43,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:32:43,253 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-01-09 21:32:43,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:43,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1622078026, now seen corresponding path program 1 times [2025-01-09 21:32:43,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:43,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366898422] [2025-01-09 21:32:43,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:43,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:43,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 21:32:43,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 21:32:43,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:43,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:43,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:43,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:43,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366898422] [2025-01-09 21:32:43,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366898422] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:43,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:43,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:43,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661998635] [2025-01-09 21:32:43,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:43,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:43,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:43,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:43,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:43,321 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 437 [2025-01-09 21:32:43,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 327 transitions, 666 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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) [2025-01-09 21:32:43,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:43,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 437 [2025-01-09 21:32:43,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:43,537 INFO L124 PetriNetUnfolderBase]: 748/1703 cut-off events. [2025-01-09 21:32:43,537 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-09 21:32:43,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2786 conditions, 1703 events. 748/1703 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8854 event pairs, 485 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 2698. Up to 1008 conditions per place. [2025-01-09 21:32:43,551 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 26 selfloop transitions, 2 changer transitions 0/326 dead transitions. [2025-01-09 21:32:43,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 326 transitions, 720 flow [2025-01-09 21:32:43,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:43,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:43,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1016 transitions. [2025-01-09 21:32:43,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7749809305873379 [2025-01-09 21:32:43,558 INFO L175 Difference]: Start difference. First operand has 324 places, 327 transitions, 666 flow. Second operand 3 states and 1016 transitions. [2025-01-09 21:32:43,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 326 transitions, 720 flow [2025-01-09 21:32:43,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 326 transitions, 716 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:43,561 INFO L231 Difference]: Finished difference. Result has 323 places, 326 transitions, 664 flow [2025-01-09 21:32:43,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=664, PETRI_PLACES=323, PETRI_TRANSITIONS=326} [2025-01-09 21:32:43,566 INFO L279 CegarLoopForPetriNet]: 413 programPoint places, -90 predicate places. [2025-01-09 21:32:43,566 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 326 transitions, 664 flow [2025-01-09 21:32:43,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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) [2025-01-09 21:32:43,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:43,567 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:43,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:32:43,567 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-01-09 21:32:43,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:43,568 INFO L85 PathProgramCache]: Analyzing trace with hash 932915522, now seen corresponding path program 1 times [2025-01-09 21:32:43,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:43,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625584019] [2025-01-09 21:32:43,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:43,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:43,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 21:32:43,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 21:32:43,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:43,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:43,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:43,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:43,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625584019] [2025-01-09 21:32:43,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625584019] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:43,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:43,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:43,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866194603] [2025-01-09 21:32:43,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:43,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:43,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:43,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:43,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:43,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 437 [2025-01-09 21:32:43,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 326 transitions, 664 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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) [2025-01-09 21:32:43,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:43,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 437 [2025-01-09 21:32:43,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:43,812 INFO L124 PetriNetUnfolderBase]: 748/1702 cut-off events. [2025-01-09 21:32:43,812 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-09 21:32:43,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2785 conditions, 1702 events. 748/1702 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8751 event pairs, 485 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 2689. Up to 1008 conditions per place. [2025-01-09 21:32:43,817 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 26 selfloop transitions, 2 changer transitions 0/325 dead transitions. [2025-01-09 21:32:43,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 325 transitions, 718 flow [2025-01-09 21:32:43,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:43,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:43,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1016 transitions. [2025-01-09 21:32:43,819 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7749809305873379 [2025-01-09 21:32:43,820 INFO L175 Difference]: Start difference. First operand has 323 places, 326 transitions, 664 flow. Second operand 3 states and 1016 transitions. [2025-01-09 21:32:43,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 325 transitions, 718 flow [2025-01-09 21:32:43,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 325 transitions, 714 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:43,823 INFO L231 Difference]: Finished difference. Result has 322 places, 325 transitions, 662 flow [2025-01-09 21:32:43,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=662, PETRI_PLACES=322, PETRI_TRANSITIONS=325} [2025-01-09 21:32:43,824 INFO L279 CegarLoopForPetriNet]: 413 programPoint places, -91 predicate places. [2025-01-09 21:32:43,824 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 325 transitions, 662 flow [2025-01-09 21:32:43,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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) [2025-01-09 21:32:43,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:43,824 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:43,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:32:43,825 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-01-09 21:32:43,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:43,825 INFO L85 PathProgramCache]: Analyzing trace with hash 991429533, now seen corresponding path program 1 times [2025-01-09 21:32:43,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:43,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975596399] [2025-01-09 21:32:43,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:43,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:43,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 21:32:43,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 21:32:43,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:43,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:43,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:43,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:43,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975596399] [2025-01-09 21:32:43,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975596399] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:43,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:43,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:43,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684205742] [2025-01-09 21:32:43,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:43,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:43,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:43,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:43,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:43,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 437 [2025-01-09 21:32:43,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 325 transitions, 662 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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) [2025-01-09 21:32:43,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:43,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 437 [2025-01-09 21:32:43,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:44,026 INFO L124 PetriNetUnfolderBase]: 748/1701 cut-off events. [2025-01-09 21:32:44,026 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-09 21:32:44,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2781 conditions, 1701 events. 748/1701 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8806 event pairs, 485 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 2677. Up to 1005 conditions per place. [2025-01-09 21:32:44,032 INFO L140 encePairwiseOnDemand]: 435/437 looper letters, 24 selfloop transitions, 1 changer transitions 0/324 dead transitions. [2025-01-09 21:32:44,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 324 transitions, 710 flow [2025-01-09 21:32:44,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:44,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:44,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1025 transitions. [2025-01-09 21:32:44,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7818459191456903 [2025-01-09 21:32:44,034 INFO L175 Difference]: Start difference. First operand has 322 places, 325 transitions, 662 flow. Second operand 3 states and 1025 transitions. [2025-01-09 21:32:44,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 324 transitions, 710 flow [2025-01-09 21:32:44,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 324 transitions, 706 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:44,038 INFO L231 Difference]: Finished difference. Result has 321 places, 324 transitions, 658 flow [2025-01-09 21:32:44,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=658, PETRI_PLACES=321, PETRI_TRANSITIONS=324} [2025-01-09 21:32:44,038 INFO L279 CegarLoopForPetriNet]: 413 programPoint places, -92 predicate places. [2025-01-09 21:32:44,039 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 324 transitions, 658 flow [2025-01-09 21:32:44,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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) [2025-01-09 21:32:44,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:44,039 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:44,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:32:44,039 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-01-09 21:32:44,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:44,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1248775352, now seen corresponding path program 1 times [2025-01-09 21:32:44,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:44,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722800302] [2025-01-09 21:32:44,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:44,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:44,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 21:32:44,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 21:32:44,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:44,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:44,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:44,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:44,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722800302] [2025-01-09 21:32:44,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722800302] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:44,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:44,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:32:44,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783934375] [2025-01-09 21:32:44,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:44,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:32:44,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:44,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:32:44,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:32:44,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 437 [2025-01-09 21:32:44,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 324 transitions, 658 flow. Second operand has 6 states, 6 states have (on average 310.5) internal successors, (1863), 6 states have internal predecessors, (1863), 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) [2025-01-09 21:32:44,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:44,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 437 [2025-01-09 21:32:44,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:44,787 INFO L124 PetriNetUnfolderBase]: 748/1699 cut-off events. [2025-01-09 21:32:44,787 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-09 21:32:44,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2801 conditions, 1699 events. 748/1699 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8792 event pairs, 485 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 2698. Up to 1020 conditions per place. [2025-01-09 21:32:44,793 INFO L140 encePairwiseOnDemand]: 425/437 looper letters, 38 selfloop transitions, 10 changer transitions 0/322 dead transitions. [2025-01-09 21:32:44,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 322 transitions, 750 flow [2025-01-09 21:32:44,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:32:44,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:32:44,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1904 transitions. [2025-01-09 21:32:44,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7261632341723875 [2025-01-09 21:32:44,797 INFO L175 Difference]: Start difference. First operand has 321 places, 324 transitions, 658 flow. Second operand 6 states and 1904 transitions. [2025-01-09 21:32:44,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 322 transitions, 750 flow [2025-01-09 21:32:44,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 322 transitions, 749 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:44,800 INFO L231 Difference]: Finished difference. Result has 323 places, 322 transitions, 673 flow [2025-01-09 21:32:44,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=673, PETRI_PLACES=323, PETRI_TRANSITIONS=322} [2025-01-09 21:32:44,801 INFO L279 CegarLoopForPetriNet]: 413 programPoint places, -90 predicate places. [2025-01-09 21:32:44,801 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 322 transitions, 673 flow [2025-01-09 21:32:44,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 310.5) internal successors, (1863), 6 states have internal predecessors, (1863), 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) [2025-01-09 21:32:44,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:44,802 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:44,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:32:44,802 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-01-09 21:32:44,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:44,802 INFO L85 PathProgramCache]: Analyzing trace with hash -450784193, now seen corresponding path program 1 times [2025-01-09 21:32:44,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:44,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967600872] [2025-01-09 21:32:44,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:44,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:44,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 21:32:44,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 21:32:44,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:44,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:44,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:44,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:44,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967600872] [2025-01-09 21:32:44,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967600872] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:44,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:44,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:44,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322811668] [2025-01-09 21:32:44,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:44,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:44,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:44,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:44,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:44,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 437 [2025-01-09 21:32:44,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 322 transitions, 673 flow. Second operand has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 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) [2025-01-09 21:32:44,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:44,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 437 [2025-01-09 21:32:44,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:45,017 INFO L124 PetriNetUnfolderBase]: 748/1698 cut-off events. [2025-01-09 21:32:45,017 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-09 21:32:45,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2789 conditions, 1698 events. 748/1698 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8825 event pairs, 485 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 2756. Up to 1007 conditions per place. [2025-01-09 21:32:45,024 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 25 selfloop transitions, 2 changer transitions 0/321 dead transitions. [2025-01-09 21:32:45,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 321 transitions, 725 flow [2025-01-09 21:32:45,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:45,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:45,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1018 transitions. [2025-01-09 21:32:45,029 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7765064836003052 [2025-01-09 21:32:45,029 INFO L175 Difference]: Start difference. First operand has 323 places, 322 transitions, 673 flow. Second operand 3 states and 1018 transitions. [2025-01-09 21:32:45,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 321 transitions, 725 flow [2025-01-09 21:32:45,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 321 transitions, 705 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:32:45,033 INFO L231 Difference]: Finished difference. Result has 319 places, 321 transitions, 655 flow [2025-01-09 21:32:45,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=319, PETRI_TRANSITIONS=321} [2025-01-09 21:32:45,033 INFO L279 CegarLoopForPetriNet]: 413 programPoint places, -94 predicate places. [2025-01-09 21:32:45,033 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 321 transitions, 655 flow [2025-01-09 21:32:45,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 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) [2025-01-09 21:32:45,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:45,034 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:45,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:32:45,034 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-01-09 21:32:45,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:45,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1722529932, now seen corresponding path program 1 times [2025-01-09 21:32:45,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:45,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121672543] [2025-01-09 21:32:45,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:45,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:45,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 21:32:45,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 21:32:45,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:45,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:45,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:45,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:45,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121672543] [2025-01-09 21:32:45,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121672543] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:45,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:45,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:45,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48213044] [2025-01-09 21:32:45,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:45,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:45,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:45,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:45,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:45,090 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 437 [2025-01-09 21:32:45,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 321 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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) [2025-01-09 21:32:45,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:45,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 437 [2025-01-09 21:32:45,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:45,339 INFO L124 PetriNetUnfolderBase]: 748/1697 cut-off events. [2025-01-09 21:32:45,339 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-09 21:32:45,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2778 conditions, 1697 events. 748/1697 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8766 event pairs, 485 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 2674. Up to 1005 conditions per place. [2025-01-09 21:32:45,351 INFO L140 encePairwiseOnDemand]: 435/437 looper letters, 24 selfloop transitions, 1 changer transitions 0/320 dead transitions. [2025-01-09 21:32:45,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 320 transitions, 703 flow [2025-01-09 21:32:45,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:45,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:45,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1025 transitions. [2025-01-09 21:32:45,354 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7818459191456903 [2025-01-09 21:32:45,354 INFO L175 Difference]: Start difference. First operand has 319 places, 321 transitions, 655 flow. Second operand 3 states and 1025 transitions. [2025-01-09 21:32:45,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 320 transitions, 703 flow [2025-01-09 21:32:45,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 320 transitions, 699 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:45,357 INFO L231 Difference]: Finished difference. Result has 318 places, 320 transitions, 651 flow [2025-01-09 21:32:45,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=651, PETRI_PLACES=318, PETRI_TRANSITIONS=320} [2025-01-09 21:32:45,358 INFO L279 CegarLoopForPetriNet]: 413 programPoint places, -95 predicate places. [2025-01-09 21:32:45,358 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 320 transitions, 651 flow [2025-01-09 21:32:45,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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) [2025-01-09 21:32:45,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:45,359 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:45,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:32:45,359 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-01-09 21:32:45,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:45,360 INFO L85 PathProgramCache]: Analyzing trace with hash -189881058, now seen corresponding path program 1 times [2025-01-09 21:32:45,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:45,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425009676] [2025-01-09 21:32:45,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:45,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:45,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 21:32:45,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 21:32:45,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:45,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:45,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:45,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:45,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425009676] [2025-01-09 21:32:45,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425009676] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:45,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:45,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:45,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872357789] [2025-01-09 21:32:45,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:45,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:45,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:45,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:45,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:45,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 437 [2025-01-09 21:32:45,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 320 transitions, 651 flow. Second operand has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 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) [2025-01-09 21:32:45,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:45,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 437 [2025-01-09 21:32:45,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:45,596 INFO L124 PetriNetUnfolderBase]: 748/1696 cut-off events. [2025-01-09 21:32:45,596 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-09 21:32:45,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2778 conditions, 1696 events. 748/1696 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8823 event pairs, 485 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 2674. Up to 1007 conditions per place. [2025-01-09 21:32:45,603 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 25 selfloop transitions, 2 changer transitions 0/319 dead transitions. [2025-01-09 21:32:45,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 319 transitions, 703 flow [2025-01-09 21:32:45,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:45,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:45,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1018 transitions. [2025-01-09 21:32:45,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7765064836003052 [2025-01-09 21:32:45,606 INFO L175 Difference]: Start difference. First operand has 318 places, 320 transitions, 651 flow. Second operand 3 states and 1018 transitions. [2025-01-09 21:32:45,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 319 transitions, 703 flow [2025-01-09 21:32:45,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 319 transitions, 702 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:45,609 INFO L231 Difference]: Finished difference. Result has 318 places, 319 transitions, 652 flow [2025-01-09 21:32:45,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=652, PETRI_PLACES=318, PETRI_TRANSITIONS=319} [2025-01-09 21:32:45,611 INFO L279 CegarLoopForPetriNet]: 413 programPoint places, -95 predicate places. [2025-01-09 21:32:45,611 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 319 transitions, 652 flow [2025-01-09 21:32:45,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 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) [2025-01-09 21:32:45,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:45,612 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:45,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:32:45,613 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-01-09 21:32:45,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:45,613 INFO L85 PathProgramCache]: Analyzing trace with hash 133589876, now seen corresponding path program 1 times [2025-01-09 21:32:45,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:45,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258928612] [2025-01-09 21:32:45,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:45,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:45,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 21:32:45,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 21:32:45,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:45,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:45,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:45,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:45,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258928612] [2025-01-09 21:32:45,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258928612] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:45,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:45,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:45,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451797673] [2025-01-09 21:32:45,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:45,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:45,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:45,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:45,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:45,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 437 [2025-01-09 21:32:45,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 319 transitions, 652 flow. Second operand has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 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) [2025-01-09 21:32:45,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:45,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 437 [2025-01-09 21:32:45,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:45,871 INFO L124 PetriNetUnfolderBase]: 748/1694 cut-off events. [2025-01-09 21:32:45,871 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-09 21:32:45,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2778 conditions, 1694 events. 748/1694 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8753 event pairs, 485 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 2674. Up to 1007 conditions per place. [2025-01-09 21:32:45,876 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 26 selfloop transitions, 1 changer transitions 0/317 dead transitions. [2025-01-09 21:32:45,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 317 transitions, 702 flow [2025-01-09 21:32:45,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:45,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:45,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1019 transitions. [2025-01-09 21:32:45,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7772692601067888 [2025-01-09 21:32:45,878 INFO L175 Difference]: Start difference. First operand has 318 places, 319 transitions, 652 flow. Second operand 3 states and 1019 transitions. [2025-01-09 21:32:45,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 317 transitions, 702 flow [2025-01-09 21:32:45,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 317 transitions, 698 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:45,883 INFO L231 Difference]: Finished difference. Result has 316 places, 317 transitions, 646 flow [2025-01-09 21:32:45,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=646, PETRI_PLACES=316, PETRI_TRANSITIONS=317} [2025-01-09 21:32:45,883 INFO L279 CegarLoopForPetriNet]: 413 programPoint places, -97 predicate places. [2025-01-09 21:32:45,883 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 317 transitions, 646 flow [2025-01-09 21:32:45,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 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) [2025-01-09 21:32:45,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:45,884 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:45,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:32:45,884 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-01-09 21:32:45,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:45,885 INFO L85 PathProgramCache]: Analyzing trace with hash -828392487, now seen corresponding path program 1 times [2025-01-09 21:32:45,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:45,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218048989] [2025-01-09 21:32:45,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:45,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:45,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 21:32:45,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 21:32:45,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:45,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:45,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:45,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:45,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218048989] [2025-01-09 21:32:45,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218048989] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:45,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:45,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:45,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035705755] [2025-01-09 21:32:45,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:45,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:45,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:45,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:45,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:45,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 437 [2025-01-09 21:32:45,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 317 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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) [2025-01-09 21:32:45,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:45,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 437 [2025-01-09 21:32:45,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:46,099 INFO L124 PetriNetUnfolderBase]: 748/1693 cut-off events. [2025-01-09 21:32:46,099 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-09 21:32:46,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2774 conditions, 1693 events. 748/1693 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8806 event pairs, 485 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 2670. Up to 1005 conditions per place. [2025-01-09 21:32:46,105 INFO L140 encePairwiseOnDemand]: 435/437 looper letters, 24 selfloop transitions, 1 changer transitions 0/316 dead transitions. [2025-01-09 21:32:46,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 316 transitions, 694 flow [2025-01-09 21:32:46,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:46,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:46,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1025 transitions. [2025-01-09 21:32:46,108 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7818459191456903 [2025-01-09 21:32:46,108 INFO L175 Difference]: Start difference. First operand has 316 places, 317 transitions, 646 flow. Second operand 3 states and 1025 transitions. [2025-01-09 21:32:46,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 316 transitions, 694 flow [2025-01-09 21:32:46,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 316 transitions, 693 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:46,111 INFO L231 Difference]: Finished difference. Result has 316 places, 316 transitions, 645 flow [2025-01-09 21:32:46,111 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=645, PETRI_PLACES=316, PETRI_TRANSITIONS=316} [2025-01-09 21:32:46,112 INFO L279 CegarLoopForPetriNet]: 413 programPoint places, -97 predicate places. [2025-01-09 21:32:46,112 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 316 transitions, 645 flow [2025-01-09 21:32:46,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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) [2025-01-09 21:32:46,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:46,113 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:46,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:32:46,113 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-01-09 21:32:46,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:46,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1516165306, now seen corresponding path program 1 times [2025-01-09 21:32:46,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:46,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592372810] [2025-01-09 21:32:46,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:46,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:46,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 21:32:46,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 21:32:46,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:46,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:46,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:46,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:46,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592372810] [2025-01-09 21:32:46,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592372810] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:46,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:46,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:46,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610910522] [2025-01-09 21:32:46,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:46,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:46,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:46,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:46,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:46,171 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 437 [2025-01-09 21:32:46,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 316 transitions, 645 flow. Second operand has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 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) [2025-01-09 21:32:46,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:46,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 437 [2025-01-09 21:32:46,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:46,334 INFO L124 PetriNetUnfolderBase]: 748/1691 cut-off events. [2025-01-09 21:32:46,334 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-09 21:32:46,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2775 conditions, 1691 events. 748/1691 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8767 event pairs, 485 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 2671. Up to 1007 conditions per place. [2025-01-09 21:32:46,341 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 26 selfloop transitions, 1 changer transitions 0/314 dead transitions. [2025-01-09 21:32:46,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 314 transitions, 695 flow [2025-01-09 21:32:46,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:46,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:46,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1019 transitions. [2025-01-09 21:32:46,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7772692601067888 [2025-01-09 21:32:46,343 INFO L175 Difference]: Start difference. First operand has 316 places, 316 transitions, 645 flow. Second operand 3 states and 1019 transitions. [2025-01-09 21:32:46,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 314 transitions, 695 flow [2025-01-09 21:32:46,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 314 transitions, 694 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:46,346 INFO L231 Difference]: Finished difference. Result has 315 places, 314 transitions, 642 flow [2025-01-09 21:32:46,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=642, PETRI_PLACES=315, PETRI_TRANSITIONS=314} [2025-01-09 21:32:46,347 INFO L279 CegarLoopForPetriNet]: 413 programPoint places, -98 predicate places. [2025-01-09 21:32:46,347 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 314 transitions, 642 flow [2025-01-09 21:32:46,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 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) [2025-01-09 21:32:46,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:46,347 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:46,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:32:46,347 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-01-09 21:32:46,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:46,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1425910537, now seen corresponding path program 1 times [2025-01-09 21:32:46,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:46,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919387663] [2025-01-09 21:32:46,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:46,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:46,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-09 21:32:46,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-09 21:32:46,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:46,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:46,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:46,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:46,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919387663] [2025-01-09 21:32:46,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919387663] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:46,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:46,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:46,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103736742] [2025-01-09 21:32:46,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:46,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:46,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:46,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:46,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:46,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 437 [2025-01-09 21:32:46,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 314 transitions, 642 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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) [2025-01-09 21:32:46,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:46,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 437 [2025-01-09 21:32:46,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:46,718 INFO L124 PetriNetUnfolderBase]: 1256/2818 cut-off events. [2025-01-09 21:32:46,718 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-01-09 21:32:46,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4644 conditions, 2818 events. 1256/2818 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 17621 event pairs, 792 based on Foata normal form. 0/2548 useless extension candidates. Maximal degree in co-relation 4540. Up to 1084 conditions per place. [2025-01-09 21:32:46,729 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 44 selfloop transitions, 2 changer transitions 0/334 dead transitions. [2025-01-09 21:32:46,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 334 transitions, 782 flow [2025-01-09 21:32:46,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:46,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:46,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1046 transitions. [2025-01-09 21:32:46,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7978642257818459 [2025-01-09 21:32:46,731 INFO L175 Difference]: Start difference. First operand has 315 places, 314 transitions, 642 flow. Second operand 3 states and 1046 transitions. [2025-01-09 21:32:46,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 334 transitions, 782 flow [2025-01-09 21:32:46,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 334 transitions, 781 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:46,736 INFO L231 Difference]: Finished difference. Result has 316 places, 314 transitions, 649 flow [2025-01-09 21:32:46,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=649, PETRI_PLACES=316, PETRI_TRANSITIONS=314} [2025-01-09 21:32:46,737 INFO L279 CegarLoopForPetriNet]: 413 programPoint places, -97 predicate places. [2025-01-09 21:32:46,737 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 314 transitions, 649 flow [2025-01-09 21:32:46,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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) [2025-01-09 21:32:46,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:46,738 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:46,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:32:46,738 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-01-09 21:32:46,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:46,739 INFO L85 PathProgramCache]: Analyzing trace with hash -205396117, now seen corresponding path program 1 times [2025-01-09 21:32:46,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:46,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287924956] [2025-01-09 21:32:46,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:46,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:46,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-09 21:32:46,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-09 21:32:46,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:46,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:46,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:46,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:46,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287924956] [2025-01-09 21:32:46,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287924956] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:46,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:46,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:46,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518302252] [2025-01-09 21:32:46,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:46,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:46,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:46,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:46,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:46,806 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 437 [2025-01-09 21:32:46,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 314 transitions, 649 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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) [2025-01-09 21:32:46,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:46,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 437 [2025-01-09 21:32:46,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:47,357 INFO L124 PetriNetUnfolderBase]: 1775/3943 cut-off events. [2025-01-09 21:32:47,357 INFO L125 PetriNetUnfolderBase]: For 398/398 co-relation queries the response was YES. [2025-01-09 21:32:47,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6870 conditions, 3943 events. 1775/3943 cut-off events. For 398/398 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 27340 event pairs, 700 based on Foata normal form. 0/3563 useless extension candidates. Maximal degree in co-relation 6765. Up to 1371 conditions per place. [2025-01-09 21:32:47,372 INFO L140 encePairwiseOnDemand]: 432/437 looper letters, 43 selfloop transitions, 5 changer transitions 0/335 dead transitions. [2025-01-09 21:32:47,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 335 transitions, 800 flow [2025-01-09 21:32:47,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:47,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:47,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1046 transitions. [2025-01-09 21:32:47,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7978642257818459 [2025-01-09 21:32:47,375 INFO L175 Difference]: Start difference. First operand has 316 places, 314 transitions, 649 flow. Second operand 3 states and 1046 transitions. [2025-01-09 21:32:47,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 335 transitions, 800 flow [2025-01-09 21:32:47,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 335 transitions, 797 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:47,378 INFO L231 Difference]: Finished difference. Result has 317 places, 316 transitions, 676 flow [2025-01-09 21:32:47,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=676, PETRI_PLACES=317, PETRI_TRANSITIONS=316} [2025-01-09 21:32:47,379 INFO L279 CegarLoopForPetriNet]: 413 programPoint places, -96 predicate places. [2025-01-09 21:32:47,379 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 316 transitions, 676 flow [2025-01-09 21:32:47,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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) [2025-01-09 21:32:47,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:47,379 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:47,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:32:47,380 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-01-09 21:32:47,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:47,380 INFO L85 PathProgramCache]: Analyzing trace with hash -202040452, now seen corresponding path program 1 times [2025-01-09 21:32:47,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:47,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153355221] [2025-01-09 21:32:47,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:47,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:47,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-09 21:32:47,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-09 21:32:47,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:47,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:47,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:47,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:47,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153355221] [2025-01-09 21:32:47,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153355221] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:47,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:47,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:47,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363386852] [2025-01-09 21:32:47,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:47,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:47,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:47,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:47,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:47,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 437 [2025-01-09 21:32:47,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 316 transitions, 676 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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) [2025-01-09 21:32:47,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:47,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 437 [2025-01-09 21:32:47,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:48,547 INFO L124 PetriNetUnfolderBase]: 3088/6809 cut-off events. [2025-01-09 21:32:48,547 INFO L125 PetriNetUnfolderBase]: For 2116/2116 co-relation queries the response was YES. [2025-01-09 21:32:48,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12983 conditions, 6809 events. 3088/6809 cut-off events. For 2116/2116 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 54912 event pairs, 1838 based on Foata normal form. 0/6120 useless extension candidates. Maximal degree in co-relation 12878. Up to 2556 conditions per place. [2025-01-09 21:32:48,580 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 52 selfloop transitions, 2 changer transitions 0/340 dead transitions. [2025-01-09 21:32:48,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 340 transitions, 866 flow [2025-01-09 21:32:48,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:48,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:48,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1046 transitions. [2025-01-09 21:32:48,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7978642257818459 [2025-01-09 21:32:48,582 INFO L175 Difference]: Start difference. First operand has 317 places, 316 transitions, 676 flow. Second operand 3 states and 1046 transitions. [2025-01-09 21:32:48,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 340 transitions, 866 flow [2025-01-09 21:32:48,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 340 transitions, 857 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:48,589 INFO L231 Difference]: Finished difference. Result has 318 places, 316 transitions, 679 flow [2025-01-09 21:32:48,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=679, PETRI_PLACES=318, PETRI_TRANSITIONS=316} [2025-01-09 21:32:48,590 INFO L279 CegarLoopForPetriNet]: 413 programPoint places, -95 predicate places. [2025-01-09 21:32:48,590 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 316 transitions, 679 flow [2025-01-09 21:32:48,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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) [2025-01-09 21:32:48,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:48,591 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:48,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:32:48,591 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-01-09 21:32:48,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:48,591 INFO L85 PathProgramCache]: Analyzing trace with hash -887283365, now seen corresponding path program 1 times [2025-01-09 21:32:48,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:48,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183910439] [2025-01-09 21:32:48,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:48,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:48,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-09 21:32:48,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-09 21:32:48,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:48,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:48,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:48,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:48,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183910439] [2025-01-09 21:32:48,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183910439] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:48,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:48,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:48,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312287858] [2025-01-09 21:32:48,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:48,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:48,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:48,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:48,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:48,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 437 [2025-01-09 21:32:48,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 316 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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) [2025-01-09 21:32:48,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:48,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 437 [2025-01-09 21:32:48,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:49,642 INFO L124 PetriNetUnfolderBase]: 4031/9239 cut-off events. [2025-01-09 21:32:49,642 INFO L125 PetriNetUnfolderBase]: For 3011/3011 co-relation queries the response was YES. [2025-01-09 21:32:49,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17480 conditions, 9239 events. 4031/9239 cut-off events. For 3011/3011 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 80656 event pairs, 1475 based on Foata normal form. 0/8245 useless extension candidates. Maximal degree in co-relation 17373. Up to 3078 conditions per place. [2025-01-09 21:32:49,684 INFO L140 encePairwiseOnDemand]: 432/437 looper letters, 51 selfloop transitions, 5 changer transitions 0/341 dead transitions. [2025-01-09 21:32:49,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 341 transitions, 876 flow [2025-01-09 21:32:49,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:49,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:49,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1046 transitions. [2025-01-09 21:32:49,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7978642257818459 [2025-01-09 21:32:49,686 INFO L175 Difference]: Start difference. First operand has 318 places, 316 transitions, 679 flow. Second operand 3 states and 1046 transitions. [2025-01-09 21:32:49,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 341 transitions, 876 flow [2025-01-09 21:32:49,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 341 transitions, 873 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:49,690 INFO L231 Difference]: Finished difference. Result has 319 places, 318 transitions, 706 flow [2025-01-09 21:32:49,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=706, PETRI_PLACES=319, PETRI_TRANSITIONS=318} [2025-01-09 21:32:49,690 INFO L279 CegarLoopForPetriNet]: 413 programPoint places, -94 predicate places. [2025-01-09 21:32:49,690 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 318 transitions, 706 flow [2025-01-09 21:32:49,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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) [2025-01-09 21:32:49,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:49,691 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:49,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:32:49,691 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-01-09 21:32:49,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:49,692 INFO L85 PathProgramCache]: Analyzing trace with hash 2030185326, now seen corresponding path program 1 times [2025-01-09 21:32:49,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:49,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897999577] [2025-01-09 21:32:49,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:49,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:49,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-01-09 21:32:49,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-01-09 21:32:49,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:49,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:49,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:49,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:49,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897999577] [2025-01-09 21:32:49,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897999577] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:49,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:49,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:49,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777465807] [2025-01-09 21:32:49,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:49,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:49,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:49,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:49,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:49,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 334 out of 437 [2025-01-09 21:32:49,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 318 transitions, 706 flow. Second operand has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 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) [2025-01-09 21:32:49,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:49,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 334 of 437 [2025-01-09 21:32:49,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:50,915 INFO L124 PetriNetUnfolderBase]: 4031/8982 cut-off events. [2025-01-09 21:32:50,915 INFO L125 PetriNetUnfolderBase]: For 4737/4737 co-relation queries the response was YES. [2025-01-09 21:32:50,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18658 conditions, 8982 events. 4031/8982 cut-off events. For 4737/4737 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 77688 event pairs, 2297 based on Foata normal form. 16/8070 useless extension candidates. Maximal degree in co-relation 18552. Up to 5475 conditions per place. [2025-01-09 21:32:50,936 INFO L140 encePairwiseOnDemand]: 435/437 looper letters, 0 selfloop transitions, 0 changer transitions 317/317 dead transitions. [2025-01-09 21:32:50,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 317 transitions, 766 flow [2025-01-09 21:32:50,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:50,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:50,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1026 transitions. [2025-01-09 21:32:50,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.782608695652174 [2025-01-09 21:32:50,941 INFO L175 Difference]: Start difference. First operand has 319 places, 318 transitions, 706 flow. Second operand 3 states and 1026 transitions. [2025-01-09 21:32:50,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 317 transitions, 766 flow [2025-01-09 21:32:50,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 317 transitions, 761 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:50,954 INFO L231 Difference]: Finished difference. Result has 319 places, 0 transitions, 0 flow [2025-01-09 21:32:50,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=319, PETRI_TRANSITIONS=0} [2025-01-09 21:32:50,955 INFO L279 CegarLoopForPetriNet]: 413 programPoint places, -94 predicate places. [2025-01-09 21:32:50,955 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 0 transitions, 0 flow [2025-01-09 21:32:50,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 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) [2025-01-09 21:32:50,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (168 of 169 remaining) [2025-01-09 21:32:50,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (167 of 169 remaining) [2025-01-09 21:32:50,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (166 of 169 remaining) [2025-01-09 21:32:50,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (165 of 169 remaining) [2025-01-09 21:32:50,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (164 of 169 remaining) [2025-01-09 21:32:50,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (163 of 169 remaining) [2025-01-09 21:32:50,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (162 of 169 remaining) [2025-01-09 21:32:50,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (161 of 169 remaining) [2025-01-09 21:32:50,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (160 of 169 remaining) [2025-01-09 21:32:50,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (159 of 169 remaining) [2025-01-09 21:32:50,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (158 of 169 remaining) [2025-01-09 21:32:50,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (157 of 169 remaining) [2025-01-09 21:32:50,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (156 of 169 remaining) [2025-01-09 21:32:50,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (155 of 169 remaining) [2025-01-09 21:32:50,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (154 of 169 remaining) [2025-01-09 21:32:50,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (153 of 169 remaining) [2025-01-09 21:32:50,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (152 of 169 remaining) [2025-01-09 21:32:50,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (151 of 169 remaining) [2025-01-09 21:32:50,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (150 of 169 remaining) [2025-01-09 21:32:50,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (149 of 169 remaining) [2025-01-09 21:32:50,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (148 of 169 remaining) [2025-01-09 21:32:50,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (147 of 169 remaining) [2025-01-09 21:32:50,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (146 of 169 remaining) [2025-01-09 21:32:50,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (145 of 169 remaining) [2025-01-09 21:32:50,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (144 of 169 remaining) [2025-01-09 21:32:50,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (143 of 169 remaining) [2025-01-09 21:32:50,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (142 of 169 remaining) [2025-01-09 21:32:50,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (141 of 169 remaining) [2025-01-09 21:32:50,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (140 of 169 remaining) [2025-01-09 21:32:50,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (139 of 169 remaining) [2025-01-09 21:32:50,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (138 of 169 remaining) [2025-01-09 21:32:50,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (137 of 169 remaining) [2025-01-09 21:32:50,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (136 of 169 remaining) [2025-01-09 21:32:50,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (135 of 169 remaining) [2025-01-09 21:32:50,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (134 of 169 remaining) [2025-01-09 21:32:50,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (133 of 169 remaining) [2025-01-09 21:32:50,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (132 of 169 remaining) [2025-01-09 21:32:50,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (131 of 169 remaining) [2025-01-09 21:32:50,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (130 of 169 remaining) [2025-01-09 21:32:50,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (129 of 169 remaining) [2025-01-09 21:32:50,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (128 of 169 remaining) [2025-01-09 21:32:50,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (127 of 169 remaining) [2025-01-09 21:32:50,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (126 of 169 remaining) [2025-01-09 21:32:50,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (125 of 169 remaining) [2025-01-09 21:32:50,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (124 of 169 remaining) [2025-01-09 21:32:50,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (123 of 169 remaining) [2025-01-09 21:32:50,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (122 of 169 remaining) [2025-01-09 21:32:50,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (121 of 169 remaining) [2025-01-09 21:32:50,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (120 of 169 remaining) [2025-01-09 21:32:50,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (119 of 169 remaining) [2025-01-09 21:32:50,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (118 of 169 remaining) [2025-01-09 21:32:50,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (117 of 169 remaining) [2025-01-09 21:32:50,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (116 of 169 remaining) [2025-01-09 21:32:50,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (115 of 169 remaining) [2025-01-09 21:32:50,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (114 of 169 remaining) [2025-01-09 21:32:50,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (113 of 169 remaining) [2025-01-09 21:32:50,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (112 of 169 remaining) [2025-01-09 21:32:50,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (111 of 169 remaining) [2025-01-09 21:32:50,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (110 of 169 remaining) [2025-01-09 21:32:50,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (109 of 169 remaining) [2025-01-09 21:32:50,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (108 of 169 remaining) [2025-01-09 21:32:50,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (107 of 169 remaining) [2025-01-09 21:32:50,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (106 of 169 remaining) [2025-01-09 21:32:50,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (105 of 169 remaining) [2025-01-09 21:32:50,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (104 of 169 remaining) [2025-01-09 21:32:50,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (103 of 169 remaining) [2025-01-09 21:32:50,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (102 of 169 remaining) [2025-01-09 21:32:50,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (101 of 169 remaining) [2025-01-09 21:32:50,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (100 of 169 remaining) [2025-01-09 21:32:50,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (99 of 169 remaining) [2025-01-09 21:32:50,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (98 of 169 remaining) [2025-01-09 21:32:50,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (97 of 169 remaining) [2025-01-09 21:32:50,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (96 of 169 remaining) [2025-01-09 21:32:50,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (95 of 169 remaining) [2025-01-09 21:32:50,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (94 of 169 remaining) [2025-01-09 21:32:50,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (93 of 169 remaining) [2025-01-09 21:32:50,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (92 of 169 remaining) [2025-01-09 21:32:50,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (91 of 169 remaining) [2025-01-09 21:32:50,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (90 of 169 remaining) [2025-01-09 21:32:50,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (89 of 169 remaining) [2025-01-09 21:32:50,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (88 of 169 remaining) [2025-01-09 21:32:50,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (87 of 169 remaining) [2025-01-09 21:32:50,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (86 of 169 remaining) [2025-01-09 21:32:50,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (85 of 169 remaining) [2025-01-09 21:32:50,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (84 of 169 remaining) [2025-01-09 21:32:50,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (83 of 169 remaining) [2025-01-09 21:32:50,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (82 of 169 remaining) [2025-01-09 21:32:50,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (81 of 169 remaining) [2025-01-09 21:32:50,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (80 of 169 remaining) [2025-01-09 21:32:50,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (79 of 169 remaining) [2025-01-09 21:32:50,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (78 of 169 remaining) [2025-01-09 21:32:50,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (77 of 169 remaining) [2025-01-09 21:32:50,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (76 of 169 remaining) [2025-01-09 21:32:50,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (75 of 169 remaining) [2025-01-09 21:32:50,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (74 of 169 remaining) [2025-01-09 21:32:50,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (73 of 169 remaining) [2025-01-09 21:32:50,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (72 of 169 remaining) [2025-01-09 21:32:50,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (71 of 169 remaining) [2025-01-09 21:32:50,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (70 of 169 remaining) [2025-01-09 21:32:50,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (69 of 169 remaining) [2025-01-09 21:32:50,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (68 of 169 remaining) [2025-01-09 21:32:50,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (67 of 169 remaining) [2025-01-09 21:32:50,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (66 of 169 remaining) [2025-01-09 21:32:50,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (65 of 169 remaining) [2025-01-09 21:32:50,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (64 of 169 remaining) [2025-01-09 21:32:50,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (63 of 169 remaining) [2025-01-09 21:32:50,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (62 of 169 remaining) [2025-01-09 21:32:50,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (61 of 169 remaining) [2025-01-09 21:32:50,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (60 of 169 remaining) [2025-01-09 21:32:50,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (59 of 169 remaining) [2025-01-09 21:32:50,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (58 of 169 remaining) [2025-01-09 21:32:50,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (57 of 169 remaining) [2025-01-09 21:32:50,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (56 of 169 remaining) [2025-01-09 21:32:50,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (55 of 169 remaining) [2025-01-09 21:32:50,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (54 of 169 remaining) [2025-01-09 21:32:50,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (53 of 169 remaining) [2025-01-09 21:32:50,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (52 of 169 remaining) [2025-01-09 21:32:50,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (51 of 169 remaining) [2025-01-09 21:32:50,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (50 of 169 remaining) [2025-01-09 21:32:50,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (49 of 169 remaining) [2025-01-09 21:32:50,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (48 of 169 remaining) [2025-01-09 21:32:50,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (47 of 169 remaining) [2025-01-09 21:32:50,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (46 of 169 remaining) [2025-01-09 21:32:50,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (45 of 169 remaining) [2025-01-09 21:32:50,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (44 of 169 remaining) [2025-01-09 21:32:50,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (43 of 169 remaining) [2025-01-09 21:32:50,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (42 of 169 remaining) [2025-01-09 21:32:50,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (41 of 169 remaining) [2025-01-09 21:32:50,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (40 of 169 remaining) [2025-01-09 21:32:50,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (39 of 169 remaining) [2025-01-09 21:32:50,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (38 of 169 remaining) [2025-01-09 21:32:50,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (37 of 169 remaining) [2025-01-09 21:32:50,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (36 of 169 remaining) [2025-01-09 21:32:50,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (35 of 169 remaining) [2025-01-09 21:32:50,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (34 of 169 remaining) [2025-01-09 21:32:50,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (33 of 169 remaining) [2025-01-09 21:32:50,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (32 of 169 remaining) [2025-01-09 21:32:50,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (31 of 169 remaining) [2025-01-09 21:32:50,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (30 of 169 remaining) [2025-01-09 21:32:50,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (29 of 169 remaining) [2025-01-09 21:32:50,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (28 of 169 remaining) [2025-01-09 21:32:50,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (27 of 169 remaining) [2025-01-09 21:32:50,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (26 of 169 remaining) [2025-01-09 21:32:50,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (25 of 169 remaining) [2025-01-09 21:32:50,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (24 of 169 remaining) [2025-01-09 21:32:50,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (23 of 169 remaining) [2025-01-09 21:32:50,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (22 of 169 remaining) [2025-01-09 21:32:50,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (21 of 169 remaining) [2025-01-09 21:32:50,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (20 of 169 remaining) [2025-01-09 21:32:50,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (19 of 169 remaining) [2025-01-09 21:32:50,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (18 of 169 remaining) [2025-01-09 21:32:50,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (17 of 169 remaining) [2025-01-09 21:32:50,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (16 of 169 remaining) [2025-01-09 21:32:50,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (15 of 169 remaining) [2025-01-09 21:32:50,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (14 of 169 remaining) [2025-01-09 21:32:50,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (13 of 169 remaining) [2025-01-09 21:32:50,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (12 of 169 remaining) [2025-01-09 21:32:50,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (11 of 169 remaining) [2025-01-09 21:32:50,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (10 of 169 remaining) [2025-01-09 21:32:50,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (9 of 169 remaining) [2025-01-09 21:32:50,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (8 of 169 remaining) [2025-01-09 21:32:50,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (7 of 169 remaining) [2025-01-09 21:32:50,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (6 of 169 remaining) [2025-01-09 21:32:50,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (5 of 169 remaining) [2025-01-09 21:32:50,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (4 of 169 remaining) [2025-01-09 21:32:50,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (3 of 169 remaining) [2025-01-09 21:32:50,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (2 of 169 remaining) [2025-01-09 21:32:50,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (1 of 169 remaining) [2025-01-09 21:32:50,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (0 of 169 remaining) [2025-01-09 21:32:50,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:32:50,981 INFO L422 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] [2025-01-09 21:32:50,991 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:32:50,991 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:32:50,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:32:50 BasicIcfg [2025-01-09 21:32:50,999 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:32:51,000 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:32:51,000 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:32:51,000 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:32:51,001 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:39" (3/4) ... [2025-01-09 21:32:51,005 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:32:51,010 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:32:51,010 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:32:51,010 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:32:51,011 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-01-09 21:32:51,021 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2025-01-09 21:32:51,025 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:32:51,025 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 21:32:51,025 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:32:51,137 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:32:51,138 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:32:51,138 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:32:51,139 INFO L158 Benchmark]: Toolchain (without parser) took 12829.06ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 129.4MB in the beginning and 847.0MB in the end (delta: -717.6MB). Peak memory consumption was 497.9MB. Max. memory is 16.1GB. [2025-01-09 21:32:51,140 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 114.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:32:51,140 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.07ms. Allocated memory is still 167.8MB. Free memory was 129.4MB in the beginning and 115.1MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:32:51,140 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.02ms. Allocated memory is still 167.8MB. Free memory was 115.1MB in the beginning and 111.5MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:32:51,140 INFO L158 Benchmark]: Boogie Preprocessor took 28.94ms. Allocated memory is still 167.8MB. Free memory was 111.5MB in the beginning and 108.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:32:51,141 INFO L158 Benchmark]: RCFGBuilder took 1252.47ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 98.3MB in the end (delta: 10.5MB). Peak memory consumption was 88.5MB. Max. memory is 16.1GB. [2025-01-09 21:32:51,141 INFO L158 Benchmark]: TraceAbstraction took 11145.85ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 97.4MB in the beginning and 855.4MB in the end (delta: -758.0MB). Peak memory consumption was 700.5MB. Max. memory is 16.1GB. [2025-01-09 21:32:51,141 INFO L158 Benchmark]: Witness Printer took 138.44ms. Allocated memory is still 1.4GB. Free memory was 855.4MB in the beginning and 847.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:32:51,142 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 114.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.07ms. Allocated memory is still 167.8MB. Free memory was 129.4MB in the beginning and 115.1MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.02ms. Allocated memory is still 167.8MB. Free memory was 115.1MB in the beginning and 111.5MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.94ms. Allocated memory is still 167.8MB. Free memory was 111.5MB in the beginning and 108.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1252.47ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 98.3MB in the end (delta: 10.5MB). Peak memory consumption was 88.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11145.85ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 97.4MB in the beginning and 855.4MB in the end (delta: -758.0MB). Peak memory consumption was 700.5MB. Max. memory is 16.1GB. * Witness Printer took 138.44ms. Allocated memory is still 1.4GB. Free memory was 855.4MB in the beginning and 847.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 130]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 165]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 165]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 153]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: 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 9 procedures, 529 locations, 169 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: 11.0s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 504 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 265 mSDsluCounter, 88 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1347 IncrementalHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 88 mSDtfsCounter, 1347 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=856occurred in iteration=0, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2754 NumberOfCodeBlocks, 2754 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2732 ConstructedInterpolants, 0 QuantifiedInterpolants, 2889 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 95 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:32:51,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE