./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_19-nested_nr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/09-regions_19-nested_nr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 280c30f41ca2c9f436a7f638405780966a2e3953046793cbc3431544593edf02 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:09:30,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:09:30,617 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:09:30,624 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:09:30,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:09:30,643 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:09:30,643 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:09:30,643 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:09:30,643 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:09:30,643 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:09:30,644 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:09:30,644 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:09:30,644 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:09:30,644 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:09:30,645 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:09:30,645 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:09:30,645 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:09:30,645 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:09:30,645 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:09:30,645 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:09:30,646 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:09:30,646 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:09:30,646 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:09:30,646 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:09:30,646 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:09:30,646 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:09:30,646 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:09:30,646 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:09:30,646 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:09:30,646 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:09:30,646 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:09:30,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:09:30,647 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:09:30,647 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:09:30,647 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:09:30,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:09:30,647 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:09:30,647 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:09:30,647 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:09:30,647 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:09:30,647 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:09:30,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:09:30,648 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:09:30,648 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:09:30,648 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:09:30,648 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/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 -> 280c30f41ca2c9f436a7f638405780966a2e3953046793cbc3431544593edf02 [2025-04-29 11:09:30,851 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:09:30,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:09:30,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:09:30,859 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:09:30,859 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:09:30,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_19-nested_nr.c [2025-04-29 11:09:32,121 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d91a72e1a/9defbe911bea49c9815f856bac55eb41/FLAG4fc408283 [2025-04-29 11:09:32,314 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:09:32,314 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_19-nested_nr.c [2025-04-29 11:09:32,315 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:09:32,315 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:09:32,315 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:09:32,319 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d91a72e1a/9defbe911bea49c9815f856bac55eb41/FLAG4fc408283 [2025-04-29 11:09:33,172 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d91a72e1a/9defbe911bea49c9815f856bac55eb41 [2025-04-29 11:09:33,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:09:33,175 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:09:33,176 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:09:33,176 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:09:33,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:09:33,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:09:33" (1/1) ... [2025-04-29 11:09:33,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a55fb2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:33, skipping insertion in model container [2025-04-29 11:09:33,179 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:09:33" (1/1) ... [2025-04-29 11:09:33,188 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:09:33,360 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:09:33,372 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:09:33,410 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:09:33,425 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:09:33,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:33 WrapperNode [2025-04-29 11:09:33,425 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:09:33,426 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:09:33,426 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:09:33,426 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:09:33,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:33" (1/1) ... [2025-04-29 11:09:33,438 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:33" (1/1) ... [2025-04-29 11:09:33,477 INFO L138 Inliner]: procedures = 20, calls = 47, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 252 [2025-04-29 11:09:33,477 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:09:33,478 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:09:33,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:09:33,478 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:09:33,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:33" (1/1) ... [2025-04-29 11:09:33,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:33" (1/1) ... [2025-04-29 11:09:33,491 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:33" (1/1) ... [2025-04-29 11:09:33,491 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:33" (1/1) ... [2025-04-29 11:09:33,509 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:33" (1/1) ... [2025-04-29 11:09:33,511 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:33" (1/1) ... [2025-04-29 11:09:33,514 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:33" (1/1) ... [2025-04-29 11:09:33,515 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:33" (1/1) ... [2025-04-29 11:09:33,517 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:33" (1/1) ... [2025-04-29 11:09:33,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:09:33,529 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:09:33,529 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:09:33,529 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:09:33,530 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:33" (1/1) ... [2025-04-29 11:09:33,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:09:33,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:33,558 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:09:33,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:09:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-04-29 11:09:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-04-29 11:09:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:09:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:09:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-29 11:09:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-04-29 11:09:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:09:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:09:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:09:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:09:33,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:09:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:09:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:09:33,579 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:09:33,580 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:09:33,653 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:09:33,654 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:09:34,072 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:09:34,072 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:09:34,090 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:09:34,091 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:09:34,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:09:34 BoogieIcfgContainer [2025-04-29 11:09:34,091 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:09:34,093 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:09:34,093 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:09:34,097 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:09:34,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:09:33" (1/3) ... [2025-04-29 11:09:34,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4becb01f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:09:34, skipping insertion in model container [2025-04-29 11:09:34,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:33" (2/3) ... [2025-04-29 11:09:34,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4becb01f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:09:34, skipping insertion in model container [2025-04-29 11:09:34,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:09:34" (3/3) ... [2025-04-29 11:09:34,100 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_19-nested_nr.c [2025-04-29 11:09:34,111 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:09:34,113 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_19-nested_nr.c that has 2 procedures, 294 locations, 296 edges, 1 initial locations, 2 loop locations, and 18 error locations. [2025-04-29 11:09:34,113 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:09:34,203 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:09:34,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 297 places, 297 transitions, 598 flow [2025-04-29 11:09:34,314 INFO L116 PetriNetUnfolderBase]: 4/296 cut-off events. [2025-04-29 11:09:34,317 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:09:34,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 296 events. 4/296 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 398 event pairs, 0 based on Foata normal form. 0/274 useless extension candidates. Maximal degree in co-relation 168. Up to 2 conditions per place. [2025-04-29 11:09:34,322 INFO L82 GeneralOperation]: Start removeDead. Operand has 297 places, 297 transitions, 598 flow [2025-04-29 11:09:34,326 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 296 places, 296 transitions, 595 flow [2025-04-29 11:09:34,333 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:09:34,344 INFO L340 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;@22c9adf7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:09:34,344 INFO L341 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-04-29 11:09:34,363 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:09:34,364 INFO L116 PetriNetUnfolderBase]: 3/89 cut-off events. [2025-04-29 11:09:34,364 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:09:34,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:34,365 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] [2025-04-29 11:09:34,365 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:34,369 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:34,369 INFO L85 PathProgramCache]: Analyzing trace with hash 441448466, now seen corresponding path program 1 times [2025-04-29 11:09:34,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:34,375 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597321905] [2025-04-29 11:09:34,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:34,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:34,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-29 11:09:34,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-29 11:09:34,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:34,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:34,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:34,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:34,608 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597321905] [2025-04-29 11:09:34,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597321905] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:34,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:34,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:09:34,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199604381] [2025-04-29 11:09:34,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:34,620 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:09:34,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:34,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:09:34,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:09:34,665 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 284 out of 297 [2025-04-29 11:09:34,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 296 transitions, 595 flow. Second operand has 3 states, 3 states have (on average 285.3333333333333) internal successors, (856), 3 states have internal predecessors, (856), 0 states have call successors, (0), 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-04-29 11:09:34,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:34,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 284 of 297 [2025-04-29 11:09:34,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:34,749 INFO L116 PetriNetUnfolderBase]: 8/374 cut-off events. [2025-04-29 11:09:34,749 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:09:34,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 374 events. 8/374 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 872 event pairs, 6 based on Foata normal form. 5/348 useless extension candidates. Maximal degree in co-relation 219. Up to 24 conditions per place. [2025-04-29 11:09:34,752 INFO L140 encePairwiseOnDemand]: 292/297 looper letters, 10 selfloop transitions, 2 changer transitions 1/295 dead transitions. [2025-04-29 11:09:34,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 295 transitions, 617 flow [2025-04-29 11:09:34,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:09:34,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:09:34,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 867 transitions. [2025-04-29 11:09:34,769 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9730639730639731 [2025-04-29 11:09:34,771 INFO L175 Difference]: Start difference. First operand has 296 places, 296 transitions, 595 flow. Second operand 3 states and 867 transitions. [2025-04-29 11:09:34,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 295 transitions, 617 flow [2025-04-29 11:09:34,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 295 transitions, 616 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:09:34,785 INFO L231 Difference]: Finished difference. Result has 298 places, 294 transitions, 600 flow [2025-04-29 11:09:34,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=600, PETRI_PLACES=298, PETRI_TRANSITIONS=294} [2025-04-29 11:09:34,790 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 2 predicate places. [2025-04-29 11:09:34,791 INFO L485 AbstractCegarLoop]: Abstraction has has 298 places, 294 transitions, 600 flow [2025-04-29 11:09:34,791 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 285.3333333333333) internal successors, (856), 3 states have internal predecessors, (856), 0 states have call successors, (0), 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-04-29 11:09:34,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:34,791 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] [2025-04-29 11:09:34,792 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:09:34,792 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:34,792 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:34,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1068360239, now seen corresponding path program 1 times [2025-04-29 11:09:34,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:34,793 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610580257] [2025-04-29 11:09:34,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:34,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:34,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-29 11:09:34,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-29 11:09:34,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:34,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:34,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:34,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:34,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610580257] [2025-04-29 11:09:34,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610580257] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:34,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615927281] [2025-04-29 11:09:34,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:34,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:34,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:34,977 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:09:34,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:09:35,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-29 11:09:35,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-29 11:09:35,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:35,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:35,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:09:35,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:35,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:35,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:09:35,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:35,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615927281] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:09:35,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:09:35,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-29 11:09:35,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014367303] [2025-04-29 11:09:35,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:09:35,149 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:09:35,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:35,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:09:35,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:09:35,177 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 297 [2025-04-29 11:09:35,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 294 transitions, 600 flow. Second operand has 10 states, 10 states have (on average 282.8) internal successors, (2828), 10 states have internal predecessors, (2828), 0 states have call successors, (0), 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-04-29 11:09:35,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:35,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 297 [2025-04-29 11:09:35,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:35,277 INFO L116 PetriNetUnfolderBase]: 8/380 cut-off events. [2025-04-29 11:09:35,277 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:09:35,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 427 conditions, 380 events. 8/380 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 868 event pairs, 6 based on Foata normal form. 2/352 useless extension candidates. Maximal degree in co-relation 384. Up to 24 conditions per place. [2025-04-29 11:09:35,279 INFO L140 encePairwiseOnDemand]: 291/297 looper letters, 14 selfloop transitions, 9 changer transitions 0/302 dead transitions. [2025-04-29 11:09:35,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 302 transitions, 664 flow [2025-04-29 11:09:35,280 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:09:35,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:09:35,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2554 transitions. [2025-04-29 11:09:35,284 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.955480733258511 [2025-04-29 11:09:35,284 INFO L175 Difference]: Start difference. First operand has 298 places, 294 transitions, 600 flow. Second operand 9 states and 2554 transitions. [2025-04-29 11:09:35,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 302 transitions, 664 flow [2025-04-29 11:09:35,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 302 transitions, 662 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:09:35,288 INFO L231 Difference]: Finished difference. Result has 307 places, 300 transitions, 648 flow [2025-04-29 11:09:35,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=648, PETRI_PLACES=307, PETRI_TRANSITIONS=300} [2025-04-29 11:09:35,289 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 11 predicate places. [2025-04-29 11:09:35,290 INFO L485 AbstractCegarLoop]: Abstraction has has 307 places, 300 transitions, 648 flow [2025-04-29 11:09:35,291 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 282.8) internal successors, (2828), 10 states have internal predecessors, (2828), 0 states have call successors, (0), 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-04-29 11:09:35,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:35,291 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-29 11:09:35,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:09:35,492 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:35,492 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:35,492 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:35,492 INFO L85 PathProgramCache]: Analyzing trace with hash 710437903, now seen corresponding path program 2 times [2025-04-29 11:09:35,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:35,493 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660987758] [2025-04-29 11:09:35,493 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:09:35,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:35,506 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-04-29 11:09:35,517 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 57 of 72 statements. [2025-04-29 11:09:35,517 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:09:35,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:35,853 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-29 11:09:35,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:35,853 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660987758] [2025-04-29 11:09:35,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660987758] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:35,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:35,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:35,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326088599] [2025-04-29 11:09:35,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:35,855 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:35,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:35,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:35,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:36,313 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 297 [2025-04-29 11:09:36,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 300 transitions, 648 flow. Second operand has 6 states, 6 states have (on average 213.33333333333334) internal successors, (1280), 6 states have internal predecessors, (1280), 0 states have call successors, (0), 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-04-29 11:09:36,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:36,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 297 [2025-04-29 11:09:36,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:36,589 INFO L116 PetriNetUnfolderBase]: 366/1664 cut-off events. [2025-04-29 11:09:36,590 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-29 11:09:36,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2506 conditions, 1664 events. 366/1664 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10098 event pairs, 364 based on Foata normal form. 0/1538 useless extension candidates. Maximal degree in co-relation 2435. Up to 800 conditions per place. [2025-04-29 11:09:36,601 INFO L140 encePairwiseOnDemand]: 285/297 looper letters, 71 selfloop transitions, 10 changer transitions 0/298 dead transitions. [2025-04-29 11:09:36,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 298 transitions, 806 flow [2025-04-29 11:09:36,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:36,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:36,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1355 transitions. [2025-04-29 11:09:36,606 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7603815937149271 [2025-04-29 11:09:36,606 INFO L175 Difference]: Start difference. First operand has 307 places, 300 transitions, 648 flow. Second operand 6 states and 1355 transitions. [2025-04-29 11:09:36,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 298 transitions, 806 flow [2025-04-29 11:09:36,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 298 transitions, 800 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-29 11:09:36,616 INFO L231 Difference]: Finished difference. Result has 309 places, 298 transitions, 658 flow [2025-04-29 11:09:36,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=658, PETRI_PLACES=309, PETRI_TRANSITIONS=298} [2025-04-29 11:09:36,618 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 13 predicate places. [2025-04-29 11:09:36,618 INFO L485 AbstractCegarLoop]: Abstraction has has 309 places, 298 transitions, 658 flow [2025-04-29 11:09:36,619 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 213.33333333333334) internal successors, (1280), 6 states have internal predecessors, (1280), 0 states have call successors, (0), 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-04-29 11:09:36,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:36,619 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-29 11:09:36,619 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:09:36,620 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:36,620 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:36,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1204918642, now seen corresponding path program 1 times [2025-04-29 11:09:36,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:36,622 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644986185] [2025-04-29 11:09:36,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:36,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:36,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-04-29 11:09:36,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-04-29 11:09:36,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:36,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:36,677 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-29 11:09:36,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:36,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644986185] [2025-04-29 11:09:36,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644986185] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:36,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:36,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:09:36,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170347578] [2025-04-29 11:09:36,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:36,678 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:09:36,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:36,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:09:36,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:09:36,705 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 284 out of 297 [2025-04-29 11:09:36,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 298 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 286.0) internal successors, (858), 3 states have internal predecessors, (858), 0 states have call successors, (0), 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-04-29 11:09:36,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:36,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 284 of 297 [2025-04-29 11:09:36,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:36,767 INFO L116 PetriNetUnfolderBase]: 8/489 cut-off events. [2025-04-29 11:09:36,768 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-29 11:09:36,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 489 events. 8/489 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 856 event pairs, 6 based on Foata normal form. 1/456 useless extension candidates. Maximal degree in co-relation 494. Up to 24 conditions per place. [2025-04-29 11:09:36,770 INFO L140 encePairwiseOnDemand]: 294/297 looper letters, 10 selfloop transitions, 2 changer transitions 0/299 dead transitions. [2025-04-29 11:09:36,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 299 transitions, 684 flow [2025-04-29 11:09:36,771 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:09:36,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:09:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 865 transitions. [2025-04-29 11:09:36,773 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9708193041526375 [2025-04-29 11:09:36,773 INFO L175 Difference]: Start difference. First operand has 309 places, 298 transitions, 658 flow. Second operand 3 states and 865 transitions. [2025-04-29 11:09:36,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 299 transitions, 684 flow [2025-04-29 11:09:36,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 299 transitions, 664 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:36,778 INFO L231 Difference]: Finished difference. Result has 307 places, 299 transitions, 650 flow [2025-04-29 11:09:36,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=650, PETRI_PLACES=307, PETRI_TRANSITIONS=299} [2025-04-29 11:09:36,779 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 11 predicate places. [2025-04-29 11:09:36,779 INFO L485 AbstractCegarLoop]: Abstraction has has 307 places, 299 transitions, 650 flow [2025-04-29 11:09:36,780 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 286.0) internal successors, (858), 3 states have internal predecessors, (858), 0 states have call successors, (0), 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-04-29 11:09:36,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:36,780 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-29 11:09:36,780 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:09:36,780 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:36,781 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:36,781 INFO L85 PathProgramCache]: Analyzing trace with hash 2138401083, now seen corresponding path program 1 times [2025-04-29 11:09:36,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:36,781 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020729535] [2025-04-29 11:09:36,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:36,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:36,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-04-29 11:09:36,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-04-29 11:09:36,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:36,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:36,940 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:36,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:36,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020729535] [2025-04-29 11:09:36,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020729535] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:36,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828139026] [2025-04-29 11:09:36,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:36,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:36,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:36,943 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:09:36,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:09:36,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-04-29 11:09:37,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-04-29 11:09:37,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:37,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:37,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:09:37,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:37,066 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:37,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:09:37,160 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:37,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828139026] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:09:37,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:09:37,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-04-29 11:09:37,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671314051] [2025-04-29 11:09:37,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:09:37,161 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:09:37,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:37,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:09:37,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:09:37,194 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 297 [2025-04-29 11:09:37,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 299 transitions, 650 flow. Second operand has 18 states, 18 states have (on average 282.8888888888889) internal successors, (5092), 18 states have internal predecessors, (5092), 0 states have call successors, (0), 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-04-29 11:09:37,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:37,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 297 [2025-04-29 11:09:37,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:37,383 INFO L116 PetriNetUnfolderBase]: 8/509 cut-off events. [2025-04-29 11:09:37,383 INFO L117 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-04-29 11:09:37,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 509 events. 8/509 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 855 event pairs, 6 based on Foata normal form. 4/479 useless extension candidates. Maximal degree in co-relation 476. Up to 24 conditions per place. [2025-04-29 11:09:37,386 INFO L140 encePairwiseOnDemand]: 291/297 looper letters, 18 selfloop transitions, 21 changer transitions 0/317 dead transitions. [2025-04-29 11:09:37,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 317 transitions, 816 flow [2025-04-29 11:09:37,386 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:09:37,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-29 11:09:37,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 5944 transitions. [2025-04-29 11:09:37,394 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9530222863556197 [2025-04-29 11:09:37,394 INFO L175 Difference]: Start difference. First operand has 307 places, 299 transitions, 650 flow. Second operand 21 states and 5944 transitions. [2025-04-29 11:09:37,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 317 transitions, 816 flow [2025-04-29 11:09:37,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 317 transitions, 814 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:09:37,400 INFO L231 Difference]: Finished difference. Result has 331 places, 312 transitions, 778 flow [2025-04-29 11:09:37,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=778, PETRI_PLACES=331, PETRI_TRANSITIONS=312} [2025-04-29 11:09:37,402 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 35 predicate places. [2025-04-29 11:09:37,402 INFO L485 AbstractCegarLoop]: Abstraction has has 331 places, 312 transitions, 778 flow [2025-04-29 11:09:37,405 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 282.8888888888889) internal successors, (5092), 18 states have internal predecessors, (5092), 0 states have call successors, (0), 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-04-29 11:09:37,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:37,405 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-29 11:09:37,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:09:37,606 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:37,606 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:37,606 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:37,606 INFO L85 PathProgramCache]: Analyzing trace with hash -2048903941, now seen corresponding path program 2 times [2025-04-29 11:09:37,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:37,607 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291328375] [2025-04-29 11:09:37,607 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:09:37,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:37,616 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-04-29 11:09:37,621 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 65 of 100 statements. [2025-04-29 11:09:37,621 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:09:37,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:37,857 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-04-29 11:09:37,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:37,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291328375] [2025-04-29 11:09:37,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291328375] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:37,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:37,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:37,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018352522] [2025-04-29 11:09:37,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:37,858 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:37,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:37,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:37,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:38,213 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 297 [2025-04-29 11:09:38,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 312 transitions, 778 flow. Second operand has 6 states, 6 states have (on average 213.33333333333334) internal successors, (1280), 6 states have internal predecessors, (1280), 0 states have call successors, (0), 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-04-29 11:09:38,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:38,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 297 [2025-04-29 11:09:38,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:38,424 INFO L116 PetriNetUnfolderBase]: 366/1791 cut-off events. [2025-04-29 11:09:38,424 INFO L117 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-04-29 11:09:38,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2741 conditions, 1791 events. 366/1791 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10029 event pairs, 364 based on Foata normal form. 0/1663 useless extension candidates. Maximal degree in co-relation 2590. Up to 830 conditions per place. [2025-04-29 11:09:38,434 INFO L140 encePairwiseOnDemand]: 285/297 looper letters, 71 selfloop transitions, 10 changer transitions 0/310 dead transitions. [2025-04-29 11:09:38,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 310 transitions, 936 flow [2025-04-29 11:09:38,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:38,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:38,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1355 transitions. [2025-04-29 11:09:38,437 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7603815937149271 [2025-04-29 11:09:38,437 INFO L175 Difference]: Start difference. First operand has 331 places, 312 transitions, 778 flow. Second operand 6 states and 1355 transitions. [2025-04-29 11:09:38,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 310 transitions, 936 flow [2025-04-29 11:09:38,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 310 transitions, 912 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-29 11:09:38,443 INFO L231 Difference]: Finished difference. Result has 328 places, 310 transitions, 770 flow [2025-04-29 11:09:38,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=770, PETRI_PLACES=328, PETRI_TRANSITIONS=310} [2025-04-29 11:09:38,445 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 32 predicate places. [2025-04-29 11:09:38,445 INFO L485 AbstractCegarLoop]: Abstraction has has 328 places, 310 transitions, 770 flow [2025-04-29 11:09:38,446 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 213.33333333333334) internal successors, (1280), 6 states have internal predecessors, (1280), 0 states have call successors, (0), 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-04-29 11:09:38,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:38,446 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-29 11:09:38,446 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:09:38,446 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:38,447 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:38,447 INFO L85 PathProgramCache]: Analyzing trace with hash -299931332, now seen corresponding path program 1 times [2025-04-29 11:09:38,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:38,447 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741754724] [2025-04-29 11:09:38,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:38,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:38,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-04-29 11:09:38,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-04-29 11:09:38,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:38,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:38,700 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:38,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:38,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741754724] [2025-04-29 11:09:38,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741754724] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:38,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399671125] [2025-04-29 11:09:38,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:38,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:38,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:38,703 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:09:38,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:09:38,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-04-29 11:09:38,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-04-29 11:09:38,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:38,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:38,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-29 11:09:38,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:38,848 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:38,848 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:09:39,016 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:39,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399671125] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:09:39,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:09:39,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-04-29 11:09:39,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305957489] [2025-04-29 11:09:39,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:09:39,017 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:09:39,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:39,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:09:39,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:09:39,049 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 297 [2025-04-29 11:09:39,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 310 transitions, 770 flow. Second operand has 23 states, 23 states have (on average 283.0) internal successors, (6509), 23 states have internal predecessors, (6509), 0 states have call successors, (0), 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-04-29 11:09:39,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:39,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 297 [2025-04-29 11:09:39,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:39,331 INFO L116 PetriNetUnfolderBase]: 8/520 cut-off events. [2025-04-29 11:09:39,331 INFO L117 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-04-29 11:09:39,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 520 events. 8/520 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 847 event pairs, 6 based on Foata normal form. 3/493 useless extension candidates. Maximal degree in co-relation 498. Up to 24 conditions per place. [2025-04-29 11:09:39,333 INFO L140 encePairwiseOnDemand]: 291/297 looper letters, 21 selfloop transitions, 30 changer transitions 0/327 dead transitions. [2025-04-29 11:09:39,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 327 transitions, 994 flow [2025-04-29 11:09:39,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-29 11:09:39,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-29 11:09:39,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 8484 transitions. [2025-04-29 11:09:39,344 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9521885521885521 [2025-04-29 11:09:39,345 INFO L175 Difference]: Start difference. First operand has 328 places, 310 transitions, 770 flow. Second operand 30 states and 8484 transitions. [2025-04-29 11:09:39,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 327 transitions, 994 flow [2025-04-29 11:09:39,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 327 transitions, 974 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:39,350 INFO L231 Difference]: Finished difference. Result has 356 places, 320 transitions, 902 flow [2025-04-29 11:09:39,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=902, PETRI_PLACES=356, PETRI_TRANSITIONS=320} [2025-04-29 11:09:39,351 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 60 predicate places. [2025-04-29 11:09:39,351 INFO L485 AbstractCegarLoop]: Abstraction has has 356 places, 320 transitions, 902 flow [2025-04-29 11:09:39,353 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 283.0) internal successors, (6509), 23 states have internal predecessors, (6509), 0 states have call successors, (0), 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-04-29 11:09:39,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:39,353 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-29 11:09:39,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 11:09:39,557 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:39,557 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:39,557 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:39,558 INFO L85 PathProgramCache]: Analyzing trace with hash 251755679, now seen corresponding path program 2 times [2025-04-29 11:09:39,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:39,558 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642002711] [2025-04-29 11:09:39,558 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:09:39,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:39,572 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 127 statements into 2 equivalence classes. [2025-04-29 11:09:39,582 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 77 of 127 statements. [2025-04-29 11:09:39,582 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:09:39,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:39,799 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:09:39,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:39,799 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642002711] [2025-04-29 11:09:39,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642002711] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:39,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:39,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:39,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549838119] [2025-04-29 11:09:39,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:39,800 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:39,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:39,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:39,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:40,157 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 297 [2025-04-29 11:09:40,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 320 transitions, 902 flow. Second operand has 6 states, 6 states have (on average 209.83333333333334) internal successors, (1259), 6 states have internal predecessors, (1259), 0 states have call successors, (0), 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-04-29 11:09:40,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:40,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 297 [2025-04-29 11:09:40,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:40,447 INFO L116 PetriNetUnfolderBase]: 392/1893 cut-off events. [2025-04-29 11:09:40,447 INFO L117 PetriNetUnfolderBase]: For 121/121 co-relation queries the response was YES. [2025-04-29 11:09:40,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2970 conditions, 1893 events. 392/1893 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 10817 event pairs, 390 based on Foata normal form. 0/1762 useless extension candidates. Maximal degree in co-relation 2740. Up to 899 conditions per place. [2025-04-29 11:09:40,455 INFO L140 encePairwiseOnDemand]: 291/297 looper letters, 83 selfloop transitions, 5 changer transitions 0/319 dead transitions. [2025-04-29 11:09:40,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 319 transitions, 1076 flow [2025-04-29 11:09:40,455 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:40,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:40,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1330 transitions. [2025-04-29 11:09:40,457 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7463524130190797 [2025-04-29 11:09:40,457 INFO L175 Difference]: Start difference. First operand has 356 places, 320 transitions, 902 flow. Second operand 6 states and 1330 transitions. [2025-04-29 11:09:40,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 319 transitions, 1076 flow [2025-04-29 11:09:40,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 319 transitions, 1030 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-04-29 11:09:40,462 INFO L231 Difference]: Finished difference. Result has 342 places, 319 transitions, 864 flow [2025-04-29 11:09:40,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=864, PETRI_PLACES=342, PETRI_TRANSITIONS=319} [2025-04-29 11:09:40,463 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 46 predicate places. [2025-04-29 11:09:40,463 INFO L485 AbstractCegarLoop]: Abstraction has has 342 places, 319 transitions, 864 flow [2025-04-29 11:09:40,464 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 209.83333333333334) internal successors, (1259), 6 states have internal predecessors, (1259), 0 states have call successors, (0), 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-04-29 11:09:40,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:40,464 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-29 11:09:40,464 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:09:40,464 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:40,465 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:40,465 INFO L85 PathProgramCache]: Analyzing trace with hash -588664152, now seen corresponding path program 1 times [2025-04-29 11:09:40,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:40,465 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853429823] [2025-04-29 11:09:40,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:40,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:40,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-04-29 11:09:40,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-04-29 11:09:40,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:40,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:40,896 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:09:40,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:40,896 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853429823] [2025-04-29 11:09:40,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853429823] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:40,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:40,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:40,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203258667] [2025-04-29 11:09:40,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:40,897 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:40,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:40,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:40,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:41,410 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 297 [2025-04-29 11:09:41,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 319 transitions, 864 flow. Second operand has 6 states, 6 states have (on average 237.83333333333334) internal successors, (1427), 6 states have internal predecessors, (1427), 0 states have call successors, (0), 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-04-29 11:09:41,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:41,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 297 [2025-04-29 11:09:41,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:41,529 INFO L116 PetriNetUnfolderBase]: 56/759 cut-off events. [2025-04-29 11:09:41,530 INFO L117 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-04-29 11:09:41,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1120 conditions, 759 events. 56/759 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2603 event pairs, 54 based on Foata normal form. 0/707 useless extension candidates. Maximal degree in co-relation 911. Up to 195 conditions per place. [2025-04-29 11:09:41,532 INFO L140 encePairwiseOnDemand]: 291/297 looper letters, 57 selfloop transitions, 5 changer transitions 0/318 dead transitions. [2025-04-29 11:09:41,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 318 transitions, 986 flow [2025-04-29 11:09:41,533 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:41,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:41,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1460 transitions. [2025-04-29 11:09:41,535 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.819304152637486 [2025-04-29 11:09:41,535 INFO L175 Difference]: Start difference. First operand has 342 places, 319 transitions, 864 flow. Second operand 6 states and 1460 transitions. [2025-04-29 11:09:41,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 318 transitions, 986 flow [2025-04-29 11:09:41,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 318 transitions, 976 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:41,540 INFO L231 Difference]: Finished difference. Result has 341 places, 318 transitions, 862 flow [2025-04-29 11:09:41,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=862, PETRI_PLACES=341, PETRI_TRANSITIONS=318} [2025-04-29 11:09:41,541 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 45 predicate places. [2025-04-29 11:09:41,541 INFO L485 AbstractCegarLoop]: Abstraction has has 341 places, 318 transitions, 862 flow [2025-04-29 11:09:41,541 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 237.83333333333334) internal successors, (1427), 6 states have internal predecessors, (1427), 0 states have call successors, (0), 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-04-29 11:09:41,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:41,542 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-29 11:09:41,542 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:09:41,542 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:41,542 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:41,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1709143905, now seen corresponding path program 1 times [2025-04-29 11:09:41,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:41,543 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613550177] [2025-04-29 11:09:41,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:41,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:41,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-04-29 11:09:41,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-04-29 11:09:41,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:41,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:41,890 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:09:41,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:41,890 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613550177] [2025-04-29 11:09:41,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613550177] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:41,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:41,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:41,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296056541] [2025-04-29 11:09:41,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:41,891 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:41,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:41,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:41,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:42,388 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 297 [2025-04-29 11:09:42,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 318 transitions, 862 flow. Second operand has 6 states, 6 states have (on average 240.5) internal successors, (1443), 6 states have internal predecessors, (1443), 0 states have call successors, (0), 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-04-29 11:09:42,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:42,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 297 [2025-04-29 11:09:42,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:42,468 INFO L116 PetriNetUnfolderBase]: 38/674 cut-off events. [2025-04-29 11:09:42,468 INFO L117 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-04-29 11:09:42,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 998 conditions, 674 events. 38/674 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2070 event pairs, 36 based on Foata normal form. 0/635 useless extension candidates. Maximal degree in co-relation 791. Up to 158 conditions per place. [2025-04-29 11:09:42,471 INFO L140 encePairwiseOnDemand]: 291/297 looper letters, 53 selfloop transitions, 5 changer transitions 0/317 dead transitions. [2025-04-29 11:09:42,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 317 transitions, 976 flow [2025-04-29 11:09:42,471 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:42,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:42,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1475 transitions. [2025-04-29 11:09:42,474 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8277216610549943 [2025-04-29 11:09:42,474 INFO L175 Difference]: Start difference. First operand has 341 places, 318 transitions, 862 flow. Second operand 6 states and 1475 transitions. [2025-04-29 11:09:42,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 317 transitions, 976 flow [2025-04-29 11:09:42,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 317 transitions, 966 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:42,479 INFO L231 Difference]: Finished difference. Result has 340 places, 317 transitions, 860 flow [2025-04-29 11:09:42,480 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=860, PETRI_PLACES=340, PETRI_TRANSITIONS=317} [2025-04-29 11:09:42,480 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 44 predicate places. [2025-04-29 11:09:42,481 INFO L485 AbstractCegarLoop]: Abstraction has has 340 places, 317 transitions, 860 flow [2025-04-29 11:09:42,482 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 240.5) internal successors, (1443), 6 states have internal predecessors, (1443), 0 states have call successors, (0), 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-04-29 11:09:42,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:42,482 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-29 11:09:42,482 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:09:42,482 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:42,483 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:42,483 INFO L85 PathProgramCache]: Analyzing trace with hash 52016110, now seen corresponding path program 1 times [2025-04-29 11:09:42,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:42,483 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256726248] [2025-04-29 11:09:42,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:42,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:42,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-04-29 11:09:42,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-04-29 11:09:42,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:42,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:42,795 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-04-29 11:09:42,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:42,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256726248] [2025-04-29 11:09:42,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256726248] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:42,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:42,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:42,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096387054] [2025-04-29 11:09:42,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:42,796 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:42,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:42,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:42,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:43,021 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 297 [2025-04-29 11:09:43,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 317 transitions, 860 flow. Second operand has 6 states, 6 states have (on average 216.16666666666666) internal successors, (1297), 6 states have internal predecessors, (1297), 0 states have call successors, (0), 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-04-29 11:09:43,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:43,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 297 [2025-04-29 11:09:43,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:43,294 INFO L116 PetriNetUnfolderBase]: 366/1798 cut-off events. [2025-04-29 11:09:43,295 INFO L117 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-04-29 11:09:43,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2810 conditions, 1798 events. 366/1798 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 9987 event pairs, 364 based on Foata normal form. 0/1678 useless extension candidates. Maximal degree in co-relation 2603. Up to 846 conditions per place. [2025-04-29 11:09:43,301 INFO L140 encePairwiseOnDemand]: 291/297 looper letters, 79 selfloop transitions, 5 changer transitions 0/316 dead transitions. [2025-04-29 11:09:43,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 316 transitions, 1026 flow [2025-04-29 11:09:43,302 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:43,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:43,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1345 transitions. [2025-04-29 11:09:43,304 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.754769921436588 [2025-04-29 11:09:43,304 INFO L175 Difference]: Start difference. First operand has 340 places, 317 transitions, 860 flow. Second operand 6 states and 1345 transitions. [2025-04-29 11:09:43,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 316 transitions, 1026 flow [2025-04-29 11:09:43,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 316 transitions, 1016 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:43,310 INFO L231 Difference]: Finished difference. Result has 339 places, 316 transitions, 858 flow [2025-04-29 11:09:43,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=858, PETRI_PLACES=339, PETRI_TRANSITIONS=316} [2025-04-29 11:09:43,311 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 43 predicate places. [2025-04-29 11:09:43,311 INFO L485 AbstractCegarLoop]: Abstraction has has 339 places, 316 transitions, 858 flow [2025-04-29 11:09:43,312 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 216.16666666666666) internal successors, (1297), 6 states have internal predecessors, (1297), 0 states have call successors, (0), 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-04-29 11:09:43,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:43,312 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-29 11:09:43,312 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:09:43,312 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:43,314 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:43,314 INFO L85 PathProgramCache]: Analyzing trace with hash -35025290, now seen corresponding path program 1 times [2025-04-29 11:09:43,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:43,314 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307960392] [2025-04-29 11:09:43,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:43,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:43,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-04-29 11:09:43,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-04-29 11:09:43,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:43,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:43,687 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-04-29 11:09:43,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:43,687 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307960392] [2025-04-29 11:09:43,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307960392] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:43,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:43,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:43,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253207188] [2025-04-29 11:09:43,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:43,688 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:43,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:43,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:43,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:43,929 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 297 [2025-04-29 11:09:43,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 316 transitions, 858 flow. Second operand has 6 states, 6 states have (on average 217.66666666666666) internal successors, (1306), 6 states have internal predecessors, (1306), 0 states have call successors, (0), 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-04-29 11:09:43,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:43,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 297 [2025-04-29 11:09:43,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:44,193 INFO L116 PetriNetUnfolderBase]: 366/1796 cut-off events. [2025-04-29 11:09:44,194 INFO L117 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-04-29 11:09:44,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2806 conditions, 1796 events. 366/1796 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 9981 event pairs, 364 based on Foata normal form. 0/1678 useless extension candidates. Maximal degree in co-relation 2599. Up to 844 conditions per place. [2025-04-29 11:09:44,199 INFO L140 encePairwiseOnDemand]: 291/297 looper letters, 78 selfloop transitions, 5 changer transitions 0/315 dead transitions. [2025-04-29 11:09:44,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 315 transitions, 1022 flow [2025-04-29 11:09:44,201 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:44,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:44,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1350 transitions. [2025-04-29 11:09:44,202 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7575757575757576 [2025-04-29 11:09:44,202 INFO L175 Difference]: Start difference. First operand has 339 places, 316 transitions, 858 flow. Second operand 6 states and 1350 transitions. [2025-04-29 11:09:44,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 315 transitions, 1022 flow [2025-04-29 11:09:44,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 315 transitions, 1012 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:44,207 INFO L231 Difference]: Finished difference. Result has 338 places, 315 transitions, 856 flow [2025-04-29 11:09:44,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=856, PETRI_PLACES=338, PETRI_TRANSITIONS=315} [2025-04-29 11:09:44,209 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 42 predicate places. [2025-04-29 11:09:44,209 INFO L485 AbstractCegarLoop]: Abstraction has has 338 places, 315 transitions, 856 flow [2025-04-29 11:09:44,210 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 217.66666666666666) internal successors, (1306), 6 states have internal predecessors, (1306), 0 states have call successors, (0), 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-04-29 11:09:44,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:44,211 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-29 11:09:44,211 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:09:44,211 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:44,211 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:44,211 INFO L85 PathProgramCache]: Analyzing trace with hash 802581491, now seen corresponding path program 1 times [2025-04-29 11:09:44,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:44,212 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949285643] [2025-04-29 11:09:44,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:44,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:44,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-04-29 11:09:44,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-04-29 11:09:44,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:44,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:44,321 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-04-29 11:09:44,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:44,321 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949285643] [2025-04-29 11:09:44,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949285643] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:44,321 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406595565] [2025-04-29 11:09:44,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:44,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:44,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:44,323 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:09:44,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:09:44,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-04-29 11:09:44,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-04-29 11:09:44,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:44,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:44,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:09:44,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:44,589 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-04-29 11:09:44,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:09:44,694 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-04-29 11:09:44,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406595565] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:09:44,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:09:44,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-29 11:09:44,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841280207] [2025-04-29 11:09:44,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:09:44,696 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:09:44,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:44,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:09:44,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:09:44,780 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 297 [2025-04-29 11:09:44,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 315 transitions, 856 flow. Second operand has 10 states, 10 states have (on average 283.0) internal successors, (2830), 10 states have internal predecessors, (2830), 0 states have call successors, (0), 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-04-29 11:09:44,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:44,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 297 [2025-04-29 11:09:44,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:44,885 INFO L116 PetriNetUnfolderBase]: 8/617 cut-off events. [2025-04-29 11:09:44,886 INFO L117 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-04-29 11:09:44,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 617 events. 8/617 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 397 event pairs, 6 based on Foata normal form. 2/599 useless extension candidates. Maximal degree in co-relation 607. Up to 24 conditions per place. [2025-04-29 11:09:44,887 INFO L140 encePairwiseOnDemand]: 291/297 looper letters, 14 selfloop transitions, 9 changer transitions 0/323 dead transitions. [2025-04-29 11:09:44,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 323 transitions, 920 flow [2025-04-29 11:09:44,888 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:09:44,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:09:44,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2554 transitions. [2025-04-29 11:09:44,889 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.955480733258511 [2025-04-29 11:09:44,889 INFO L175 Difference]: Start difference. First operand has 338 places, 315 transitions, 856 flow. Second operand 9 states and 2554 transitions. [2025-04-29 11:09:44,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 323 transitions, 920 flow [2025-04-29 11:09:44,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 323 transitions, 910 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:44,894 INFO L231 Difference]: Finished difference. Result has 344 places, 321 transitions, 896 flow [2025-04-29 11:09:44,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=896, PETRI_PLACES=344, PETRI_TRANSITIONS=321} [2025-04-29 11:09:44,894 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 48 predicate places. [2025-04-29 11:09:44,894 INFO L485 AbstractCegarLoop]: Abstraction has has 344 places, 321 transitions, 896 flow [2025-04-29 11:09:44,895 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 283.0) internal successors, (2830), 10 states have internal predecessors, (2830), 0 states have call successors, (0), 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-04-29 11:09:44,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:44,896 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-29 11:09:44,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 11:09:45,096 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:45,096 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:45,097 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:45,098 INFO L85 PathProgramCache]: Analyzing trace with hash -730067213, now seen corresponding path program 2 times [2025-04-29 11:09:45,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:45,098 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650479445] [2025-04-29 11:09:45,098 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:09:45,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:45,151 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 423 statements into 2 equivalence classes. [2025-04-29 11:09:45,153 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 58 of 423 statements. [2025-04-29 11:09:45,153 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:09:45,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:45,259 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 742 trivial. 0 not checked. [2025-04-29 11:09:45,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:45,259 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650479445] [2025-04-29 11:09:45,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650479445] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:45,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:45,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:45,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764157271] [2025-04-29 11:09:45,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:45,260 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:45,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:45,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:45,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:45,693 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 297 [2025-04-29 11:09:45,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 321 transitions, 896 flow. Second operand has 6 states, 6 states have (on average 242.33333333333334) internal successors, (1454), 6 states have internal predecessors, (1454), 0 states have call successors, (0), 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-04-29 11:09:45,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:45,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 297 [2025-04-29 11:09:45,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:46,095 INFO L116 PetriNetUnfolderBase]: 258/1934 cut-off events. [2025-04-29 11:09:46,095 INFO L117 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-04-29 11:09:46,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2737 conditions, 1934 events. 258/1934 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 10112 event pairs, 34 based on Foata normal form. 0/1808 useless extension candidates. Maximal degree in co-relation 2526. Up to 491 conditions per place. [2025-04-29 11:09:46,101 INFO L140 encePairwiseOnDemand]: 274/297 looper letters, 67 selfloop transitions, 70 changer transitions 0/399 dead transitions. [2025-04-29 11:09:46,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 399 transitions, 1326 flow [2025-04-29 11:09:46,102 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:46,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:46,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1554 transitions. [2025-04-29 11:09:46,103 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8720538720538721 [2025-04-29 11:09:46,103 INFO L175 Difference]: Start difference. First operand has 344 places, 321 transitions, 896 flow. Second operand 6 states and 1554 transitions. [2025-04-29 11:09:46,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 399 transitions, 1326 flow [2025-04-29 11:09:46,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 399 transitions, 1320 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-29 11:09:46,108 INFO L231 Difference]: Finished difference. Result has 353 places, 390 transitions, 1352 flow [2025-04-29 11:09:46,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1352, PETRI_PLACES=353, PETRI_TRANSITIONS=390} [2025-04-29 11:09:46,109 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 57 predicate places. [2025-04-29 11:09:46,109 INFO L485 AbstractCegarLoop]: Abstraction has has 353 places, 390 transitions, 1352 flow [2025-04-29 11:09:46,110 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 242.33333333333334) internal successors, (1454), 6 states have internal predecessors, (1454), 0 states have call successors, (0), 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-04-29 11:09:46,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:46,110 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-29 11:09:46,110 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:09:46,110 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:46,111 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:46,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1872208506, now seen corresponding path program 1 times [2025-04-29 11:09:46,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:46,111 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384761814] [2025-04-29 11:09:46,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:46,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:46,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-04-29 11:09:46,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-04-29 11:09:46,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:46,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:46,468 INFO L134 CoverageAnalysis]: Checked inductivity of 877 backedges. 0 proven. 534 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-04-29 11:09:46,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:46,468 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384761814] [2025-04-29 11:09:46,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384761814] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:46,469 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809758834] [2025-04-29 11:09:46,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:46,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:46,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:46,471 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:09:46,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 11:09:46,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-04-29 11:09:46,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-04-29 11:09:46,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:46,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:46,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 1536 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:09:46,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:47,054 INFO L134 CoverageAnalysis]: Checked inductivity of 877 backedges. 0 proven. 534 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-04-29 11:09:47,054 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:09:47,324 INFO L134 CoverageAnalysis]: Checked inductivity of 877 backedges. 0 proven. 534 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-04-29 11:09:47,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809758834] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:09:47,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:09:47,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-04-29 11:09:47,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315304020] [2025-04-29 11:09:47,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:09:47,326 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:09:47,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:47,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:09:47,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:09:47,471 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 297 [2025-04-29 11:09:47,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 390 transitions, 1352 flow. Second operand has 18 states, 18 states have (on average 283.0) internal successors, (5094), 18 states have internal predecessors, (5094), 0 states have call successors, (0), 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-04-29 11:09:47,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:47,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 297 [2025-04-29 11:09:47,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:47,865 INFO L116 PetriNetUnfolderBase]: 145/2041 cut-off events. [2025-04-29 11:09:47,865 INFO L117 PetriNetUnfolderBase]: For 309/323 co-relation queries the response was YES. [2025-04-29 11:09:47,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2883 conditions, 2041 events. 145/2041 cut-off events. For 309/323 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7451 event pairs, 23 based on Foata normal form. 4/1959 useless extension candidates. Maximal degree in co-relation 2668. Up to 207 conditions per place. [2025-04-29 11:09:47,872 INFO L140 encePairwiseOnDemand]: 291/297 looper letters, 19 selfloop transitions, 21 changer transitions 0/408 dead transitions. [2025-04-29 11:09:47,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 408 transitions, 1520 flow [2025-04-29 11:09:47,873 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:09:47,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-29 11:09:47,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 5944 transitions. [2025-04-29 11:09:47,875 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9530222863556197 [2025-04-29 11:09:47,875 INFO L175 Difference]: Start difference. First operand has 353 places, 390 transitions, 1352 flow. Second operand 21 states and 5944 transitions. [2025-04-29 11:09:47,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 408 transitions, 1520 flow [2025-04-29 11:09:47,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 408 transitions, 1520 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:09:47,882 INFO L231 Difference]: Finished difference. Result has 378 places, 403 transitions, 1482 flow [2025-04-29 11:09:47,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=1352, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1482, PETRI_PLACES=378, PETRI_TRANSITIONS=403} [2025-04-29 11:09:47,882 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 82 predicate places. [2025-04-29 11:09:47,883 INFO L485 AbstractCegarLoop]: Abstraction has has 378 places, 403 transitions, 1482 flow [2025-04-29 11:09:47,884 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 283.0) internal successors, (5094), 18 states have internal predecessors, (5094), 0 states have call successors, (0), 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-04-29 11:09:47,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:47,884 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-29 11:09:47,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-29 11:09:48,085 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-29 11:09:48,085 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:48,087 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:48,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1604772742, now seen corresponding path program 2 times [2025-04-29 11:09:48,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:48,087 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428487506] [2025-04-29 11:09:48,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:09:48,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:48,171 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 849 statements into 2 equivalence classes. [2025-04-29 11:09:48,174 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 64 of 849 statements. [2025-04-29 11:09:48,174 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:09:48,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:48,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4211 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4211 trivial. 0 not checked. [2025-04-29 11:09:48,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:48,276 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428487506] [2025-04-29 11:09:48,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428487506] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:48,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:48,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:48,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862788538] [2025-04-29 11:09:48,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:48,277 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:48,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:48,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:48,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:48,665 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 297 [2025-04-29 11:09:48,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 403 transitions, 1482 flow. Second operand has 6 states, 6 states have (on average 242.16666666666666) internal successors, (1453), 6 states have internal predecessors, (1453), 0 states have call successors, (0), 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-04-29 11:09:48,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:48,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 297 [2025-04-29 11:09:48,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:49,357 INFO L116 PetriNetUnfolderBase]: 531/3138 cut-off events. [2025-04-29 11:09:49,358 INFO L117 PetriNetUnfolderBase]: For 973/1064 co-relation queries the response was YES. [2025-04-29 11:09:49,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5584 conditions, 3138 events. 531/3138 cut-off events. For 973/1064 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 16107 event pairs, 93 based on Foata normal form. 16/2989 useless extension candidates. Maximal degree in co-relation 5364. Up to 981 conditions per place. [2025-04-29 11:09:49,372 INFO L140 encePairwiseOnDemand]: 274/297 looper letters, 131 selfloop transitions, 130 changer transitions 0/540 dead transitions. [2025-04-29 11:09:49,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 540 transitions, 2654 flow [2025-04-29 11:09:49,374 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:49,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:49,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1553 transitions. [2025-04-29 11:09:49,375 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8714927048260381 [2025-04-29 11:09:49,375 INFO L175 Difference]: Start difference. First operand has 378 places, 403 transitions, 1482 flow. Second operand 6 states and 1553 transitions. [2025-04-29 11:09:49,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 540 transitions, 2654 flow [2025-04-29 11:09:49,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 540 transitions, 2630 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-29 11:09:49,384 INFO L231 Difference]: Finished difference. Result has 382 places, 532 transitions, 2686 flow [2025-04-29 11:09:49,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=1458, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2686, PETRI_PLACES=382, PETRI_TRANSITIONS=532} [2025-04-29 11:09:49,384 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 86 predicate places. [2025-04-29 11:09:49,384 INFO L485 AbstractCegarLoop]: Abstraction has has 382 places, 532 transitions, 2686 flow [2025-04-29 11:09:49,385 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 242.16666666666666) internal successors, (1453), 6 states have internal predecessors, (1453), 0 states have call successors, (0), 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-04-29 11:09:49,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:49,385 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-29 11:09:49,385 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:09:49,385 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:49,387 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:49,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1239993032, now seen corresponding path program 1 times [2025-04-29 11:09:49,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:49,387 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668244938] [2025-04-29 11:09:49,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:49,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:49,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 859 statements into 1 equivalence classes. [2025-04-29 11:09:49,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 859 of 859 statements. [2025-04-29 11:09:49,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:49,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:50,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4211 backedges. 0 proven. 3724 refuted. 0 times theorem prover too weak. 487 trivial. 0 not checked. [2025-04-29 11:09:50,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:50,521 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668244938] [2025-04-29 11:09:50,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668244938] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:50,521 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687359823] [2025-04-29 11:09:50,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:50,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:50,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:50,523 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:09:50,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 11:09:50,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 859 statements into 1 equivalence classes. [2025-04-29 11:09:51,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 859 of 859 statements. [2025-04-29 11:09:51,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:51,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:51,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 3253 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-29 11:09:51,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:51,619 INFO L134 CoverageAnalysis]: Checked inductivity of 4211 backedges. 0 proven. 3724 refuted. 0 times theorem prover too weak. 487 trivial. 0 not checked. [2025-04-29 11:09:51,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:09:52,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4211 backedges. 0 proven. 3724 refuted. 0 times theorem prover too weak. 487 trivial. 0 not checked. [2025-04-29 11:09:52,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687359823] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:09:52,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:09:52,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-04-29 11:09:52,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206408364] [2025-04-29 11:09:52,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:09:52,163 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:09:52,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:52,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:09:52,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:09:52,309 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 297 [2025-04-29 11:09:52,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 532 transitions, 2686 flow. Second operand has 23 states, 23 states have (on average 283.0869565217391) internal successors, (6511), 23 states have internal predecessors, (6511), 0 states have call successors, (0), 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-04-29 11:09:52,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:52,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 297 [2025-04-29 11:09:52,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:53,049 INFO L116 PetriNetUnfolderBase]: 427/3164 cut-off events. [2025-04-29 11:09:53,049 INFO L117 PetriNetUnfolderBase]: For 1299/1326 co-relation queries the response was YES. [2025-04-29 11:09:53,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5536 conditions, 3164 events. 427/3164 cut-off events. For 1299/1326 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 13578 event pairs, 39 based on Foata normal form. 7/3063 useless extension candidates. Maximal degree in co-relation 5311. Up to 468 conditions per place. [2025-04-29 11:09:53,061 INFO L140 encePairwiseOnDemand]: 291/297 looper letters, 22 selfloop transitions, 30 changer transitions 0/549 dead transitions. [2025-04-29 11:09:53,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 549 transitions, 2912 flow [2025-04-29 11:09:53,061 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-29 11:09:53,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-29 11:09:53,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 8484 transitions. [2025-04-29 11:09:53,064 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9521885521885521 [2025-04-29 11:09:53,064 INFO L175 Difference]: Start difference. First operand has 382 places, 532 transitions, 2686 flow. Second operand 30 states and 8484 transitions. [2025-04-29 11:09:53,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 549 transitions, 2912 flow [2025-04-29 11:09:53,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 549 transitions, 2912 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:09:53,076 INFO L231 Difference]: Finished difference. Result has 415 places, 542 transitions, 2838 flow [2025-04-29 11:09:53,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=2686, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=509, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2838, PETRI_PLACES=415, PETRI_TRANSITIONS=542} [2025-04-29 11:09:53,077 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 119 predicate places. [2025-04-29 11:09:53,077 INFO L485 AbstractCegarLoop]: Abstraction has has 415 places, 542 transitions, 2838 flow [2025-04-29 11:09:53,078 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 283.0869565217391) internal successors, (6511), 23 states have internal predecessors, (6511), 0 states have call successors, (0), 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-04-29 11:09:53,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:53,079 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-29 11:09:53,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-29 11:09:53,279 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-29 11:09:53,279 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:53,282 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:53,282 INFO L85 PathProgramCache]: Analyzing trace with hash -541905520, now seen corresponding path program 2 times [2025-04-29 11:09:53,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:53,282 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392934609] [2025-04-29 11:09:53,282 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:09:53,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:53,403 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1174 statements into 2 equivalence classes. [2025-04-29 11:09:53,406 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 74 of 1174 statements. [2025-04-29 11:09:53,406 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:09:53,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:53,569 INFO L134 CoverageAnalysis]: Checked inductivity of 8570 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8570 trivial. 0 not checked. [2025-04-29 11:09:53,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:53,569 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392934609] [2025-04-29 11:09:53,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392934609] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:53,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:53,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:53,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057911974] [2025-04-29 11:09:53,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:53,570 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:53,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:53,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:53,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:53,853 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 297 [2025-04-29 11:09:53,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 542 transitions, 2838 flow. Second operand has 6 states, 6 states have (on average 242.33333333333334) internal successors, (1454), 6 states have internal predecessors, (1454), 0 states have call successors, (0), 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-04-29 11:09:53,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:53,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 297 [2025-04-29 11:09:53,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:54,906 INFO L116 PetriNetUnfolderBase]: 807/4219 cut-off events. [2025-04-29 11:09:54,906 INFO L117 PetriNetUnfolderBase]: For 3430/3655 co-relation queries the response was YES. [2025-04-29 11:09:54,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8931 conditions, 4219 events. 807/4219 cut-off events. For 3430/3655 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 22265 event pairs, 74 based on Foata normal form. 76/4120 useless extension candidates. Maximal degree in co-relation 8702. Up to 1323 conditions per place. [2025-04-29 11:09:54,924 INFO L140 encePairwiseOnDemand]: 274/297 looper letters, 251 selfloop transitions, 131 changer transitions 5/680 dead transitions. [2025-04-29 11:09:54,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 680 transitions, 4512 flow [2025-04-29 11:09:54,924 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:54,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:54,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1554 transitions. [2025-04-29 11:09:54,925 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8720538720538721 [2025-04-29 11:09:54,925 INFO L175 Difference]: Start difference. First operand has 415 places, 542 transitions, 2838 flow. Second operand 6 states and 1554 transitions. [2025-04-29 11:09:54,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 680 transitions, 4512 flow [2025-04-29 11:09:54,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 680 transitions, 4466 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-04-29 11:09:54,939 INFO L231 Difference]: Finished difference. Result has 407 places, 670 transitions, 4272 flow [2025-04-29 11:09:54,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=2792, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=504, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4272, PETRI_PLACES=407, PETRI_TRANSITIONS=670} [2025-04-29 11:09:54,939 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 111 predicate places. [2025-04-29 11:09:54,940 INFO L485 AbstractCegarLoop]: Abstraction has has 407 places, 670 transitions, 4272 flow [2025-04-29 11:09:54,940 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 242.33333333333334) internal successors, (1454), 6 states have internal predecessors, (1454), 0 states have call successors, (0), 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-04-29 11:09:54,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:54,940 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-29 11:09:54,940 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:09:54,940 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:54,943 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:54,943 INFO L85 PathProgramCache]: Analyzing trace with hash 296566380, now seen corresponding path program 1 times [2025-04-29 11:09:54,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:54,943 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779702225] [2025-04-29 11:09:54,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:54,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:55,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1175 statements into 1 equivalence classes. [2025-04-29 11:09:55,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1175 of 1175 statements. [2025-04-29 11:09:55,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:55,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:57,643 INFO L134 CoverageAnalysis]: Checked inductivity of 8570 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8570 trivial. 0 not checked. [2025-04-29 11:09:57,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:57,644 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779702225] [2025-04-29 11:09:57,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779702225] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:57,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:57,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:57,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104586126] [2025-04-29 11:09:57,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:57,645 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:57,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:57,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:57,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:57,891 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 297 [2025-04-29 11:09:57,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 670 transitions, 4272 flow. Second operand has 6 states, 6 states have (on average 222.66666666666666) internal successors, (1336), 6 states have internal predecessors, (1336), 0 states have call successors, (0), 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-04-29 11:09:57,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:57,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 297 [2025-04-29 11:09:57,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:59,665 INFO L116 PetriNetUnfolderBase]: 1309/5563 cut-off events. [2025-04-29 11:09:59,665 INFO L117 PetriNetUnfolderBase]: For 4985/5042 co-relation queries the response was YES. [2025-04-29 11:09:59,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13579 conditions, 5563 events. 1309/5563 cut-off events. For 4985/5042 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 33815 event pairs, 369 based on Foata normal form. 11/5329 useless extension candidates. Maximal degree in co-relation 13346. Up to 2549 conditions per place. [2025-04-29 11:09:59,689 INFO L140 encePairwiseOnDemand]: 278/297 looper letters, 316 selfloop transitions, 84 changer transitions 0/749 dead transitions. [2025-04-29 11:09:59,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 749 transitions, 5470 flow [2025-04-29 11:09:59,689 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:59,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:59,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1432 transitions. [2025-04-29 11:09:59,691 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8035914702581369 [2025-04-29 11:09:59,691 INFO L175 Difference]: Start difference. First operand has 407 places, 670 transitions, 4272 flow. Second operand 6 states and 1432 transitions. [2025-04-29 11:09:59,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 749 transitions, 5470 flow [2025-04-29 11:09:59,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 749 transitions, 5216 flow, removed 127 selfloop flow, removed 0 redundant places. [2025-04-29 11:09:59,713 INFO L231 Difference]: Finished difference. Result has 416 places, 741 transitions, 4808 flow [2025-04-29 11:09:59,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=4024, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=622, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4808, PETRI_PLACES=416, PETRI_TRANSITIONS=741} [2025-04-29 11:09:59,713 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 120 predicate places. [2025-04-29 11:09:59,714 INFO L485 AbstractCegarLoop]: Abstraction has has 416 places, 741 transitions, 4808 flow [2025-04-29 11:09:59,714 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 222.66666666666666) internal successors, (1336), 6 states have internal predecessors, (1336), 0 states have call successors, (0), 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-04-29 11:09:59,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:59,714 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-29 11:09:59,714 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-29 11:09:59,715 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:59,717 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:59,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1292930044, now seen corresponding path program 1 times [2025-04-29 11:09:59,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:59,718 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817086586] [2025-04-29 11:09:59,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:59,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:59,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1181 statements into 1 equivalence classes. [2025-04-29 11:10:01,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1181 of 1181 statements. [2025-04-29 11:10:01,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:01,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:29,992 INFO L134 CoverageAnalysis]: Checked inductivity of 8570 backedges. 2848 proven. 5128 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2025-04-29 11:10:29,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:29,992 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817086586] [2025-04-29 11:10:29,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817086586] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:10:29,992 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187387370] [2025-04-29 11:10:29,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:29,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:10:29,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:10:29,994 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:10:29,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-29 11:10:30,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1181 statements into 1 equivalence classes. Killed by 15