./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_11-arraylist_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_11-arraylist_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 d1ab298b15ff3e93e3a25e88a66e704a5aedd8d8523826dd902097f6af136d70 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:09:05,868 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:09:05,925 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:05,930 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:09:05,931 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:09:05,953 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:09:05,954 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:09:05,954 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:09:05,955 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:09:05,955 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:09:05,955 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:09:05,956 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:09:05,956 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:09:05,956 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:09:05,956 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:09:05,956 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:09:05,956 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:09:05,956 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:09:05,956 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:09:05,956 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:09:05,957 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:09:05,957 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:09:05,957 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:09:05,957 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:09:05,957 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:09:05,957 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:09:05,957 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:09:05,957 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:09:05,957 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:09:05,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:09:05,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:09:05,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:09:05,957 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:09:05,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:09:05,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:09:05,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:09:05,957 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:09:05,957 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:09:05,957 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:09:05,957 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:09:05,957 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:09:05,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:09:05,958 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:09:05,958 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:09:05,958 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:09:05,958 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 -> d1ab298b15ff3e93e3a25e88a66e704a5aedd8d8523826dd902097f6af136d70 [2025-04-29 11:09:06,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:09:06,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:09:06,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:09:06,199 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:09:06,199 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:09:06,200 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_11-arraylist_nr.c [2025-04-29 11:09:07,435 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cd1b7eb7/8509766c117f46dd939c38ede987b1ad/FLAG910128cf2 [2025-04-29 11:09:07,610 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:09:07,611 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_11-arraylist_nr.c [2025-04-29 11:09:07,612 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:07,612 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:07,612 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:07,616 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cd1b7eb7/8509766c117f46dd939c38ede987b1ad/FLAG910128cf2 [2025-04-29 11:09:08,486 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cd1b7eb7/8509766c117f46dd939c38ede987b1ad [2025-04-29 11:09:08,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:09:08,489 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:09:08,490 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:09:08,490 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:09:08,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:09:08,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:09:08" (1/1) ... [2025-04-29 11:09:08,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cc588ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:08, skipping insertion in model container [2025-04-29 11:09:08,494 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:09:08" (1/1) ... [2025-04-29 11:09:08,503 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:09:08,675 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:09:08,688 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:09:08,732 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:09:08,752 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:09:08,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:08 WrapperNode [2025-04-29 11:09:08,753 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:09:08,753 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:09:08,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:09:08,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:09:08,758 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:08" (1/1) ... [2025-04-29 11:09:08,769 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:08" (1/1) ... [2025-04-29 11:09:08,811 INFO L138 Inliner]: procedures = 20, calls = 48, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 254 [2025-04-29 11:09:08,811 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:09:08,812 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:09:08,812 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:09:08,812 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:09:08,818 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:08" (1/1) ... [2025-04-29 11:09:08,819 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:08" (1/1) ... [2025-04-29 11:09:08,828 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:08" (1/1) ... [2025-04-29 11:09:08,828 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:08" (1/1) ... [2025-04-29 11:09:08,840 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:08" (1/1) ... [2025-04-29 11:09:08,844 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:08" (1/1) ... [2025-04-29 11:09:08,846 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:08" (1/1) ... [2025-04-29 11:09:08,847 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:08" (1/1) ... [2025-04-29 11:09:08,848 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:08" (1/1) ... [2025-04-29 11:09:08,855 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:09:08,856 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:09:08,856 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:09:08,856 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:09:08,857 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:08" (1/1) ... [2025-04-29 11:09:08,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:09:08,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:08,878 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:08,881 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:08,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-04-29 11:09:08,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-04-29 11:09:08,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:09:08,899 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:09:08,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-29 11:09:08,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-04-29 11:09:08,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:09:08,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:09:08,899 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:09:08,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:09:08,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:09:08,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:09:08,900 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:09:08,900 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:09:08,900 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:08,986 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:09:08,988 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:09:09,382 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:09:09,382 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:09:09,411 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:09:09,411 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:09:09,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:09:09 BoogieIcfgContainer [2025-04-29 11:09:09,413 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:09:09,415 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:09:09,415 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:09:09,418 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:09:09,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:09:08" (1/3) ... [2025-04-29 11:09:09,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6edfadb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:09:09, skipping insertion in model container [2025-04-29 11:09:09,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:08" (2/3) ... [2025-04-29 11:09:09,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6edfadb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:09:09, skipping insertion in model container [2025-04-29 11:09:09,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:09:09" (3/3) ... [2025-04-29 11:09:09,421 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_11-arraylist_nr.c [2025-04-29 11:09:09,431 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:09:09,432 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_11-arraylist_nr.c that has 2 procedures, 296 locations, 298 edges, 1 initial locations, 2 loop locations, and 18 error locations. [2025-04-29 11:09:09,433 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:09:09,514 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:09:09,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 299 places, 299 transitions, 602 flow [2025-04-29 11:09:09,647 INFO L116 PetriNetUnfolderBase]: 4/298 cut-off events. [2025-04-29 11:09:09,650 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:09:09,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 298 events. 4/298 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 397 event pairs, 0 based on Foata normal form. 0/276 useless extension candidates. Maximal degree in co-relation 170. Up to 2 conditions per place. [2025-04-29 11:09:09,654 INFO L82 GeneralOperation]: Start removeDead. Operand has 299 places, 299 transitions, 602 flow [2025-04-29 11:09:09,661 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 298 places, 298 transitions, 599 flow [2025-04-29 11:09:09,668 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:09:09,676 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;@221aec11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:09:09,678 INFO L341 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-04-29 11:09:09,697 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:09:09,697 INFO L116 PetriNetUnfolderBase]: 3/91 cut-off events. [2025-04-29 11:09:09,698 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:09:09,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:09,698 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] [2025-04-29 11:09:09,699 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:09,703 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:09,703 INFO L85 PathProgramCache]: Analyzing trace with hash -589550235, now seen corresponding path program 1 times [2025-04-29 11:09:09,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:09,708 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515178515] [2025-04-29 11:09:09,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:09,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:09,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-29 11:09:09,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-29 11:09:09,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:09,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:09,918 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:09,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:09,920 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515178515] [2025-04-29 11:09:09,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515178515] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:09,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:09,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:09:09,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518164620] [2025-04-29 11:09:09,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:09,926 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:09:09,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:09,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:09:09,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:09:09,964 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 299 [2025-04-29 11:09:09,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 298 transitions, 599 flow. Second operand has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 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:09,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:09,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 299 [2025-04-29 11:09:09,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:10,069 INFO L116 PetriNetUnfolderBase]: 8/376 cut-off events. [2025-04-29 11:09:10,069 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:09:10,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 376 events. 8/376 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 873 event pairs, 6 based on Foata normal form. 5/350 useless extension candidates. Maximal degree in co-relation 219. Up to 24 conditions per place. [2025-04-29 11:09:10,073 INFO L140 encePairwiseOnDemand]: 294/299 looper letters, 10 selfloop transitions, 2 changer transitions 1/297 dead transitions. [2025-04-29 11:09:10,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 297 transitions, 621 flow [2025-04-29 11:09:10,075 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:09:10,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:09:10,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 873 transitions. [2025-04-29 11:09:10,089 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9732441471571907 [2025-04-29 11:09:10,090 INFO L175 Difference]: Start difference. First operand has 298 places, 298 transitions, 599 flow. Second operand 3 states and 873 transitions. [2025-04-29 11:09:10,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 297 transitions, 621 flow [2025-04-29 11:09:10,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 297 transitions, 620 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:09:10,101 INFO L231 Difference]: Finished difference. Result has 300 places, 296 transitions, 604 flow [2025-04-29 11:09:10,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=604, PETRI_PLACES=300, PETRI_TRANSITIONS=296} [2025-04-29 11:09:10,107 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, 2 predicate places. [2025-04-29 11:09:10,108 INFO L485 AbstractCegarLoop]: Abstraction has has 300 places, 296 transitions, 604 flow [2025-04-29 11:09:10,108 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 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:10,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:10,108 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:10,109 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:09:10,109 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:10,109 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:10,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1875301058, now seen corresponding path program 1 times [2025-04-29 11:09:10,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:10,110 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417642894] [2025-04-29 11:09:10,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:10,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:10,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-04-29 11:09:10,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-29 11:09:10,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:10,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:10,255 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:10,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:10,255 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417642894] [2025-04-29 11:09:10,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417642894] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:10,255 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444520188] [2025-04-29 11:09:10,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:10,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:10,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:10,259 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:10,260 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:10,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-04-29 11:09:10,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-29 11:09:10,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:10,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:10,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:09:10,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:10,373 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:10,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:09:10,413 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:10,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444520188] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:09:10,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:09:10,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-29 11:09:10,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013586465] [2025-04-29 11:09:10,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:09:10,415 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:09:10,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:10,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:09:10,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:09:10,442 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 299 [2025-04-29 11:09:10,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 296 transitions, 604 flow. Second operand has 10 states, 10 states have (on average 284.8) internal successors, (2848), 10 states have internal predecessors, (2848), 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:10,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:10,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 299 [2025-04-29 11:09:10,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:10,571 INFO L116 PetriNetUnfolderBase]: 8/382 cut-off events. [2025-04-29 11:09:10,571 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:09:10,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 382 events. 8/382 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 870 event pairs, 6 based on Foata normal form. 2/354 useless extension candidates. Maximal degree in co-relation 384. Up to 24 conditions per place. [2025-04-29 11:09:10,573 INFO L140 encePairwiseOnDemand]: 293/299 looper letters, 14 selfloop transitions, 9 changer transitions 0/304 dead transitions. [2025-04-29 11:09:10,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 304 transitions, 668 flow [2025-04-29 11:09:10,574 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:09:10,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:09:10,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2572 transitions. [2025-04-29 11:09:10,580 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9557785209959123 [2025-04-29 11:09:10,580 INFO L175 Difference]: Start difference. First operand has 300 places, 296 transitions, 604 flow. Second operand 9 states and 2572 transitions. [2025-04-29 11:09:10,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 304 transitions, 668 flow [2025-04-29 11:09:10,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 304 transitions, 666 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:09:10,587 INFO L231 Difference]: Finished difference. Result has 309 places, 302 transitions, 652 flow [2025-04-29 11:09:10,588 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=652, PETRI_PLACES=309, PETRI_TRANSITIONS=302} [2025-04-29 11:09:10,589 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, 11 predicate places. [2025-04-29 11:09:10,589 INFO L485 AbstractCegarLoop]: Abstraction has has 309 places, 302 transitions, 652 flow [2025-04-29 11:09:10,590 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 284.8) internal successors, (2848), 10 states have internal predecessors, (2848), 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:10,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:10,590 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] [2025-04-29 11:09:10,597 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:10,791 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:10,791 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:10,792 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:10,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1109611682, now seen corresponding path program 2 times [2025-04-29 11:09:10,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:10,792 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228032404] [2025-04-29 11:09:10,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:09:10,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:10,805 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 74 statements into 2 equivalence classes. [2025-04-29 11:09:10,818 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 59 of 74 statements. [2025-04-29 11:09:10,819 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:09:10,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:11,195 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:11,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:11,196 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228032404] [2025-04-29 11:09:11,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228032404] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:11,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:11,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:11,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344164634] [2025-04-29 11:09:11,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:11,198 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:11,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:11,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:11,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:11,598 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 299 [2025-04-29 11:09:11,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 302 transitions, 652 flow. Second operand has 6 states, 6 states have (on average 215.33333333333334) internal successors, (1292), 6 states have internal predecessors, (1292), 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:11,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:11,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 299 [2025-04-29 11:09:11,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:11,940 INFO L116 PetriNetUnfolderBase]: 366/1657 cut-off events. [2025-04-29 11:09:11,940 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-29 11:09:11,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2499 conditions, 1657 events. 366/1657 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10061 event pairs, 364 based on Foata normal form. 0/1531 useless extension candidates. Maximal degree in co-relation 2426. Up to 800 conditions per place. [2025-04-29 11:09:11,951 INFO L140 encePairwiseOnDemand]: 287/299 looper letters, 71 selfloop transitions, 10 changer transitions 0/300 dead transitions. [2025-04-29 11:09:11,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 300 transitions, 810 flow [2025-04-29 11:09:11,952 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:11,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1367 transitions. [2025-04-29 11:09:11,956 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.761984392419175 [2025-04-29 11:09:11,956 INFO L175 Difference]: Start difference. First operand has 309 places, 302 transitions, 652 flow. Second operand 6 states and 1367 transitions. [2025-04-29 11:09:11,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 300 transitions, 810 flow [2025-04-29 11:09:11,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 300 transitions, 804 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-29 11:09:11,963 INFO L231 Difference]: Finished difference. Result has 311 places, 300 transitions, 662 flow [2025-04-29 11:09:11,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=662, PETRI_PLACES=311, PETRI_TRANSITIONS=300} [2025-04-29 11:09:11,964 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, 13 predicate places. [2025-04-29 11:09:11,964 INFO L485 AbstractCegarLoop]: Abstraction has has 311 places, 300 transitions, 662 flow [2025-04-29 11:09:11,965 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 215.33333333333334) internal successors, (1292), 6 states have internal predecessors, (1292), 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:11,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:11,965 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] [2025-04-29 11:09:11,965 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:09:11,966 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:11,966 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:11,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1344074248, now seen corresponding path program 1 times [2025-04-29 11:09:11,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:11,966 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617255108] [2025-04-29 11:09:11,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:11,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:11,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-04-29 11:09:11,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-04-29 11:09:11,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:11,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:12,029 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:12,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:12,029 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617255108] [2025-04-29 11:09:12,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617255108] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:12,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:12,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:09:12,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734418085] [2025-04-29 11:09:12,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:12,030 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:09:12,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:12,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:09:12,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:09:12,066 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 299 [2025-04-29 11:09:12,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 300 transitions, 662 flow. Second operand has 3 states, 3 states have (on average 288.0) internal successors, (864), 3 states have internal predecessors, (864), 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:12,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:12,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 299 [2025-04-29 11:09:12,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:12,117 INFO L116 PetriNetUnfolderBase]: 8/491 cut-off events. [2025-04-29 11:09:12,118 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-29 11:09:12,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 566 conditions, 491 events. 8/491 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 869 event pairs, 6 based on Foata normal form. 1/458 useless extension candidates. Maximal degree in co-relation 494. Up to 24 conditions per place. [2025-04-29 11:09:12,120 INFO L140 encePairwiseOnDemand]: 296/299 looper letters, 10 selfloop transitions, 2 changer transitions 0/301 dead transitions. [2025-04-29 11:09:12,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 301 transitions, 688 flow [2025-04-29 11:09:12,120 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:09:12,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:09:12,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 871 transitions. [2025-04-29 11:09:12,122 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9710144927536232 [2025-04-29 11:09:12,122 INFO L175 Difference]: Start difference. First operand has 311 places, 300 transitions, 662 flow. Second operand 3 states and 871 transitions. [2025-04-29 11:09:12,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 301 transitions, 688 flow [2025-04-29 11:09:12,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 301 transitions, 668 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:12,127 INFO L231 Difference]: Finished difference. Result has 309 places, 301 transitions, 654 flow [2025-04-29 11:09:12,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=654, PETRI_PLACES=309, PETRI_TRANSITIONS=301} [2025-04-29 11:09:12,129 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, 11 predicate places. [2025-04-29 11:09:12,129 INFO L485 AbstractCegarLoop]: Abstraction has has 309 places, 301 transitions, 654 flow [2025-04-29 11:09:12,130 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 288.0) internal successors, (864), 3 states have internal predecessors, (864), 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:12,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:12,130 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, 1, 1] [2025-04-29 11:09:12,130 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:09:12,130 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:12,131 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:12,131 INFO L85 PathProgramCache]: Analyzing trace with hash 632790328, now seen corresponding path program 1 times [2025-04-29 11:09:12,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:12,131 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949891153] [2025-04-29 11:09:12,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:12,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:12,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-04-29 11:09:12,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-04-29 11:09:12,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:12,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:12,269 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:12,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:12,269 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949891153] [2025-04-29 11:09:12,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949891153] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:12,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748641898] [2025-04-29 11:09:12,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:12,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:12,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:12,273 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:12,276 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:12,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-04-29 11:09:12,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-04-29 11:09:12,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:12,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:12,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:09:12,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:12,388 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:12,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:09:12,466 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:12,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748641898] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:09:12,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:09:12,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-04-29 11:09:12,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464973930] [2025-04-29 11:09:12,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:09:12,468 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:09:12,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:12,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:09:12,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:09:12,499 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 299 [2025-04-29 11:09:12,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 301 transitions, 654 flow. Second operand has 18 states, 18 states have (on average 284.8888888888889) internal successors, (5128), 18 states have internal predecessors, (5128), 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:12,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:12,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 299 [2025-04-29 11:09:12,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:12,692 INFO L116 PetriNetUnfolderBase]: 8/511 cut-off events. [2025-04-29 11:09:12,692 INFO L117 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-04-29 11:09:12,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 623 conditions, 511 events. 8/511 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 860 event pairs, 6 based on Foata normal form. 4/481 useless extension candidates. Maximal degree in co-relation 476. Up to 24 conditions per place. [2025-04-29 11:09:12,694 INFO L140 encePairwiseOnDemand]: 293/299 looper letters, 18 selfloop transitions, 21 changer transitions 0/319 dead transitions. [2025-04-29 11:09:12,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 319 transitions, 820 flow [2025-04-29 11:09:12,694 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:09:12,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-29 11:09:12,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 5986 transitions. [2025-04-29 11:09:12,702 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9533365185539099 [2025-04-29 11:09:12,702 INFO L175 Difference]: Start difference. First operand has 309 places, 301 transitions, 654 flow. Second operand 21 states and 5986 transitions. [2025-04-29 11:09:12,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 319 transitions, 820 flow [2025-04-29 11:09:12,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 319 transitions, 818 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:09:12,706 INFO L231 Difference]: Finished difference. Result has 333 places, 314 transitions, 782 flow [2025-04-29 11:09:12,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=782, PETRI_PLACES=333, PETRI_TRANSITIONS=314} [2025-04-29 11:09:12,707 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, 35 predicate places. [2025-04-29 11:09:12,707 INFO L485 AbstractCegarLoop]: Abstraction has has 333 places, 314 transitions, 782 flow [2025-04-29 11:09:12,709 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 284.8888888888889) internal successors, (5128), 18 states have internal predecessors, (5128), 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:12,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:12,709 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] [2025-04-29 11:09:12,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 11:09:12,914 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:12,914 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:12,914 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:12,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1043048200, now seen corresponding path program 2 times [2025-04-29 11:09:12,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:12,915 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430388696] [2025-04-29 11:09:12,915 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:09:12,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:12,925 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 102 statements into 2 equivalence classes. [2025-04-29 11:09:12,935 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 102 statements. [2025-04-29 11:09:12,935 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:09:12,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:13,173 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:13,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:13,173 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430388696] [2025-04-29 11:09:13,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430388696] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:13,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:13,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:13,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217853135] [2025-04-29 11:09:13,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:13,173 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:13,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:13,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:13,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:13,511 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 299 [2025-04-29 11:09:13,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 314 transitions, 782 flow. Second operand has 6 states, 6 states have (on average 215.33333333333334) internal successors, (1292), 6 states have internal predecessors, (1292), 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:13,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:13,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 299 [2025-04-29 11:09:13,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:13,757 INFO L116 PetriNetUnfolderBase]: 366/1784 cut-off events. [2025-04-29 11:09:13,757 INFO L117 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-04-29 11:09:13,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2734 conditions, 1784 events. 366/1784 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10114 event pairs, 364 based on Foata normal form. 0/1656 useless extension candidates. Maximal degree in co-relation 2581. Up to 830 conditions per place. [2025-04-29 11:09:13,766 INFO L140 encePairwiseOnDemand]: 287/299 looper letters, 71 selfloop transitions, 10 changer transitions 0/312 dead transitions. [2025-04-29 11:09:13,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 312 transitions, 940 flow [2025-04-29 11:09:13,767 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:13,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:13,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1367 transitions. [2025-04-29 11:09:13,769 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.761984392419175 [2025-04-29 11:09:13,769 INFO L175 Difference]: Start difference. First operand has 333 places, 314 transitions, 782 flow. Second operand 6 states and 1367 transitions. [2025-04-29 11:09:13,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 312 transitions, 940 flow [2025-04-29 11:09:13,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 312 transitions, 916 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-29 11:09:13,775 INFO L231 Difference]: Finished difference. Result has 330 places, 312 transitions, 774 flow [2025-04-29 11:09:13,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=774, PETRI_PLACES=330, PETRI_TRANSITIONS=312} [2025-04-29 11:09:13,776 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, 32 predicate places. [2025-04-29 11:09:13,776 INFO L485 AbstractCegarLoop]: Abstraction has has 330 places, 312 transitions, 774 flow [2025-04-29 11:09:13,776 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 215.33333333333334) internal successors, (1292), 6 states have internal predecessors, (1292), 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:13,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:13,777 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, 1, 1] [2025-04-29 11:09:13,777 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:09:13,777 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:13,777 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:13,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1355168357, now seen corresponding path program 1 times [2025-04-29 11:09:13,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:13,777 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129380425] [2025-04-29 11:09:13,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:13,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:13,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-04-29 11:09:13,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-04-29 11:09:13,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:13,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:14,035 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:14,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:14,036 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129380425] [2025-04-29 11:09:14,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129380425] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:14,036 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556868001] [2025-04-29 11:09:14,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:14,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:14,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:14,038 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:14,039 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:14,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-04-29 11:09:14,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-04-29 11:09:14,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:14,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:14,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-29 11:09:14,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:14,189 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:14,189 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:09:14,350 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:14,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556868001] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:09:14,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:09:14,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-04-29 11:09:14,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431981497] [2025-04-29 11:09:14,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:09:14,353 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:09:14,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:14,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:09:14,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:09:14,381 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 299 [2025-04-29 11:09:14,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 312 transitions, 774 flow. Second operand has 23 states, 23 states have (on average 285.0) internal successors, (6555), 23 states have internal predecessors, (6555), 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:14,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:14,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 299 [2025-04-29 11:09:14,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:14,656 INFO L116 PetriNetUnfolderBase]: 8/522 cut-off events. [2025-04-29 11:09:14,657 INFO L117 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-04-29 11:09:14,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 522 events. 8/522 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 847 event pairs, 6 based on Foata normal form. 3/495 useless extension candidates. Maximal degree in co-relation 498. Up to 24 conditions per place. [2025-04-29 11:09:14,658 INFO L140 encePairwiseOnDemand]: 293/299 looper letters, 21 selfloop transitions, 30 changer transitions 0/329 dead transitions. [2025-04-29 11:09:14,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 329 transitions, 998 flow [2025-04-29 11:09:14,659 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-29 11:09:14,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-29 11:09:14,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 8544 transitions. [2025-04-29 11:09:14,672 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9525083612040134 [2025-04-29 11:09:14,672 INFO L175 Difference]: Start difference. First operand has 330 places, 312 transitions, 774 flow. Second operand 30 states and 8544 transitions. [2025-04-29 11:09:14,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 329 transitions, 998 flow [2025-04-29 11:09:14,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 329 transitions, 978 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:14,679 INFO L231 Difference]: Finished difference. Result has 358 places, 322 transitions, 906 flow [2025-04-29 11:09:14,680 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=906, PETRI_PLACES=358, PETRI_TRANSITIONS=322} [2025-04-29 11:09:14,680 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, 60 predicate places. [2025-04-29 11:09:14,680 INFO L485 AbstractCegarLoop]: Abstraction has has 358 places, 322 transitions, 906 flow [2025-04-29 11:09:14,683 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 285.0) internal successors, (6555), 23 states have internal predecessors, (6555), 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:14,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:14,683 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] [2025-04-29 11:09:14,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-29 11:09:14,888 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:14,888 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:14,888 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:14,889 INFO L85 PathProgramCache]: Analyzing trace with hash -667880824, now seen corresponding path program 2 times [2025-04-29 11:09:14,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:14,889 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467616575] [2025-04-29 11:09:14,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:09:14,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:14,900 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 129 statements into 2 equivalence classes. [2025-04-29 11:09:14,905 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 79 of 129 statements. [2025-04-29 11:09:14,905 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:09:14,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:15,158 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:15,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:15,159 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467616575] [2025-04-29 11:09:15,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467616575] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:15,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:15,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:15,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223573572] [2025-04-29 11:09:15,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:15,159 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:15,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:15,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:15,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:15,565 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 299 [2025-04-29 11:09:15,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 322 transitions, 906 flow. Second operand has 6 states, 6 states have (on average 211.83333333333334) internal successors, (1271), 6 states have internal predecessors, (1271), 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:15,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:15,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 299 [2025-04-29 11:09:15,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:15,751 INFO L116 PetriNetUnfolderBase]: 392/1887 cut-off events. [2025-04-29 11:09:15,752 INFO L117 PetriNetUnfolderBase]: For 121/121 co-relation queries the response was YES. [2025-04-29 11:09:15,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2964 conditions, 1887 events. 392/1887 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 10788 event pairs, 390 based on Foata normal form. 0/1755 useless extension candidates. Maximal degree in co-relation 2732. Up to 899 conditions per place. [2025-04-29 11:09:15,759 INFO L140 encePairwiseOnDemand]: 293/299 looper letters, 83 selfloop transitions, 5 changer transitions 0/321 dead transitions. [2025-04-29 11:09:15,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 321 transitions, 1080 flow [2025-04-29 11:09:15,759 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:15,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:15,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1342 transitions. [2025-04-29 11:09:15,762 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7480490523968785 [2025-04-29 11:09:15,762 INFO L175 Difference]: Start difference. First operand has 358 places, 322 transitions, 906 flow. Second operand 6 states and 1342 transitions. [2025-04-29 11:09:15,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 321 transitions, 1080 flow [2025-04-29 11:09:15,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 321 transitions, 1034 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-04-29 11:09:15,767 INFO L231 Difference]: Finished difference. Result has 344 places, 321 transitions, 868 flow [2025-04-29 11:09:15,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=868, PETRI_PLACES=344, PETRI_TRANSITIONS=321} [2025-04-29 11:09:15,767 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, 46 predicate places. [2025-04-29 11:09:15,767 INFO L485 AbstractCegarLoop]: Abstraction has has 344 places, 321 transitions, 868 flow [2025-04-29 11:09:15,768 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 211.83333333333334) internal successors, (1271), 6 states have internal predecessors, (1271), 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:15,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:15,768 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] [2025-04-29 11:09:15,768 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:09:15,768 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:15,769 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:15,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1205151697, now seen corresponding path program 1 times [2025-04-29 11:09:15,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:15,769 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818199244] [2025-04-29 11:09:15,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:15,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:15,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-04-29 11:09:15,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-04-29 11:09:15,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:15,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:16,147 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:16,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:16,147 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818199244] [2025-04-29 11:09:16,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818199244] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:16,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:16,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:16,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722748867] [2025-04-29 11:09:16,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:16,148 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:16,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:16,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:16,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:16,727 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 299 [2025-04-29 11:09:16,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 321 transitions, 868 flow. Second operand has 6 states, 6 states have (on average 239.83333333333334) internal successors, (1439), 6 states have internal predecessors, (1439), 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:16,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:16,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 299 [2025-04-29 11:09:16,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:16,809 INFO L116 PetriNetUnfolderBase]: 56/761 cut-off events. [2025-04-29 11:09:16,809 INFO L117 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-04-29 11:09:16,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1122 conditions, 761 events. 56/761 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2626 event pairs, 54 based on Foata normal form. 0/709 useless extension candidates. Maximal degree in co-relation 911. Up to 195 conditions per place. [2025-04-29 11:09:16,812 INFO L140 encePairwiseOnDemand]: 293/299 looper letters, 57 selfloop transitions, 5 changer transitions 0/320 dead transitions. [2025-04-29 11:09:16,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 320 transitions, 990 flow [2025-04-29 11:09:16,813 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:16,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:16,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1472 transitions. [2025-04-29 11:09:16,815 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8205128205128205 [2025-04-29 11:09:16,816 INFO L175 Difference]: Start difference. First operand has 344 places, 321 transitions, 868 flow. Second operand 6 states and 1472 transitions. [2025-04-29 11:09:16,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 320 transitions, 990 flow [2025-04-29 11:09:16,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 320 transitions, 980 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:16,821 INFO L231 Difference]: Finished difference. Result has 343 places, 320 transitions, 866 flow [2025-04-29 11:09:16,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=866, PETRI_PLACES=343, PETRI_TRANSITIONS=320} [2025-04-29 11:09:16,822 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, 45 predicate places. [2025-04-29 11:09:16,823 INFO L485 AbstractCegarLoop]: Abstraction has has 343 places, 320 transitions, 866 flow [2025-04-29 11:09:16,825 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 239.83333333333334) internal successors, (1439), 6 states have internal predecessors, (1439), 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:16,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:16,825 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] [2025-04-29 11:09:16,825 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:09:16,825 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:16,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:16,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1903586192, now seen corresponding path program 1 times [2025-04-29 11:09:16,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:16,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963091102] [2025-04-29 11:09:16,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:16,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:16,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-04-29 11:09:16,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-04-29 11:09:16,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:16,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:17,230 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:17,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:17,231 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963091102] [2025-04-29 11:09:17,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963091102] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:17,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:17,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:17,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917540979] [2025-04-29 11:09:17,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:17,232 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:17,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:17,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:17,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:17,539 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 299 [2025-04-29 11:09:17,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 320 transitions, 866 flow. Second operand has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:17,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:17,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 299 [2025-04-29 11:09:17,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:17,650 INFO L116 PetriNetUnfolderBase]: 38/676 cut-off events. [2025-04-29 11:09:17,650 INFO L117 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-04-29 11:09:17,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1000 conditions, 676 events. 38/676 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2082 event pairs, 36 based on Foata normal form. 0/637 useless extension candidates. Maximal degree in co-relation 791. Up to 158 conditions per place. [2025-04-29 11:09:17,653 INFO L140 encePairwiseOnDemand]: 293/299 looper letters, 53 selfloop transitions, 5 changer transitions 0/319 dead transitions. [2025-04-29 11:09:17,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 319 transitions, 980 flow [2025-04-29 11:09:17,653 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:17,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:17,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1487 transitions. [2025-04-29 11:09:17,655 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8288740245261984 [2025-04-29 11:09:17,656 INFO L175 Difference]: Start difference. First operand has 343 places, 320 transitions, 866 flow. Second operand 6 states and 1487 transitions. [2025-04-29 11:09:17,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 319 transitions, 980 flow [2025-04-29 11:09:17,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 319 transitions, 970 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:17,660 INFO L231 Difference]: Finished difference. Result has 342 places, 319 transitions, 864 flow [2025-04-29 11:09:17,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, 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:17,661 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, 44 predicate places. [2025-04-29 11:09:17,661 INFO L485 AbstractCegarLoop]: Abstraction has has 342 places, 319 transitions, 864 flow [2025-04-29 11:09:17,661 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:17,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:17,662 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] [2025-04-29 11:09:17,662 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:09:17,662 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:17,662 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:17,663 INFO L85 PathProgramCache]: Analyzing trace with hash -867875296, now seen corresponding path program 1 times [2025-04-29 11:09:17,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:17,663 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103892818] [2025-04-29 11:09:17,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:17,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:17,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-04-29 11:09:17,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-04-29 11:09:17,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:17,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:18,002 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:18,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:18,002 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103892818] [2025-04-29 11:09:18,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103892818] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:18,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:18,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:18,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730796734] [2025-04-29 11:09:18,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:18,003 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:18,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:18,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:18,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:18,220 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 299 [2025-04-29 11:09:18,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 319 transitions, 864 flow. Second operand has 6 states, 6 states have (on average 218.16666666666666) internal successors, (1309), 6 states have internal predecessors, (1309), 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:18,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:18,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 299 [2025-04-29 11:09:18,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:18,397 INFO L116 PetriNetUnfolderBase]: 366/1791 cut-off events. [2025-04-29 11:09:18,398 INFO L117 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-04-29 11:09:18,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2803 conditions, 1791 events. 366/1791 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10067 event pairs, 364 based on Foata normal form. 0/1671 useless extension candidates. Maximal degree in co-relation 2594. Up to 846 conditions per place. [2025-04-29 11:09:18,403 INFO L140 encePairwiseOnDemand]: 293/299 looper letters, 79 selfloop transitions, 5 changer transitions 0/318 dead transitions. [2025-04-29 11:09:18,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 318 transitions, 1030 flow [2025-04-29 11:09:18,404 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:18,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:18,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1357 transitions. [2025-04-29 11:09:18,406 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7564102564102564 [2025-04-29 11:09:18,406 INFO L175 Difference]: Start difference. First operand has 342 places, 319 transitions, 864 flow. Second operand 6 states and 1357 transitions. [2025-04-29 11:09:18,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 318 transitions, 1030 flow [2025-04-29 11:09:18,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 318 transitions, 1020 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:18,410 INFO L231 Difference]: Finished difference. Result has 341 places, 318 transitions, 862 flow [2025-04-29 11:09:18,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, 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:18,411 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, 43 predicate places. [2025-04-29 11:09:18,411 INFO L485 AbstractCegarLoop]: Abstraction has has 341 places, 318 transitions, 862 flow [2025-04-29 11:09:18,411 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 218.16666666666666) internal successors, (1309), 6 states have internal predecessors, (1309), 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:18,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:18,412 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] [2025-04-29 11:09:18,412 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:09:18,412 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:18,412 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:18,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1703215518, now seen corresponding path program 1 times [2025-04-29 11:09:18,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:18,413 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19591553] [2025-04-29 11:09:18,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:18,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:18,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-04-29 11:09:18,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-04-29 11:09:18,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:18,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:18,742 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:18,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:18,742 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19591553] [2025-04-29 11:09:18,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19591553] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:18,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:18,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:18,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458082012] [2025-04-29 11:09:18,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:18,743 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:18,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:18,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:18,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:19,055 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 299 [2025-04-29 11:09:19,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 318 transitions, 862 flow. Second operand has 6 states, 6 states have (on average 219.66666666666666) internal successors, (1318), 6 states have internal predecessors, (1318), 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:19,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:19,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 299 [2025-04-29 11:09:19,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:19,239 INFO L116 PetriNetUnfolderBase]: 366/1789 cut-off events. [2025-04-29 11:09:19,239 INFO L117 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-04-29 11:09:19,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2799 conditions, 1789 events. 366/1789 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10024 event pairs, 364 based on Foata normal form. 0/1671 useless extension candidates. Maximal degree in co-relation 2590. Up to 844 conditions per place. [2025-04-29 11:09:19,246 INFO L140 encePairwiseOnDemand]: 293/299 looper letters, 78 selfloop transitions, 5 changer transitions 0/317 dead transitions. [2025-04-29 11:09:19,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 317 transitions, 1026 flow [2025-04-29 11:09:19,247 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:19,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:19,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1362 transitions. [2025-04-29 11:09:19,248 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7591973244147158 [2025-04-29 11:09:19,248 INFO L175 Difference]: Start difference. First operand has 341 places, 318 transitions, 862 flow. Second operand 6 states and 1362 transitions. [2025-04-29 11:09:19,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 317 transitions, 1026 flow [2025-04-29 11:09:19,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 317 transitions, 1016 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:19,253 INFO L231 Difference]: Finished difference. Result has 340 places, 317 transitions, 860 flow [2025-04-29 11:09:19,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, 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:19,254 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, 42 predicate places. [2025-04-29 11:09:19,254 INFO L485 AbstractCegarLoop]: Abstraction has has 340 places, 317 transitions, 860 flow [2025-04-29 11:09:19,254 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 219.66666666666666) internal successors, (1318), 6 states have internal predecessors, (1318), 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:19,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:19,255 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, 1, 1] [2025-04-29 11:09:19,255 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:09:19,255 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:19,255 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:19,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1226905913, now seen corresponding path program 1 times [2025-04-29 11:09:19,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:19,256 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093737858] [2025-04-29 11:09:19,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:19,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:19,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-04-29 11:09:19,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-04-29 11:09:19,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:19,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:19,370 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:19,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:19,370 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093737858] [2025-04-29 11:09:19,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093737858] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:19,370 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111684391] [2025-04-29 11:09:19,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:19,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:19,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:19,372 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:19,374 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:19,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-04-29 11:09:19,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-04-29 11:09:19,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:19,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:19,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:09:19,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:19,629 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:19,630 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:09:19,741 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:19,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111684391] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:09:19,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:09:19,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-29 11:09:19,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868616956] [2025-04-29 11:09:19,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:09:19,742 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:09:19,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:19,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:09:19,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:09:19,841 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 299 [2025-04-29 11:09:19,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 317 transitions, 860 flow. Second operand has 10 states, 10 states have (on average 285.0) internal successors, (2850), 10 states have internal predecessors, (2850), 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:19,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:19,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 299 [2025-04-29 11:09:19,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:19,945 INFO L116 PetriNetUnfolderBase]: 8/619 cut-off events. [2025-04-29 11:09:19,945 INFO L117 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-04-29 11:09:19,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 619 events. 8/619 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 385 event pairs, 6 based on Foata normal form. 2/601 useless extension candidates. Maximal degree in co-relation 607. Up to 24 conditions per place. [2025-04-29 11:09:19,947 INFO L140 encePairwiseOnDemand]: 293/299 looper letters, 14 selfloop transitions, 9 changer transitions 0/325 dead transitions. [2025-04-29 11:09:19,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 325 transitions, 924 flow [2025-04-29 11:09:19,947 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:09:19,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:09:19,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2572 transitions. [2025-04-29 11:09:19,950 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9557785209959123 [2025-04-29 11:09:19,950 INFO L175 Difference]: Start difference. First operand has 340 places, 317 transitions, 860 flow. Second operand 9 states and 2572 transitions. [2025-04-29 11:09:19,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 325 transitions, 924 flow [2025-04-29 11:09:19,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 325 transitions, 914 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:19,955 INFO L231 Difference]: Finished difference. Result has 346 places, 323 transitions, 900 flow [2025-04-29 11:09:19,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, 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=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=900, PETRI_PLACES=346, PETRI_TRANSITIONS=323} [2025-04-29 11:09:19,956 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, 48 predicate places. [2025-04-29 11:09:19,956 INFO L485 AbstractCegarLoop]: Abstraction has has 346 places, 323 transitions, 900 flow [2025-04-29 11:09:19,957 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 285.0) internal successors, (2850), 10 states have internal predecessors, (2850), 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:19,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:19,957 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] [2025-04-29 11:09:19,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-29 11:09:20,158 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:20,158 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:20,160 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:20,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1316836729, now seen corresponding path program 2 times [2025-04-29 11:09:20,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:20,160 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682011535] [2025-04-29 11:09:20,160 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:09:20,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:20,201 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 425 statements into 2 equivalence classes. [2025-04-29 11:09:20,203 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 60 of 425 statements. [2025-04-29 11:09:20,203 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:09:20,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:20,301 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2025-04-29 11:09:20,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:20,301 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682011535] [2025-04-29 11:09:20,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682011535] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:20,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:20,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:20,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019527552] [2025-04-29 11:09:20,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:20,302 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:20,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:20,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:20,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:20,729 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 299 [2025-04-29 11:09:20,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 323 transitions, 900 flow. Second operand has 6 states, 6 states have (on average 244.33333333333334) internal successors, (1466), 6 states have internal predecessors, (1466), 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:20,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:20,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 299 [2025-04-29 11:09:20,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:21,143 INFO L116 PetriNetUnfolderBase]: 258/1936 cut-off events. [2025-04-29 11:09:21,143 INFO L117 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-04-29 11:09:21,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2739 conditions, 1936 events. 258/1936 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 10117 event pairs, 34 based on Foata normal form. 0/1810 useless extension candidates. Maximal degree in co-relation 2526. Up to 491 conditions per place. [2025-04-29 11:09:21,151 INFO L140 encePairwiseOnDemand]: 276/299 looper letters, 67 selfloop transitions, 70 changer transitions 0/401 dead transitions. [2025-04-29 11:09:21,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 401 transitions, 1330 flow [2025-04-29 11:09:21,152 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:21,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:21,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1566 transitions. [2025-04-29 11:09:21,152 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8729096989966555 [2025-04-29 11:09:21,153 INFO L175 Difference]: Start difference. First operand has 346 places, 323 transitions, 900 flow. Second operand 6 states and 1566 transitions. [2025-04-29 11:09:21,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 401 transitions, 1330 flow [2025-04-29 11:09:21,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 401 transitions, 1324 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-29 11:09:21,158 INFO L231 Difference]: Finished difference. Result has 355 places, 392 transitions, 1356 flow [2025-04-29 11:09:21,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1356, PETRI_PLACES=355, PETRI_TRANSITIONS=392} [2025-04-29 11:09:21,159 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, 57 predicate places. [2025-04-29 11:09:21,159 INFO L485 AbstractCegarLoop]: Abstraction has has 355 places, 392 transitions, 1356 flow [2025-04-29 11:09:21,159 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 244.33333333333334) internal successors, (1466), 6 states have internal predecessors, (1466), 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:21,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:21,159 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, 1, 1] [2025-04-29 11:09:21,159 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:09:21,159 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:21,160 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:21,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1784113988, now seen corresponding path program 1 times [2025-04-29 11:09:21,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:21,161 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122083011] [2025-04-29 11:09:21,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:21,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:21,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-04-29 11:09:21,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-04-29 11:09:21,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:21,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:21,476 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 486 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2025-04-29 11:09:21,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:21,476 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122083011] [2025-04-29 11:09:21,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122083011] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:21,476 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861294715] [2025-04-29 11:09:21,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:21,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:21,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:21,478 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:21,480 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:21,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-04-29 11:09:21,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-04-29 11:09:21,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:21,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:21,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 1544 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:09:21,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:22,038 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 486 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2025-04-29 11:09:22,038 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:09:22,334 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 486 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2025-04-29 11:09:22,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861294715] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:09:22,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:09:22,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-04-29 11:09:22,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095995498] [2025-04-29 11:09:22,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:09:22,335 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:09:22,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:22,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:09:22,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:09:22,512 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 299 [2025-04-29 11:09:22,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 392 transitions, 1356 flow. Second operand has 18 states, 18 states have (on average 285.0) internal successors, (5130), 18 states have internal predecessors, (5130), 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:22,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:22,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 299 [2025-04-29 11:09:22,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:22,916 INFO L116 PetriNetUnfolderBase]: 121/2012 cut-off events. [2025-04-29 11:09:22,916 INFO L117 PetriNetUnfolderBase]: For 309/329 co-relation queries the response was YES. [2025-04-29 11:09:22,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2814 conditions, 2012 events. 121/2012 cut-off events. For 309/329 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7257 event pairs, 21 based on Foata normal form. 4/1929 useless extension candidates. Maximal degree in co-relation 2597. Up to 206 conditions per place. [2025-04-29 11:09:22,922 INFO L140 encePairwiseOnDemand]: 293/299 looper letters, 19 selfloop transitions, 21 changer transitions 0/410 dead transitions. [2025-04-29 11:09:22,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 410 transitions, 1524 flow [2025-04-29 11:09:22,923 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:09:22,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-29 11:09:22,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 5986 transitions. [2025-04-29 11:09:22,925 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9533365185539099 [2025-04-29 11:09:22,925 INFO L175 Difference]: Start difference. First operand has 355 places, 392 transitions, 1356 flow. Second operand 21 states and 5986 transitions. [2025-04-29 11:09:22,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 410 transitions, 1524 flow [2025-04-29 11:09:22,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 410 transitions, 1524 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:09:22,931 INFO L231 Difference]: Finished difference. Result has 380 places, 405 transitions, 1486 flow [2025-04-29 11:09:22,931 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=1356, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1486, PETRI_PLACES=380, PETRI_TRANSITIONS=405} [2025-04-29 11:09:22,932 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, 82 predicate places. [2025-04-29 11:09:22,932 INFO L485 AbstractCegarLoop]: Abstraction has has 380 places, 405 transitions, 1486 flow [2025-04-29 11:09:22,933 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 285.0) internal successors, (5130), 18 states have internal predecessors, (5130), 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:22,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:22,936 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] [2025-04-29 11:09:22,943 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:23,136 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:23,137 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:23,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:23,138 INFO L85 PathProgramCache]: Analyzing trace with hash 289473220, now seen corresponding path program 2 times [2025-04-29 11:09:23,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:23,139 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504848744] [2025-04-29 11:09:23,139 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:09:23,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:23,226 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 851 statements into 2 equivalence classes. [2025-04-29 11:09:23,230 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 66 of 851 statements. [2025-04-29 11:09:23,230 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:09:23,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:23,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3819 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3819 trivial. 0 not checked. [2025-04-29 11:09:23,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:23,335 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504848744] [2025-04-29 11:09:23,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504848744] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:23,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:23,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:23,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270699793] [2025-04-29 11:09:23,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:23,336 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:23,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:23,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:23,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:23,715 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 299 [2025-04-29 11:09:23,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 405 transitions, 1486 flow. Second operand has 6 states, 6 states have (on average 244.16666666666666) internal successors, (1465), 6 states have internal predecessors, (1465), 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:23,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:23,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 299 [2025-04-29 11:09:23,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:24,333 INFO L116 PetriNetUnfolderBase]: 501/3081 cut-off events. [2025-04-29 11:09:24,333 INFO L117 PetriNetUnfolderBase]: For 982/1056 co-relation queries the response was YES. [2025-04-29 11:09:24,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5482 conditions, 3081 events. 501/3081 cut-off events. For 982/1056 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 16061 event pairs, 92 based on Foata normal form. 16/2940 useless extension candidates. Maximal degree in co-relation 5260. Up to 981 conditions per place. [2025-04-29 11:09:24,343 INFO L140 encePairwiseOnDemand]: 276/299 looper letters, 131 selfloop transitions, 130 changer transitions 0/542 dead transitions. [2025-04-29 11:09:24,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 542 transitions, 2658 flow [2025-04-29 11:09:24,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:24,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:24,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1565 transitions. [2025-04-29 11:09:24,344 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8723522853957637 [2025-04-29 11:09:24,344 INFO L175 Difference]: Start difference. First operand has 380 places, 405 transitions, 1486 flow. Second operand 6 states and 1565 transitions. [2025-04-29 11:09:24,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 542 transitions, 2658 flow [2025-04-29 11:09:24,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 542 transitions, 2634 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-29 11:09:24,353 INFO L231 Difference]: Finished difference. Result has 384 places, 534 transitions, 2690 flow [2025-04-29 11:09:24,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2690, PETRI_PLACES=384, PETRI_TRANSITIONS=534} [2025-04-29 11:09:24,354 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, 86 predicate places. [2025-04-29 11:09:24,354 INFO L485 AbstractCegarLoop]: Abstraction has has 384 places, 534 transitions, 2690 flow [2025-04-29 11:09:24,354 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 244.16666666666666) internal successors, (1465), 6 states have internal predecessors, (1465), 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:24,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:24,354 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, 1, 1] [2025-04-29 11:09:24,354 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:09:24,355 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:24,356 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:24,356 INFO L85 PathProgramCache]: Analyzing trace with hash -2052351367, now seen corresponding path program 1 times [2025-04-29 11:09:24,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:24,356 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192408414] [2025-04-29 11:09:24,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:24,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:24,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 861 statements into 1 equivalence classes. [2025-04-29 11:09:24,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 861 of 861 statements. [2025-04-29 11:09:24,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:24,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:25,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3819 backedges. 0 proven. 3388 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2025-04-29 11:09:25,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:25,571 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192408414] [2025-04-29 11:09:25,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192408414] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:25,571 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337644489] [2025-04-29 11:09:25,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:25,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:25,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:25,574 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:25,575 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:25,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 861 statements into 1 equivalence classes. [2025-04-29 11:09:26,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 861 of 861 statements. [2025-04-29 11:09:26,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:26,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:26,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 3261 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-29 11:09:26,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:26,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3819 backedges. 0 proven. 3388 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2025-04-29 11:09:26,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:09:27,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3819 backedges. 0 proven. 3388 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2025-04-29 11:09:27,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337644489] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:09:27,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:09:27,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-04-29 11:09:27,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372316140] [2025-04-29 11:09:27,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:09:27,275 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:09:27,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:27,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:09:27,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:09:27,487 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 299 [2025-04-29 11:09:27,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 534 transitions, 2690 flow. Second operand has 23 states, 23 states have (on average 285.0869565217391) internal successors, (6557), 23 states have internal predecessors, (6557), 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:27,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:27,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 299 [2025-04-29 11:09:27,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:28,282 INFO L116 PetriNetUnfolderBase]: 382/3092 cut-off events. [2025-04-29 11:09:28,282 INFO L117 PetriNetUnfolderBase]: For 1293/1335 co-relation queries the response was YES. [2025-04-29 11:09:28,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5387 conditions, 3092 events. 382/3092 cut-off events. For 1293/1335 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 13230 event pairs, 37 based on Foata normal form. 7/2991 useless extension candidates. Maximal degree in co-relation 5160. Up to 467 conditions per place. [2025-04-29 11:09:28,291 INFO L140 encePairwiseOnDemand]: 293/299 looper letters, 22 selfloop transitions, 30 changer transitions 0/551 dead transitions. [2025-04-29 11:09:28,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 551 transitions, 2916 flow [2025-04-29 11:09:28,292 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-29 11:09:28,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-29 11:09:28,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 8544 transitions. [2025-04-29 11:09:28,295 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9525083612040134 [2025-04-29 11:09:28,295 INFO L175 Difference]: Start difference. First operand has 384 places, 534 transitions, 2690 flow. Second operand 30 states and 8544 transitions. [2025-04-29 11:09:28,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 551 transitions, 2916 flow [2025-04-29 11:09:28,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 551 transitions, 2916 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:09:28,305 INFO L231 Difference]: Finished difference. Result has 417 places, 544 transitions, 2842 flow [2025-04-29 11:09:28,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=2690, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2842, PETRI_PLACES=417, PETRI_TRANSITIONS=544} [2025-04-29 11:09:28,306 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, 119 predicate places. [2025-04-29 11:09:28,306 INFO L485 AbstractCegarLoop]: Abstraction has has 417 places, 544 transitions, 2842 flow [2025-04-29 11:09:28,307 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 285.0869565217391) internal successors, (6557), 23 states have internal predecessors, (6557), 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:28,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:28,308 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] [2025-04-29 11:09:28,318 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:28,508 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:28,508 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:28,511 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:28,511 INFO L85 PathProgramCache]: Analyzing trace with hash 577448103, now seen corresponding path program 2 times [2025-04-29 11:09:28,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:28,511 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276175327] [2025-04-29 11:09:28,511 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:09:28,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:28,618 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1176 statements into 2 equivalence classes. [2025-04-29 11:09:28,621 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 76 of 1176 statements. [2025-04-29 11:09:28,621 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:09:28,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:28,745 INFO L134 CoverageAnalysis]: Checked inductivity of 7770 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7770 trivial. 0 not checked. [2025-04-29 11:09:28,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:28,746 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276175327] [2025-04-29 11:09:28,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276175327] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:28,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:28,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:28,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332114433] [2025-04-29 11:09:28,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:28,746 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:28,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:28,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:28,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:29,007 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 299 [2025-04-29 11:09:29,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 544 transitions, 2842 flow. Second operand has 6 states, 6 states have (on average 244.33333333333334) internal successors, (1466), 6 states have internal predecessors, (1466), 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:29,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:29,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 299 [2025-04-29 11:09:29,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:30,035 INFO L116 PetriNetUnfolderBase]: 777/4167 cut-off events. [2025-04-29 11:09:30,035 INFO L117 PetriNetUnfolderBase]: For 3426/3617 co-relation queries the response was YES. [2025-04-29 11:09:30,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8834 conditions, 4167 events. 777/4167 cut-off events. For 3426/3617 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 22302 event pairs, 65 based on Foata normal form. 52/4054 useless extension candidates. Maximal degree in co-relation 8603. Up to 1323 conditions per place. [2025-04-29 11:09:30,054 INFO L140 encePairwiseOnDemand]: 276/299 looper letters, 251 selfloop transitions, 131 changer transitions 5/682 dead transitions. [2025-04-29 11:09:30,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 682 transitions, 4516 flow [2025-04-29 11:09:30,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:30,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:30,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1566 transitions. [2025-04-29 11:09:30,056 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8729096989966555 [2025-04-29 11:09:30,056 INFO L175 Difference]: Start difference. First operand has 417 places, 544 transitions, 2842 flow. Second operand 6 states and 1566 transitions. [2025-04-29 11:09:30,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 682 transitions, 4516 flow [2025-04-29 11:09:30,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 682 transitions, 4470 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-04-29 11:09:30,072 INFO L231 Difference]: Finished difference. Result has 409 places, 672 transitions, 4276 flow [2025-04-29 11:09:30,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=2796, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4276, PETRI_PLACES=409, PETRI_TRANSITIONS=672} [2025-04-29 11:09:30,073 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, 111 predicate places. [2025-04-29 11:09:30,073 INFO L485 AbstractCegarLoop]: Abstraction has has 409 places, 672 transitions, 4276 flow [2025-04-29 11:09:30,073 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 244.33333333333334) internal successors, (1466), 6 states have internal predecessors, (1466), 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:30,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:30,073 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] [2025-04-29 11:09:30,074 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:09:30,074 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:30,076 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:30,077 INFO L85 PathProgramCache]: Analyzing trace with hash 714998164, now seen corresponding path program 1 times [2025-04-29 11:09:30,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:30,077 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533183636] [2025-04-29 11:09:30,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:30,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:30,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1177 statements into 1 equivalence classes. [2025-04-29 11:09:30,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1177 of 1177 statements. [2025-04-29 11:09:30,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:30,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:33,109 INFO L134 CoverageAnalysis]: Checked inductivity of 7770 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7770 trivial. 0 not checked. [2025-04-29 11:09:33,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:33,110 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533183636] [2025-04-29 11:09:33,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533183636] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:33,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:33,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:33,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476519214] [2025-04-29 11:09:33,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:33,111 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:33,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:33,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:33,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:33,288 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 299 [2025-04-29 11:09:33,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 672 transitions, 4276 flow. Second operand has 6 states, 6 states have (on average 224.66666666666666) internal successors, (1348), 6 states have internal predecessors, (1348), 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:33,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:33,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 299 [2025-04-29 11:09:33,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:35,114 INFO L116 PetriNetUnfolderBase]: 1309/5565 cut-off events. [2025-04-29 11:09:35,115 INFO L117 PetriNetUnfolderBase]: For 4999/5056 co-relation queries the response was YES. [2025-04-29 11:09:35,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13581 conditions, 5565 events. 1309/5565 cut-off events. For 4999/5056 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 33811 event pairs, 369 based on Foata normal form. 11/5331 useless extension candidates. Maximal degree in co-relation 13346. Up to 2549 conditions per place. [2025-04-29 11:09:35,145 INFO L140 encePairwiseOnDemand]: 280/299 looper letters, 316 selfloop transitions, 84 changer transitions 0/751 dead transitions. [2025-04-29 11:09:35,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 751 transitions, 5474 flow [2025-04-29 11:09:35,146 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:35,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:35,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1444 transitions. [2025-04-29 11:09:35,147 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8049052396878483 [2025-04-29 11:09:35,147 INFO L175 Difference]: Start difference. First operand has 409 places, 672 transitions, 4276 flow. Second operand 6 states and 1444 transitions. [2025-04-29 11:09:35,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 751 transitions, 5474 flow [2025-04-29 11:09:35,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 751 transitions, 5220 flow, removed 127 selfloop flow, removed 0 redundant places. [2025-04-29 11:09:35,171 INFO L231 Difference]: Finished difference. Result has 418 places, 743 transitions, 4812 flow [2025-04-29 11:09:35,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=4028, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=624, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4812, PETRI_PLACES=418, PETRI_TRANSITIONS=743} [2025-04-29 11:09:35,172 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, 120 predicate places. [2025-04-29 11:09:35,172 INFO L485 AbstractCegarLoop]: Abstraction has has 418 places, 743 transitions, 4812 flow [2025-04-29 11:09:35,173 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.66666666666666) internal successors, (1348), 6 states have internal predecessors, (1348), 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,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:35,173 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, 1, 1] [2025-04-29 11:09:35,173 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-29 11:09:35,173 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:35,176 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:35,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1735116154, now seen corresponding path program 1 times [2025-04-29 11:09:35,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:35,177 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097809182] [2025-04-29 11:09:35,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:35,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:35,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1183 statements into 1 equivalence classes. [2025-04-29 11:09:37,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1183 of 1183 statements. [2025-04-29 11:09:37,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:37,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:53,076 INFO L134 CoverageAnalysis]: Checked inductivity of 7770 backedges. 599 proven. 5212 refuted. 0 times theorem prover too weak. 1959 trivial. 0 not checked. [2025-04-29 11:09:53,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:53,077 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097809182] [2025-04-29 11:09:53,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097809182] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:53,077 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210850764] [2025-04-29 11:09:53,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:53,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:53,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:53,079 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:09:53,079 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:09:53,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1183 statements into 1 equivalence classes. [2025-04-29 11:09:54,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1183 of 1183 statements. [2025-04-29 11:09:54,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:54,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:54,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 4530 conjuncts, 121 conjuncts are in the unsatisfiable core [2025-04-29 11:09:54,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:54,730 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 11:09:54,730 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-29 11:09:55,152 INFO L325 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-04-29 11:09:55,152 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-04-29 11:09:55,793 INFO L325 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-04-29 11:09:55,793 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-04-29 11:09:56,172 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:09:56,357 INFO L325 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-04-29 11:09:56,358 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-04-29 11:09:56,484 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2025-04-29 11:09:56,665 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2025-04-29 11:09:57,067 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2025-04-29 11:09:57,662 INFO L325 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-04-29 11:09:57,662 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-04-29 11:09:57,893 INFO L325 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-04-29 11:09:57,893 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-04-29 11:09:58,329 INFO L325 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-04-29 11:09:58,329 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-04-29 11:09:58,602 INFO L325 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-04-29 11:09:58,602 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-04-29 11:09:59,052 INFO L325 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-04-29 11:09:59,052 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-04-29 11:09:59,310 INFO L325 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2025-04-29 11:09:59,310 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2025-04-29 11:09:59,730 INFO L325 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-04-29 11:09:59,730 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-04-29 11:09:59,971 INFO L325 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-04-29 11:09:59,971 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-04-29 11:10:00,380 INFO L325 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-04-29 11:10:00,381 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-04-29 11:10:00,585 INFO L325 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2025-04-29 11:10:00,585 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2025-04-29 11:10:01,038 INFO L325 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-04-29 11:10:01,038 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-04-29 11:10:01,537 INFO L325 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-04-29 11:10:01,537 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2025-04-29 11:10:02,308 INFO L325 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-04-29 11:10:02,308 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2025-04-29 11:10:02,735 INFO L325 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-04-29 11:10:02,735 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2025-04-29 11:10:03,426 INFO L325 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-04-29 11:10:03,427 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2025-04-29 11:10:03,840 INFO L325 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-04-29 11:10:03,840 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 40 [2025-04-29 11:10:04,779 INFO L325 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2025-04-29 11:10:04,780 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2025-04-29 11:10:04,860 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:10:04,897 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2025-04-29 11:10:04,958 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:10:04,958 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2025-04-29 11:10:05,009 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:10:05,009 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52 [2025-04-29 11:10:05,063 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:10:05,063 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 55 [2025-04-29 11:10:05,118 INFO L134 CoverageAnalysis]: Checked inductivity of 7770 backedges. 3211 proven. 779 refuted. 0 times theorem prover too weak. 3780 trivial. 0 not checked. [2025-04-29 11:10:05,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... Killed by 15