./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_02-list_nr.i --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_02-list_nr.i -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 68b918b5051efa1a4363a7cd528e42e31cd4f687fef5116849d37b2131e9c46c --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:26:50,507 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:26:50,558 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-30 10:26:50,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:26:50,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:26:50,577 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:26:50,578 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:26:50,578 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:26:50,578 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:26:50,578 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:26:50,578 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:26:50,579 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:26:50,579 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:26:50,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:26:50,579 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:26:50,579 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:26:50,579 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:26:50,579 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:26:50,579 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:26:50,579 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:26:50,579 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:26:50,579 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:26:50,580 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:26:50,580 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:26:50,580 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:26:50,580 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:26:50,580 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:26:50,580 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:26:50,580 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:26:50,580 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:26:50,580 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:26:50,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:50,580 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:26:50,580 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:26:50,581 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:26:50,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:50,581 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:26:50,581 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:26:50,581 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:26:50,581 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:26:50,581 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:26:50,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:26:50,581 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:26:50,581 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:26:50,581 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:26:50,581 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 -> 68b918b5051efa1a4363a7cd528e42e31cd4f687fef5116849d37b2131e9c46c [2025-04-30 10:26:50,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:26:50,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:26:50,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:26:50,803 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:26:50,804 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:26:50,805 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_02-list_nr.i [2025-04-30 10:26:52,095 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dbb7d03b/207e3c7d923b4c14943957c9818502a5/FLAG37736ac3a [2025-04-30 10:26:52,386 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:26:52,387 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_02-list_nr.i [2025-04-30 10:26:52,405 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dbb7d03b/207e3c7d923b4c14943957c9818502a5/FLAG37736ac3a [2025-04-30 10:26:53,296 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dbb7d03b/207e3c7d923b4c14943957c9818502a5 [2025-04-30 10:26:53,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:26:53,299 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:26:53,300 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:26:53,300 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:26:53,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:26:53,306 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:26:53" (1/1) ... [2025-04-30 10:26:53,307 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62cb5eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:53, skipping insertion in model container [2025-04-30 10:26:53,307 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:26:53" (1/1) ... [2025-04-30 10:26:53,340 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:26:53,770 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:26:53,782 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:26:53,837 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:26:53,893 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:26:53,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:53 WrapperNode [2025-04-30 10:26:53,894 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:26:53,895 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:26:53,895 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:26:53,895 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:26:53,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:53" (1/1) ... [2025-04-30 10:26:53,920 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:53" (1/1) ... [2025-04-30 10:26:53,945 INFO L138 Inliner]: procedures = 368, calls = 27, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 221 [2025-04-30 10:26:53,946 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:26:53,946 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:26:53,946 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:26:53,946 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:26:53,951 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:53" (1/1) ... [2025-04-30 10:26:53,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:53" (1/1) ... [2025-04-30 10:26:53,955 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:53" (1/1) ... [2025-04-30 10:26:53,955 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:53" (1/1) ... [2025-04-30 10:26:53,969 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:53" (1/1) ... [2025-04-30 10:26:53,970 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:53" (1/1) ... [2025-04-30 10:26:53,972 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:53" (1/1) ... [2025-04-30 10:26:53,973 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:53" (1/1) ... [2025-04-30 10:26:53,976 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:53" (1/1) ... [2025-04-30 10:26:53,983 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:26:53,984 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:26:53,984 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:26:53,984 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:26:53,988 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:53" (1/1) ... [2025-04-30 10:26:53,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:54,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:54,012 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-30 10:26:54,016 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-30 10:26:54,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-04-30 10:26:54,029 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:26:54,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-30 10:26:54,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-30 10:26:54,029 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:26:54,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:26:54,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:26:54,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-04-30 10:26:54,029 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-30 10:26:54,029 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-30 10:26:54,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-30 10:26:54,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:26:54,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:26:54,030 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:26:54,150 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:26:54,151 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:26:54,455 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:26:54,455 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:26:54,476 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:26:54,476 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:26:54,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:26:54 BoogieIcfgContainer [2025-04-30 10:26:54,477 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:26:54,478 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:26:54,478 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:26:54,481 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:26:54,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:26:53" (1/3) ... [2025-04-30 10:26:54,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a123d72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:26:54, skipping insertion in model container [2025-04-30 10:26:54,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:53" (2/3) ... [2025-04-30 10:26:54,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a123d72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:26:54, skipping insertion in model container [2025-04-30 10:26:54,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:26:54" (3/3) ... [2025-04-30 10:26:54,483 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_02-list_nr.i [2025-04-30 10:26:54,495 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:26:54,497 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_02-list_nr.i that has 2 procedures, 250 locations, 248 edges, 1 initial locations, 0 loop locations, and 18 error locations. [2025-04-30 10:26:54,498 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:26:54,585 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:26:54,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 253 places, 249 transitions, 502 flow [2025-04-30 10:26:54,686 INFO L116 PetriNetUnfolderBase]: 0/248 cut-off events. [2025-04-30 10:26:54,687 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:26:54,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 248 events. 0/248 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 85 event pairs, 0 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-30 10:26:54,691 INFO L82 GeneralOperation]: Start removeDead. Operand has 253 places, 249 transitions, 502 flow [2025-04-30 10:26:54,695 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 252 places, 248 transitions, 499 flow [2025-04-30 10:26:54,701 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:26:54,709 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;@2ba2e50a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:26:54,709 INFO L341 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-04-30 10:26:54,719 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:26:54,720 INFO L116 PetriNetUnfolderBase]: 0/83 cut-off events. [2025-04-30 10:26:54,720 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:26:54,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:54,720 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:54,721 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-30 10:26:54,724 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:54,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1044138680, now seen corresponding path program 1 times [2025-04-30 10:26:54,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:54,730 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733585696] [2025-04-30 10:26:54,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:54,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:54,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-04-30 10:26:54,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-04-30 10:26:54,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:54,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:55,531 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-30 10:26:55,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:55,533 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733585696] [2025-04-30 10:26:55,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733585696] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:55,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:55,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:55,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424868937] [2025-04-30 10:26:55,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:55,540 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:55,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:55,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:55,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:55,886 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 249 [2025-04-30 10:26:55,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 248 transitions, 499 flow. Second operand has 6 states, 6 states have (on average 191.33333333333334) internal successors, (1148), 6 states have internal predecessors, (1148), 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-30 10:26:55,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:55,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 249 [2025-04-30 10:26:55,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:56,150 INFO L116 PetriNetUnfolderBase]: 220/1072 cut-off events. [2025-04-30 10:26:56,151 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:26:56,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1574 conditions, 1072 events. 220/1072 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5354 event pairs, 220 based on Foata normal form. 0/967 useless extension candidates. Maximal degree in co-relation 1398. Up to 488 conditions per place. [2025-04-30 10:26:56,175 INFO L140 encePairwiseOnDemand]: 237/249 looper letters, 47 selfloop transitions, 10 changer transitions 0/246 dead transitions. [2025-04-30 10:26:56,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 246 transitions, 609 flow [2025-04-30 10:26:56,177 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:56,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:56,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1199 transitions. [2025-04-30 10:26:56,195 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8025435073627845 [2025-04-30 10:26:56,198 INFO L175 Difference]: Start difference. First operand has 252 places, 248 transitions, 499 flow. Second operand 6 states and 1199 transitions. [2025-04-30 10:26:56,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 246 transitions, 609 flow [2025-04-30 10:26:56,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 246 transitions, 608 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:56,207 INFO L231 Difference]: Finished difference. Result has 254 places, 246 transitions, 514 flow [2025-04-30 10:26:56,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=514, PETRI_PLACES=254, PETRI_TRANSITIONS=246} [2025-04-30 10:26:56,214 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, 2 predicate places. [2025-04-30 10:26:56,215 INFO L485 AbstractCegarLoop]: Abstraction has has 254 places, 246 transitions, 514 flow [2025-04-30 10:26:56,216 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 191.33333333333334) internal successors, (1148), 6 states have internal predecessors, (1148), 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-30 10:26:56,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:56,216 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:56,217 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:26:56,217 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-30 10:26:56,218 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:56,218 INFO L85 PathProgramCache]: Analyzing trace with hash -956173680, now seen corresponding path program 1 times [2025-04-30 10:26:56,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:56,219 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150221349] [2025-04-30 10:26:56,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:56,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:56,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-04-30 10:26:56,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-04-30 10:26:56,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:56,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:56,634 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-30 10:26:56,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:56,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150221349] [2025-04-30 10:26:56,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150221349] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:56,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:56,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:56,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90072160] [2025-04-30 10:26:56,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:56,636 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:56,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:56,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:56,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:56,896 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 249 [2025-04-30 10:26:56,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 246 transitions, 514 flow. Second operand has 6 states, 6 states have (on average 191.33333333333334) internal successors, (1148), 6 states have internal predecessors, (1148), 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-30 10:26:56,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:56,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 249 [2025-04-30 10:26:56,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:57,062 INFO L116 PetriNetUnfolderBase]: 220/1070 cut-off events. [2025-04-30 10:26:57,063 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:26:57,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1582 conditions, 1070 events. 220/1070 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5357 event pairs, 220 based on Foata normal form. 0/967 useless extension candidates. Maximal degree in co-relation 1439. Up to 488 conditions per place. [2025-04-30 10:26:57,070 INFO L140 encePairwiseOnDemand]: 237/249 looper letters, 47 selfloop transitions, 10 changer transitions 0/244 dead transitions. [2025-04-30 10:26:57,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 244 transitions, 624 flow [2025-04-30 10:26:57,072 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:57,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:57,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1199 transitions. [2025-04-30 10:26:57,075 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8025435073627845 [2025-04-30 10:26:57,075 INFO L175 Difference]: Start difference. First operand has 254 places, 246 transitions, 514 flow. Second operand 6 states and 1199 transitions. [2025-04-30 10:26:57,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 244 transitions, 624 flow [2025-04-30 10:26:57,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 244 transitions, 604 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:26:57,081 INFO L231 Difference]: Finished difference. Result has 252 places, 244 transitions, 510 flow [2025-04-30 10:26:57,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=510, PETRI_PLACES=252, PETRI_TRANSITIONS=244} [2025-04-30 10:26:57,083 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, 0 predicate places. [2025-04-30 10:26:57,083 INFO L485 AbstractCegarLoop]: Abstraction has has 252 places, 244 transitions, 510 flow [2025-04-30 10:26:57,084 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 191.33333333333334) internal successors, (1148), 6 states have internal predecessors, (1148), 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-30 10:26:57,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:57,084 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:57,084 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:26:57,084 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-30 10:26:57,086 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:57,086 INFO L85 PathProgramCache]: Analyzing trace with hash -130714399, now seen corresponding path program 1 times [2025-04-30 10:26:57,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:57,086 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061733569] [2025-04-30 10:26:57,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:57,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:57,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-04-30 10:26:57,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-04-30 10:26:57,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:57,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:57,142 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-30 10:26:57,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:57,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061733569] [2025-04-30 10:26:57,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061733569] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:57,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:57,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:26:57,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173722375] [2025-04-30 10:26:57,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:57,144 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:26:57,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:57,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:26:57,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:26:57,171 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 249 [2025-04-30 10:26:57,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 244 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 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-30 10:26:57,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:57,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 249 [2025-04-30 10:26:57,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:57,217 INFO L116 PetriNetUnfolderBase]: 16/379 cut-off events. [2025-04-30 10:26:57,217 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:26:57,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 379 events. 16/379 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 756 event pairs, 16 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 298. Up to 47 conditions per place. [2025-04-30 10:26:57,219 INFO L140 encePairwiseOnDemand]: 246/249 looper letters, 14 selfloop transitions, 2 changer transitions 0/243 dead transitions. [2025-04-30 10:26:57,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 243 transitions, 540 flow [2025-04-30 10:26:57,219 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:26:57,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:26:57,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2025-04-30 10:26:57,222 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9544846050870147 [2025-04-30 10:26:57,223 INFO L175 Difference]: Start difference. First operand has 252 places, 244 transitions, 510 flow. Second operand 3 states and 713 transitions. [2025-04-30 10:26:57,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 243 transitions, 540 flow [2025-04-30 10:26:57,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 243 transitions, 520 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:26:57,228 INFO L231 Difference]: Finished difference. Result has 248 places, 243 transitions, 492 flow [2025-04-30 10:26:57,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=248, PETRI_TRANSITIONS=243} [2025-04-30 10:26:57,230 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, -4 predicate places. [2025-04-30 10:26:57,230 INFO L485 AbstractCegarLoop]: Abstraction has has 248 places, 243 transitions, 492 flow [2025-04-30 10:26:57,230 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 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-30 10:26:57,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:57,230 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:57,231 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:26:57,231 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-30 10:26:57,232 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:57,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1165486800, now seen corresponding path program 1 times [2025-04-30 10:26:57,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:57,232 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703300662] [2025-04-30 10:26:57,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:57,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:57,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-04-30 10:26:57,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-04-30 10:26:57,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:57,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:57,285 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-30 10:26:57,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:57,286 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703300662] [2025-04-30 10:26:57,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703300662] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:57,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:57,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:26:57,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537674162] [2025-04-30 10:26:57,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:57,286 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:26:57,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:57,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:26:57,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:26:57,302 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 249 [2025-04-30 10:26:57,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 243 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 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-30 10:26:57,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:57,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 249 [2025-04-30 10:26:57,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:57,347 INFO L116 PetriNetUnfolderBase]: 24/456 cut-off events. [2025-04-30 10:26:57,348 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:26:57,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 527 conditions, 456 events. 24/456 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1210 event pairs, 24 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 419. Up to 63 conditions per place. [2025-04-30 10:26:57,350 INFO L140 encePairwiseOnDemand]: 243/249 looper letters, 15 selfloop transitions, 1 changer transitions 0/238 dead transitions. [2025-04-30 10:26:57,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 238 transitions, 514 flow [2025-04-30 10:26:57,351 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:26:57,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:26:57,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2025-04-30 10:26:57,353 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9437751004016064 [2025-04-30 10:26:57,353 INFO L175 Difference]: Start difference. First operand has 248 places, 243 transitions, 492 flow. Second operand 3 states and 705 transitions. [2025-04-30 10:26:57,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 238 transitions, 514 flow [2025-04-30 10:26:57,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 238 transitions, 510 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:26:57,356 INFO L231 Difference]: Finished difference. Result has 243 places, 238 transitions, 480 flow [2025-04-30 10:26:57,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=243, PETRI_TRANSITIONS=238} [2025-04-30 10:26:57,358 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, -9 predicate places. [2025-04-30 10:26:57,358 INFO L485 AbstractCegarLoop]: Abstraction has has 243 places, 238 transitions, 480 flow [2025-04-30 10:26:57,359 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 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-30 10:26:57,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:57,359 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:57,359 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:26:57,359 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-30 10:26:57,360 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:57,360 INFO L85 PathProgramCache]: Analyzing trace with hash -264416534, now seen corresponding path program 1 times [2025-04-30 10:26:57,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:57,360 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994846193] [2025-04-30 10:26:57,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:57,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:57,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-04-30 10:26:57,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-04-30 10:26:57,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:57,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:57,780 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-30 10:26:57,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:57,780 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994846193] [2025-04-30 10:26:57,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994846193] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:57,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:57,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:57,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152729690] [2025-04-30 10:26:57,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:57,780 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:57,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:57,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:57,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:57,985 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 249 [2025-04-30 10:26:57,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 238 transitions, 480 flow. Second operand has 6 states, 6 states have (on average 189.16666666666666) internal successors, (1135), 6 states have internal predecessors, (1135), 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-30 10:26:57,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:57,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 249 [2025-04-30 10:26:57,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:58,156 INFO L116 PetriNetUnfolderBase]: 288/1209 cut-off events. [2025-04-30 10:26:58,156 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:26:58,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1854 conditions, 1209 events. 288/1209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6307 event pairs, 288 based on Foata normal form. 0/1150 useless extension candidates. Maximal degree in co-relation 1736. Up to 635 conditions per place. [2025-04-30 10:26:58,160 INFO L140 encePairwiseOnDemand]: 243/249 looper letters, 58 selfloop transitions, 5 changer transitions 0/237 dead transitions. [2025-04-30 10:26:58,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 237 transitions, 604 flow [2025-04-30 10:26:58,160 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:58,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:58,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1174 transitions. [2025-04-30 10:26:58,162 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.785809906291834 [2025-04-30 10:26:58,162 INFO L175 Difference]: Start difference. First operand has 243 places, 238 transitions, 480 flow. Second operand 6 states and 1174 transitions. [2025-04-30 10:26:58,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 237 transitions, 604 flow [2025-04-30 10:26:58,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 237 transitions, 603 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:58,165 INFO L231 Difference]: Finished difference. Result has 246 places, 237 transitions, 487 flow [2025-04-30 10:26:58,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=487, PETRI_PLACES=246, PETRI_TRANSITIONS=237} [2025-04-30 10:26:58,166 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, -6 predicate places. [2025-04-30 10:26:58,166 INFO L485 AbstractCegarLoop]: Abstraction has has 246 places, 237 transitions, 487 flow [2025-04-30 10:26:58,166 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 189.16666666666666) internal successors, (1135), 6 states have internal predecessors, (1135), 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-30 10:26:58,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:58,167 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:58,167 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:26:58,167 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-30 10:26:58,167 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:58,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1517100340, now seen corresponding path program 1 times [2025-04-30 10:26:58,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:58,168 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196499259] [2025-04-30 10:26:58,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:58,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:58,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-04-30 10:26:58,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-04-30 10:26:58,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:58,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:58,569 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-30 10:26:58,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:58,571 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196499259] [2025-04-30 10:26:58,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196499259] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:58,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:58,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:58,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537362690] [2025-04-30 10:26:58,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:58,571 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:58,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:58,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:58,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:58,790 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 249 [2025-04-30 10:26:58,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 237 transitions, 487 flow. Second operand has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 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-30 10:26:58,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:58,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 249 [2025-04-30 10:26:58,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:59,059 INFO L116 PetriNetUnfolderBase]: 316/1535 cut-off events. [2025-04-30 10:26:59,060 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:26:59,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2271 conditions, 1535 events. 316/1535 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 9256 event pairs, 36 based on Foata normal form. 0/1445 useless extension candidates. Maximal degree in co-relation 2154. Up to 380 conditions per place. [2025-04-30 10:26:59,065 INFO L140 encePairwiseOnDemand]: 221/249 looper letters, 99 selfloop transitions, 70 changer transitions 0/349 dead transitions. [2025-04-30 10:26:59,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 349 transitions, 1049 flow [2025-04-30 10:26:59,066 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:59,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:59,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1323 transitions. [2025-04-30 10:26:59,068 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8855421686746988 [2025-04-30 10:26:59,068 INFO L175 Difference]: Start difference. First operand has 246 places, 237 transitions, 487 flow. Second operand 6 states and 1323 transitions. [2025-04-30 10:26:59,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 349 transitions, 1049 flow [2025-04-30 10:26:59,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 349 transitions, 1039 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:26:59,074 INFO L231 Difference]: Finished difference. Result has 250 places, 307 transitions, 955 flow [2025-04-30 10:26:59,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=955, PETRI_PLACES=250, PETRI_TRANSITIONS=307} [2025-04-30 10:26:59,075 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, -2 predicate places. [2025-04-30 10:26:59,075 INFO L485 AbstractCegarLoop]: Abstraction has has 250 places, 307 transitions, 955 flow [2025-04-30 10:26:59,075 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 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-30 10:26:59,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:59,076 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:59,076 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:26:59,076 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-30 10:26:59,076 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:59,076 INFO L85 PathProgramCache]: Analyzing trace with hash -656122962, now seen corresponding path program 1 times [2025-04-30 10:26:59,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:59,077 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017354910] [2025-04-30 10:26:59,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:59,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:59,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-04-30 10:26:59,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-04-30 10:26:59,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:59,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:59,410 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-30 10:26:59,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:59,411 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017354910] [2025-04-30 10:26:59,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017354910] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:59,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:59,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:59,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082166288] [2025-04-30 10:26:59,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:59,411 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:59,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:59,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:59,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:59,654 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 249 [2025-04-30 10:26:59,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 307 transitions, 955 flow. Second operand has 6 states, 6 states have (on average 197.83333333333334) internal successors, (1187), 6 states have internal predecessors, (1187), 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-30 10:26:59,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:59,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 249 [2025-04-30 10:26:59,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:59,916 INFO L116 PetriNetUnfolderBase]: 588/2306 cut-off events. [2025-04-30 10:26:59,917 INFO L117 PetriNetUnfolderBase]: For 603/609 co-relation queries the response was YES. [2025-04-30 10:26:59,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4695 conditions, 2306 events. 588/2306 cut-off events. For 603/609 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 15138 event pairs, 222 based on Foata normal form. 0/2194 useless extension candidates. Maximal degree in co-relation 4576. Up to 1082 conditions per place. [2025-04-30 10:26:59,963 INFO L140 encePairwiseOnDemand]: 234/249 looper letters, 106 selfloop transitions, 48 changer transitions 0/358 dead transitions. [2025-04-30 10:26:59,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 358 transitions, 1435 flow [2025-04-30 10:26:59,964 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:59,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:59,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1260 transitions. [2025-04-30 10:26:59,966 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8433734939759037 [2025-04-30 10:26:59,966 INFO L175 Difference]: Start difference. First operand has 250 places, 307 transitions, 955 flow. Second operand 6 states and 1260 transitions. [2025-04-30 10:26:59,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 358 transitions, 1435 flow [2025-04-30 10:26:59,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 358 transitions, 1435 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:26:59,973 INFO L231 Difference]: Finished difference. Result has 260 places, 350 transitions, 1343 flow [2025-04-30 10:26:59,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=955, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1343, PETRI_PLACES=260, PETRI_TRANSITIONS=350} [2025-04-30 10:26:59,974 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, 8 predicate places. [2025-04-30 10:26:59,974 INFO L485 AbstractCegarLoop]: Abstraction has has 260 places, 350 transitions, 1343 flow [2025-04-30 10:26:59,975 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 197.83333333333334) internal successors, (1187), 6 states have internal predecessors, (1187), 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-30 10:26:59,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:59,975 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:59,975 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:26:59,975 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-30 10:26:59,976 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:59,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1849978901, now seen corresponding path program 1 times [2025-04-30 10:26:59,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:59,976 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587727285] [2025-04-30 10:26:59,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:59,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:59,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-04-30 10:27:00,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-04-30 10:27:00,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:00,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:00,277 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-30 10:27:00,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:00,277 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587727285] [2025-04-30 10:27:00,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587727285] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:00,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:00,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:00,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104117421] [2025-04-30 10:27:00,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:00,278 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:00,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:00,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:00,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:00,504 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 249 [2025-04-30 10:27:00,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 350 transitions, 1343 flow. Second operand has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 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-30 10:27:00,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:00,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 249 [2025-04-30 10:27:00,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:00,872 INFO L116 PetriNetUnfolderBase]: 734/2872 cut-off events. [2025-04-30 10:27:00,872 INFO L117 PetriNetUnfolderBase]: For 1628/1690 co-relation queries the response was YES. [2025-04-30 10:27:00,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6645 conditions, 2872 events. 734/2872 cut-off events. For 1628/1690 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 20390 event pairs, 86 based on Foata normal form. 0/2777 useless extension candidates. Maximal degree in co-relation 6519. Up to 1024 conditions per place. [2025-04-30 10:27:00,884 INFO L140 encePairwiseOnDemand]: 226/249 looper letters, 128 selfloop transitions, 136 changer transitions 4/490 dead transitions. [2025-04-30 10:27:00,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 490 transitions, 2635 flow [2025-04-30 10:27:00,884 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:00,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:00,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1318 transitions. [2025-04-30 10:27:00,887 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8821954484605087 [2025-04-30 10:27:00,887 INFO L175 Difference]: Start difference. First operand has 260 places, 350 transitions, 1343 flow. Second operand 6 states and 1318 transitions. [2025-04-30 10:27:00,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 490 transitions, 2635 flow [2025-04-30 10:27:00,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 490 transitions, 2617 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-04-30 10:27:00,898 INFO L231 Difference]: Finished difference. Result has 270 places, 481 transitions, 2691 flow [2025-04-30 10:27:00,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=1325, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2691, PETRI_PLACES=270, PETRI_TRANSITIONS=481} [2025-04-30 10:27:00,899 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, 18 predicate places. [2025-04-30 10:27:00,899 INFO L485 AbstractCegarLoop]: Abstraction has has 270 places, 481 transitions, 2691 flow [2025-04-30 10:27:00,900 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 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-30 10:27:00,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:00,900 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:00,900 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:27:00,900 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-30 10:27:00,900 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:00,901 INFO L85 PathProgramCache]: Analyzing trace with hash 642851118, now seen corresponding path program 1 times [2025-04-30 10:27:00,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:00,901 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688827570] [2025-04-30 10:27:00,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:00,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:00,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-04-30 10:27:00,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-04-30 10:27:00,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:00,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:01,563 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-30 10:27:01,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:01,564 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688827570] [2025-04-30 10:27:01,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688827570] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:01,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:01,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-30 10:27:01,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768593886] [2025-04-30 10:27:01,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:01,565 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-30 10:27:01,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:01,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-30 10:27:01,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:27:02,478 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 249 [2025-04-30 10:27:02,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 481 transitions, 2691 flow. Second operand has 13 states, 13 states have (on average 183.07692307692307) internal successors, (2380), 13 states have internal predecessors, (2380), 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-30 10:27:02,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:02,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 249 [2025-04-30 10:27:02,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:03,656 INFO L116 PetriNetUnfolderBase]: 1151/4174 cut-off events. [2025-04-30 10:27:03,656 INFO L117 PetriNetUnfolderBase]: For 5340/5444 co-relation queries the response was YES. [2025-04-30 10:27:03,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11940 conditions, 4174 events. 1151/4174 cut-off events. For 5340/5444 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 33071 event pairs, 78 based on Foata normal form. 35/4115 useless extension candidates. Maximal degree in co-relation 11806. Up to 880 conditions per place. [2025-04-30 10:27:03,687 INFO L140 encePairwiseOnDemand]: 212/249 looper letters, 349 selfloop transitions, 159 changer transitions 4/705 dead transitions. [2025-04-30 10:27:03,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 705 transitions, 5131 flow [2025-04-30 10:27:03,687 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-30 10:27:03,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-30 10:27:03,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2777 transitions. [2025-04-30 10:27:03,692 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7966150315547906 [2025-04-30 10:27:03,692 INFO L175 Difference]: Start difference. First operand has 270 places, 481 transitions, 2691 flow. Second operand 14 states and 2777 transitions. [2025-04-30 10:27:03,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 705 transitions, 5131 flow [2025-04-30 10:27:03,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 705 transitions, 5059 flow, removed 36 selfloop flow, removed 0 redundant places. [2025-04-30 10:27:03,720 INFO L231 Difference]: Finished difference. Result has 293 places, 544 transitions, 3964 flow [2025-04-30 10:27:03,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=2655, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3964, PETRI_PLACES=293, PETRI_TRANSITIONS=544} [2025-04-30 10:27:03,721 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, 41 predicate places. [2025-04-30 10:27:03,721 INFO L485 AbstractCegarLoop]: Abstraction has has 293 places, 544 transitions, 3964 flow [2025-04-30 10:27:03,722 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 183.07692307692307) internal successors, (2380), 13 states have internal predecessors, (2380), 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-30 10:27:03,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:03,722 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:03,722 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:27:03,723 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-30 10:27:03,723 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:03,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1413734866, now seen corresponding path program 2 times [2025-04-30 10:27:03,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:03,723 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690834159] [2025-04-30 10:27:03,724 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:27:03,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:03,744 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 164 statements into 1 equivalence classes. [2025-04-30 10:27:03,752 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-04-30 10:27:03,753 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:27:03,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:04,178 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-30 10:27:04,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:04,179 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690834159] [2025-04-30 10:27:04,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690834159] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:04,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:04,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-30 10:27:04,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859090928] [2025-04-30 10:27:04,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:04,179 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-30 10:27:04,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:04,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-30 10:27:04,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:27:05,151 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 249 [2025-04-30 10:27:05,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 544 transitions, 3964 flow. Second operand has 13 states, 13 states have (on average 183.07692307692307) internal successors, (2380), 13 states have internal predecessors, (2380), 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-30 10:27:05,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:05,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 249 [2025-04-30 10:27:05,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:06,217 INFO L116 PetriNetUnfolderBase]: 1255/4622 cut-off events. [2025-04-30 10:27:06,217 INFO L117 PetriNetUnfolderBase]: For 9614/9717 co-relation queries the response was YES. [2025-04-30 10:27:06,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14573 conditions, 4622 events. 1255/4622 cut-off events. For 9614/9717 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 37211 event pairs, 125 based on Foata normal form. 37/4543 useless extension candidates. Maximal degree in co-relation 14425. Up to 891 conditions per place. [2025-04-30 10:27:06,244 INFO L140 encePairwiseOnDemand]: 228/249 looper letters, 440 selfloop transitions, 103 changer transitions 0/736 dead transitions. [2025-04-30 10:27:06,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 736 transitions, 6508 flow [2025-04-30 10:27:06,244 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-30 10:27:06,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-30 10:27:06,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3604 transitions. [2025-04-30 10:27:06,250 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7617839780173324 [2025-04-30 10:27:06,250 INFO L175 Difference]: Start difference. First operand has 293 places, 544 transitions, 3964 flow. Second operand 19 states and 3604 transitions. [2025-04-30 10:27:06,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 736 transitions, 6508 flow [2025-04-30 10:27:06,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 736 transitions, 6503 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-30 10:27:06,283 INFO L231 Difference]: Finished difference. Result has 317 places, 599 transitions, 4779 flow [2025-04-30 10:27:06,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=3959, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4779, PETRI_PLACES=317, PETRI_TRANSITIONS=599} [2025-04-30 10:27:06,284 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, 65 predicate places. [2025-04-30 10:27:06,284 INFO L485 AbstractCegarLoop]: Abstraction has has 317 places, 599 transitions, 4779 flow [2025-04-30 10:27:06,284 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 183.07692307692307) internal successors, (2380), 13 states have internal predecessors, (2380), 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-30 10:27:06,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:06,285 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:06,285 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:27:06,285 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-30 10:27:06,285 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:06,286 INFO L85 PathProgramCache]: Analyzing trace with hash 877449532, now seen corresponding path program 3 times [2025-04-30 10:27:06,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:06,286 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850745901] [2025-04-30 10:27:06,286 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:27:06,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:06,302 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 164 statements into 1 equivalence classes. [2025-04-30 10:27:06,309 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-04-30 10:27:06,309 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-30 10:27:06,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:06,815 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-30 10:27:06,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:06,815 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850745901] [2025-04-30 10:27:06,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850745901] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:06,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:06,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-30 10:27:06,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761091107] [2025-04-30 10:27:06,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:06,816 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-30 10:27:06,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:06,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-30 10:27:06,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:27:07,544 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 249 [2025-04-30 10:27:07,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 599 transitions, 4779 flow. Second operand has 13 states, 13 states have (on average 183.07692307692307) internal successors, (2380), 13 states have internal predecessors, (2380), 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-30 10:27:07,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:07,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 249 [2025-04-30 10:27:07,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:09,007 INFO L116 PetriNetUnfolderBase]: 1783/6481 cut-off events. [2025-04-30 10:27:09,007 INFO L117 PetriNetUnfolderBase]: For 17830/18017 co-relation queries the response was YES. [2025-04-30 10:27:09,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21782 conditions, 6481 events. 1783/6481 cut-off events. For 17830/18017 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 58287 event pairs, 143 based on Foata normal form. 55/6368 useless extension candidates. Maximal degree in co-relation 21624. Up to 1299 conditions per place. [2025-04-30 10:27:09,040 INFO L140 encePairwiseOnDemand]: 216/249 looper letters, 450 selfloop transitions, 226 changer transitions 3/872 dead transitions. [2025-04-30 10:27:09,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 872 transitions, 8587 flow [2025-04-30 10:27:09,041 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-30 10:27:09,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-30 10:27:09,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3860 transitions. [2025-04-30 10:27:09,046 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7751004016064257 [2025-04-30 10:27:09,046 INFO L175 Difference]: Start difference. First operand has 317 places, 599 transitions, 4779 flow. Second operand 20 states and 3860 transitions. [2025-04-30 10:27:09,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 872 transitions, 8587 flow [2025-04-30 10:27:09,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 872 transitions, 8551 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:09,103 INFO L231 Difference]: Finished difference. Result has 342 places, 693 transitions, 6986 flow [2025-04-30 10:27:09,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=4753, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=6986, PETRI_PLACES=342, PETRI_TRANSITIONS=693} [2025-04-30 10:27:09,104 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, 90 predicate places. [2025-04-30 10:27:09,105 INFO L485 AbstractCegarLoop]: Abstraction has has 342 places, 693 transitions, 6986 flow [2025-04-30 10:27:09,105 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 183.07692307692307) internal successors, (2380), 13 states have internal predecessors, (2380), 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-30 10:27:09,105 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:09,105 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:09,106 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:27:09,106 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-30 10:27:09,106 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:09,107 INFO L85 PathProgramCache]: Analyzing trace with hash -878427960, now seen corresponding path program 4 times [2025-04-30 10:27:09,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:09,107 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889021757] [2025-04-30 10:27:09,107 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:27:09,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:09,123 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 164 statements into 2 equivalence classes. [2025-04-30 10:27:09,129 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 148 of 164 statements. [2025-04-30 10:27:09,129 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:27:09,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:09,542 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-30 10:27:09,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:09,542 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889021757] [2025-04-30 10:27:09,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889021757] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:09,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:09,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-30 10:27:09,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520641675] [2025-04-30 10:27:09,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:09,543 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-30 10:27:09,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:09,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-30 10:27:09,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:27:10,406 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 249 [2025-04-30 10:27:10,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 693 transitions, 6986 flow. Second operand has 13 states, 13 states have (on average 183.07692307692307) internal successors, (2380), 13 states have internal predecessors, (2380), 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-30 10:27:10,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:10,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 249 [2025-04-30 10:27:10,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:12,211 INFO L116 PetriNetUnfolderBase]: 2508/8884 cut-off events. [2025-04-30 10:27:12,211 INFO L117 PetriNetUnfolderBase]: For 36064/36381 co-relation queries the response was YES. [2025-04-30 10:27:12,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32592 conditions, 8884 events. 2508/8884 cut-off events. For 36064/36381 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 86873 event pairs, 147 based on Foata normal form. 98/8744 useless extension candidates. Maximal degree in co-relation 32422. Up to 1807 conditions per place. [2025-04-30 10:27:12,281 INFO L140 encePairwiseOnDemand]: 220/249 looper letters, 510 selfloop transitions, 301 changer transitions 0/1004 dead transitions. [2025-04-30 10:27:12,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 1004 transitions, 12268 flow [2025-04-30 10:27:12,282 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-30 10:27:12,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-30 10:27:12,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3629 transitions. [2025-04-30 10:27:12,285 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7670682730923695 [2025-04-30 10:27:12,285 INFO L175 Difference]: Start difference. First operand has 342 places, 693 transitions, 6986 flow. Second operand 19 states and 3629 transitions. [2025-04-30 10:27:12,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 1004 transitions, 12268 flow [2025-04-30 10:27:12,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 1004 transitions, 12226 flow, removed 11 selfloop flow, removed 7 redundant places. [2025-04-30 10:27:12,411 INFO L231 Difference]: Finished difference. Result has 362 places, 806 transitions, 10052 flow [2025-04-30 10:27:12,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=6944, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=693, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=199, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=10052, PETRI_PLACES=362, PETRI_TRANSITIONS=806} [2025-04-30 10:27:12,414 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, 110 predicate places. [2025-04-30 10:27:12,414 INFO L485 AbstractCegarLoop]: Abstraction has has 362 places, 806 transitions, 10052 flow [2025-04-30 10:27:12,415 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 183.07692307692307) internal successors, (2380), 13 states have internal predecessors, (2380), 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-30 10:27:12,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:12,416 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:12,416 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:27:12,416 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-30 10:27:12,417 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:12,417 INFO L85 PathProgramCache]: Analyzing trace with hash 263305802, now seen corresponding path program 5 times [2025-04-30 10:27:12,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:12,417 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417762702] [2025-04-30 10:27:12,417 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:27:12,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:12,441 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 164 statements into 2 equivalence classes. [2025-04-30 10:27:12,447 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 164 of 164 statements. [2025-04-30 10:27:12,447 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:27:12,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:12,818 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-30 10:27:12,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:12,818 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417762702] [2025-04-30 10:27:12,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417762702] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:27:12,818 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944231695] [2025-04-30 10:27:12,818 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:27:12,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:12,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:27:12,821 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-30 10:27:12,823 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-30 10:27:12,932 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 164 statements into 2 equivalence classes. [2025-04-30 10:27:12,980 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 164 of 164 statements. [2025-04-30 10:27:12,980 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:27:12,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:12,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-30 10:27:12,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:27:13,022 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-30 10:27:13,103 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:27:13,103 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 11 [2025-04-30 10:27:13,115 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 13 treesize of output 9 [2025-04-30 10:27:13,123 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-04-30 10:27:13,133 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:13,134 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 32 treesize of output 34 [2025-04-30 10:27:13,177 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:13,178 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 41 treesize of output 46 [2025-04-30 10:27:13,225 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-04-30 10:27:13,233 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-30 10:27:13,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:27:13,324 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1359) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1359) c_~A~0.base) (+ c_~A~0.offset 6)) 0)) (forall ((v_ArrVal_1359 (Array Int Int))) (= 0 (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1359) c_~A~0.base) (+ c_~A~0.offset 4)))) (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1359) c_~A~0.base) .cse1) 0))))) is different from false [2025-04-30 10:27:13,337 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1359) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1359) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1359) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1359) c_~A~0.base) (+ c_~A~0.offset 6)) 0))))) is different from false [2025-04-30 10:27:13,364 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1359) c_~A~0.base) (+ c_~A~0.offset 6)) 0)) (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1359) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1359) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1359) c_~A~0.base) (+ c_~A~0.offset 4)) 0))))) is different from false [2025-04-30 10:27:13,394 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset 6)) (.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (select |c_#race| c_~A~0.base) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1359) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1359) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1359) c_~A~0.base) .cse2) 0)) (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1359) c_~A~0.base) (+ c_~A~0.offset 4)) 0))))) is different from false [2025-04-30 10:27:15,249 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:15,251 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53 [2025-04-30 10:27:15,258 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:15,258 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 36 [2025-04-30 10:27:15,267 INFO L325 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-04-30 10:27:15,267 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-04-30 10:27:15,272 INFO L325 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-04-30 10:27:15,272 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-04-30 10:27:15,279 INFO L325 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-04-30 10:27:15,279 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-04-30 10:27:15,359 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-30 10:27:15,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944231695] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:27:15,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:27:15,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 20 [2025-04-30 10:27:15,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134790579] [2025-04-30 10:27:15,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:27:15,360 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-30 10:27:15,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:15,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-30 10:27:15,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=209, Unknown=26, NotChecked=132, Total=420 [2025-04-30 10:27:15,378 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 249 [2025-04-30 10:27:15,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 806 transitions, 10052 flow. Second operand has 21 states, 21 states have (on average 150.95238095238096) internal successors, (3170), 21 states have internal predecessors, (3170), 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-30 10:27:15,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:15,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 249 [2025-04-30 10:27:15,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:19,677 INFO L116 PetriNetUnfolderBase]: 5458/15199 cut-off events. [2025-04-30 10:27:19,677 INFO L117 PetriNetUnfolderBase]: For 71293/71599 co-relation queries the response was YES. [2025-04-30 10:27:19,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60463 conditions, 15199 events. 5458/15199 cut-off events. For 71293/71599 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 149645 event pairs, 1190 based on Foata normal form. 64/14776 useless extension candidates. Maximal degree in co-relation 60279. Up to 3864 conditions per place. [2025-04-30 10:27:19,788 INFO L140 encePairwiseOnDemand]: 216/249 looper letters, 776 selfloop transitions, 321 changer transitions 6/1244 dead transitions. [2025-04-30 10:27:19,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 1244 transitions, 16316 flow [2025-04-30 10:27:19,789 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-30 10:27:19,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-30 10:27:19,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3649 transitions. [2025-04-30 10:27:19,791 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6661190215407082 [2025-04-30 10:27:19,792 INFO L175 Difference]: Start difference. First operand has 362 places, 806 transitions, 10052 flow. Second operand 22 states and 3649 transitions. [2025-04-30 10:27:19,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 1244 transitions, 16316 flow [2025-04-30 10:27:20,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 1244 transitions, 16210 flow, removed 35 selfloop flow, removed 9 redundant places. [2025-04-30 10:27:20,045 INFO L231 Difference]: Finished difference. Result has 383 places, 886 transitions, 12912 flow [2025-04-30 10:27:20,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=9946, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=806, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=243, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=12912, PETRI_PLACES=383, PETRI_TRANSITIONS=886} [2025-04-30 10:27:20,046 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, 131 predicate places. [2025-04-30 10:27:20,046 INFO L485 AbstractCegarLoop]: Abstraction has has 383 places, 886 transitions, 12912 flow [2025-04-30 10:27:20,047 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 150.95238095238096) internal successors, (3170), 21 states have internal predecessors, (3170), 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-30 10:27:20,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:20,047 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:20,053 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-30 10:27:20,249 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-30 10:27:20,249 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-04-30 10:27:20,250 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:20,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1946146296, now seen corresponding path program 6 times [2025-04-30 10:27:20,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:20,250 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799070084] [2025-04-30 10:27:20,250 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:27:20,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:20,269 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 164 statements into 2 equivalence classes. [2025-04-30 10:27:20,293 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 164 of 164 statements. [2025-04-30 10:27:20,293 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-30 10:27:20,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:20,820 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-30 10:27:20,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:20,820 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799070084] [2025-04-30 10:27:20,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799070084] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:27:20,820 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691033258] [2025-04-30 10:27:20,820 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:27:20,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:20,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:27:20,822 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-30 10:27:20,823 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-30 10:27:20,920 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 164 statements into 2 equivalence classes. [2025-04-30 10:27:21,287 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 164 of 164 statements. [2025-04-30 10:27:21,287 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-30 10:27:21,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:21,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-30 10:27:21,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:27:21,307 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-30 10:27:21,454 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-30 10:27:21,479 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-04-30 10:27:21,505 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2025-04-30 10:27:21,540 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:27:21,541 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 11 [2025-04-30 10:27:21,571 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2025-04-30 10:27:21,759 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2025-04-30 10:27:21,783 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-30 10:27:21,783 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:27:23,605 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-30 10:27:23,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691033258] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:27:23,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:27:23,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 34 [2025-04-30 10:27:23,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762812099] [2025-04-30 10:27:23,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:27:23,606 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-30 10:27:23,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:23,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-30 10:27:23,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1007, Unknown=0, NotChecked=0, Total=1190 [2025-04-30 10:27:30,581 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-30 10:27:38,635 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-30 10:27:43,734 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-30 10:27:47,836 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-30 10:27:50,937 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-30 10:27:55,013 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Killed by 15