./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_03-list2_rc.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_03-list2_rc.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 8fabb88ade703ed67646ecdb87c815e5ac82dedce1b2b43f0f0859c8695912d8 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:26:55,700 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:26:55,757 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:55,761 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:26:55,761 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:26:55,781 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:26:55,782 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:26:55,782 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:26:55,782 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:26:55,782 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:26:55,783 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:26:55,783 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:26:55,783 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:26:55,784 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:26:55,784 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:26:55,784 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:26:55,784 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:26:55,784 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:26:55,784 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:26:55,784 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:26:55,784 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:26:55,784 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:26:55,784 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:26:55,784 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:26:55,784 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:26:55,784 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:26:55,784 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:26:55,784 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:26:55,784 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:26:55,784 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:26:55,785 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:26:55,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:55,785 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:26:55,785 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:26:55,785 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:26:55,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:55,785 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:26:55,785 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:26:55,785 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:26:55,785 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:26:55,785 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:26:55,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:26:55,785 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:26:55,785 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:26:55,786 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:26:55,786 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 -> 8fabb88ade703ed67646ecdb87c815e5ac82dedce1b2b43f0f0859c8695912d8 [2025-04-30 10:26:56,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:26:56,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:26:56,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:26:56,016 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:26:56,017 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:26:56,018 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_03-list2_rc.i [2025-04-30 10:26:57,340 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2fafee27/36fcb7298b9440bf84f5a777eac18a0d/FLAG9da3650e3 [2025-04-30 10:26:57,664 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:26:57,666 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_03-list2_rc.i [2025-04-30 10:26:57,685 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2fafee27/36fcb7298b9440bf84f5a777eac18a0d/FLAG9da3650e3 [2025-04-30 10:26:58,341 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2fafee27/36fcb7298b9440bf84f5a777eac18a0d [2025-04-30 10:26:58,343 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:26:58,344 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:26:58,345 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:26:58,345 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:26:58,348 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:26:58,348 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:26:58" (1/1) ... [2025-04-30 10:26:58,351 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@765d289e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:58, skipping insertion in model container [2025-04-30 10:26:58,351 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:26:58" (1/1) ... [2025-04-30 10:26:58,382 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:26:58,712 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:26:58,725 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:26:58,803 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:26:58,861 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:26:58,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:58 WrapperNode [2025-04-30 10:26:58,862 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:26:58,862 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:26:58,863 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:26:58,863 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:26:58,867 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:58" (1/1) ... [2025-04-30 10:26:58,884 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:58" (1/1) ... [2025-04-30 10:26:58,907 INFO L138 Inliner]: procedures = 368, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 177 [2025-04-30 10:26:58,908 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:26:58,908 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:26:58,908 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:26:58,908 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:26:58,915 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:58" (1/1) ... [2025-04-30 10:26:58,916 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:58" (1/1) ... [2025-04-30 10:26:58,919 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:58" (1/1) ... [2025-04-30 10:26:58,920 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:58" (1/1) ... [2025-04-30 10:26:58,930 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:58" (1/1) ... [2025-04-30 10:26:58,931 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:58" (1/1) ... [2025-04-30 10:26:58,932 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:58" (1/1) ... [2025-04-30 10:26:58,934 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:58" (1/1) ... [2025-04-30 10:26:58,938 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:58" (1/1) ... [2025-04-30 10:26:58,944 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:26:58,951 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:26:58,952 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:26:58,952 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:26:58,953 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:58" (1/1) ... [2025-04-30 10:26:58,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:58,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:58,980 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:58,984 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:59,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-04-30 10:26:59,004 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:26:59,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-30 10:26:59,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-30 10:26:59,004 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:26:59,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:26:59,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:26:59,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-04-30 10:26:59,004 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-30 10:26:59,005 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-30 10:26:59,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-30 10:26:59,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:26:59,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:26:59,006 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:59,129 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:26:59,131 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:26:59,551 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:26:59,551 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:26:59,572 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:26:59,575 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:26:59,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:26:59 BoogieIcfgContainer [2025-04-30 10:26:59,576 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:26:59,577 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:26:59,577 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:26:59,582 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:26:59,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:26:58" (1/3) ... [2025-04-30 10:26:59,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@609d0269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:26:59, skipping insertion in model container [2025-04-30 10:26:59,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:58" (2/3) ... [2025-04-30 10:26:59,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@609d0269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:26:59, skipping insertion in model container [2025-04-30 10:26:59,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:26:59" (3/3) ... [2025-04-30 10:26:59,584 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_03-list2_rc.i [2025-04-30 10:26:59,593 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:26:59,595 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_03-list2_rc.i that has 2 procedures, 277 locations, 275 edges, 1 initial locations, 0 loop locations, and 28 error locations. [2025-04-30 10:26:59,595 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:26:59,670 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:26:59,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 280 places, 276 transitions, 556 flow [2025-04-30 10:26:59,790 INFO L116 PetriNetUnfolderBase]: 0/275 cut-off events. [2025-04-30 10:26:59,792 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:26:59,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 275 events. 0/275 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 160 event pairs, 0 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-30 10:26:59,797 INFO L82 GeneralOperation]: Start removeDead. Operand has 280 places, 276 transitions, 556 flow [2025-04-30 10:26:59,803 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 279 places, 275 transitions, 553 flow [2025-04-30 10:26:59,810 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:26:59,819 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;@77c5402f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:26:59,820 INFO L341 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2025-04-30 10:26:59,826 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:26:59,827 INFO L116 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-04-30 10:26:59,827 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:26:59,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:59,828 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] [2025-04-30 10:26:59,828 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:26:59,832 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:59,832 INFO L85 PathProgramCache]: Analyzing trace with hash -528824746, now seen corresponding path program 1 times [2025-04-30 10:26:59,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:59,837 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085882541] [2025-04-30 10:26:59,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:59,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:59,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:26:59,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:26:59,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:59,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:00,432 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,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:00,433 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085882541] [2025-04-30 10:27:00,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085882541] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:00,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:00,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:00,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299487538] [2025-04-30 10:27:00,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:00,443 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:00,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:00,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:00,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:00,980 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 276 [2025-04-30 10:27:00,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 275 transitions, 553 flow. Second operand has 6 states, 6 states have (on average 187.33333333333334) internal successors, (1124), 6 states have internal predecessors, (1124), 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,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:00,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 276 [2025-04-30 10:27:00,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:01,445 INFO L116 PetriNetUnfolderBase]: 560/2325 cut-off events. [2025-04-30 10:27:01,445 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:27:01,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3537 conditions, 2325 events. 560/2325 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 14858 event pairs, 560 based on Foata normal form. 0/2115 useless extension candidates. Maximal degree in co-relation 3350. Up to 1193 conditions per place. [2025-04-30 10:27:01,461 INFO L140 encePairwiseOnDemand]: 258/276 looper letters, 72 selfloop transitions, 15 changer transitions 0/272 dead transitions. [2025-04-30 10:27:01,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 272 transitions, 721 flow [2025-04-30 10:27:01,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:01,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:01,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1206 transitions. [2025-04-30 10:27:01,480 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7282608695652174 [2025-04-30 10:27:01,481 INFO L175 Difference]: Start difference. First operand has 279 places, 275 transitions, 553 flow. Second operand 6 states and 1206 transitions. [2025-04-30 10:27:01,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 272 transitions, 721 flow [2025-04-30 10:27:01,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 272 transitions, 720 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:27:01,492 INFO L231 Difference]: Finished difference. Result has 280 places, 272 transitions, 576 flow [2025-04-30 10:27:01,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=576, PETRI_PLACES=280, PETRI_TRANSITIONS=272} [2025-04-30 10:27:01,500 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 1 predicate places. [2025-04-30 10:27:01,500 INFO L485 AbstractCegarLoop]: Abstraction has has 280 places, 272 transitions, 576 flow [2025-04-30 10:27:01,501 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 187.33333333333334) internal successors, (1124), 6 states have internal predecessors, (1124), 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:01,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:01,502 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] [2025-04-30 10:27:01,502 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:27:01,502 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:27:01,503 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:01,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1092997858, now seen corresponding path program 1 times [2025-04-30 10:27:01,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:01,504 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230161835] [2025-04-30 10:27:01,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:01,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:01,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:27:01,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:27:01,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:01,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:01,825 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,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:01,825 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230161835] [2025-04-30 10:27:01,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230161835] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:01,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:01,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:01,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198791516] [2025-04-30 10:27:01,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:01,826 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:01,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:01,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:01,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:02,208 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 276 [2025-04-30 10:27:02,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 272 transitions, 576 flow. Second operand has 6 states, 6 states have (on average 187.33333333333334) internal successors, (1124), 6 states have internal predecessors, (1124), 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,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:02,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 276 [2025-04-30 10:27:02,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:02,438 INFO L116 PetriNetUnfolderBase]: 560/2322 cut-off events. [2025-04-30 10:27:02,438 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:27:02,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3549 conditions, 2322 events. 560/2322 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 14859 event pairs, 560 based on Foata normal form. 0/2115 useless extension candidates. Maximal degree in co-relation 3391. Up to 1193 conditions per place. [2025-04-30 10:27:02,448 INFO L140 encePairwiseOnDemand]: 258/276 looper letters, 72 selfloop transitions, 15 changer transitions 0/269 dead transitions. [2025-04-30 10:27:02,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 269 transitions, 744 flow [2025-04-30 10:27:02,449 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:02,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:02,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1206 transitions. [2025-04-30 10:27:02,453 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7282608695652174 [2025-04-30 10:27:02,453 INFO L175 Difference]: Start difference. First operand has 280 places, 272 transitions, 576 flow. Second operand 6 states and 1206 transitions. [2025-04-30 10:27:02,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 269 transitions, 744 flow [2025-04-30 10:27:02,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 269 transitions, 714 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:02,458 INFO L231 Difference]: Finished difference. Result has 277 places, 269 transitions, 570 flow [2025-04-30 10:27:02,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=570, PETRI_PLACES=277, PETRI_TRANSITIONS=269} [2025-04-30 10:27:02,460 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -2 predicate places. [2025-04-30 10:27:02,460 INFO L485 AbstractCegarLoop]: Abstraction has has 277 places, 269 transitions, 570 flow [2025-04-30 10:27:02,461 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 187.33333333333334) internal successors, (1124), 6 states have internal predecessors, (1124), 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,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:02,461 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] [2025-04-30 10:27:02,461 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:27:02,461 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:27:02,461 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:02,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1560868144, now seen corresponding path program 1 times [2025-04-30 10:27:02,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:02,462 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33881578] [2025-04-30 10:27:02,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:02,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:02,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-30 10:27:02,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-30 10:27:02,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:02,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:02,501 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:02,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:02,503 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33881578] [2025-04-30 10:27:02,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33881578] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:02,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:02,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:27:02,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12549143] [2025-04-30 10:27:02,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:02,505 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:27:02,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:02,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:27:02,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:27:02,523 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 276 [2025-04-30 10:27:02,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 269 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 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,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:02,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 276 [2025-04-30 10:27:02,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:02,593 INFO L116 PetriNetUnfolderBase]: 30/718 cut-off events. [2025-04-30 10:27:02,593 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:27:02,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 718 events. 30/718 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2616 event pairs, 30 based on Foata normal form. 0/643 useless extension candidates. Maximal degree in co-relation 671. Up to 78 conditions per place. [2025-04-30 10:27:02,597 INFO L140 encePairwiseOnDemand]: 273/276 looper letters, 17 selfloop transitions, 2 changer transitions 0/268 dead transitions. [2025-04-30 10:27:02,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 268 transitions, 606 flow [2025-04-30 10:27:02,598 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:27:02,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:27:02,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 788 transitions. [2025-04-30 10:27:02,623 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9516908212560387 [2025-04-30 10:27:02,623 INFO L175 Difference]: Start difference. First operand has 277 places, 269 transitions, 570 flow. Second operand 3 states and 788 transitions. [2025-04-30 10:27:02,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 268 transitions, 606 flow [2025-04-30 10:27:02,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 268 transitions, 576 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:02,626 INFO L231 Difference]: Finished difference. Result has 273 places, 268 transitions, 542 flow [2025-04-30 10:27:02,627 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=542, PETRI_PLACES=273, PETRI_TRANSITIONS=268} [2025-04-30 10:27:02,627 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -6 predicate places. [2025-04-30 10:27:02,627 INFO L485 AbstractCegarLoop]: Abstraction has has 273 places, 268 transitions, 542 flow [2025-04-30 10:27:02,628 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 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,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:02,628 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] [2025-04-30 10:27:02,628 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:27:02,628 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:27:02,629 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:02,629 INFO L85 PathProgramCache]: Analyzing trace with hash -388730026, now seen corresponding path program 1 times [2025-04-30 10:27:02,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:02,629 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874993913] [2025-04-30 10:27:02,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:02,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:02,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-30 10:27:02,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-30 10:27:02,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:02,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:02,659 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:02,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:02,660 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874993913] [2025-04-30 10:27:02,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874993913] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:02,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:02,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:27:02,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6884612] [2025-04-30 10:27:02,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:02,661 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:27:02,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:02,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:27:02,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:27:02,676 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 276 [2025-04-30 10:27:02,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 268 transitions, 542 flow. Second operand has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 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,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:02,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 276 [2025-04-30 10:27:02,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:02,735 INFO L116 PetriNetUnfolderBase]: 36/750 cut-off events. [2025-04-30 10:27:02,735 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:27:02,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 847 conditions, 750 events. 36/750 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2996 event pairs, 36 based on Foata normal form. 0/681 useless extension candidates. Maximal degree in co-relation 788. Up to 89 conditions per place. [2025-04-30 10:27:02,738 INFO L140 encePairwiseOnDemand]: 271/276 looper letters, 17 selfloop transitions, 1 changer transitions 0/264 dead transitions. [2025-04-30 10:27:02,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 264 transitions, 570 flow [2025-04-30 10:27:02,738 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:27:02,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:27:02,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 784 transitions. [2025-04-30 10:27:02,740 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9468599033816425 [2025-04-30 10:27:02,740 INFO L175 Difference]: Start difference. First operand has 273 places, 268 transitions, 542 flow. Second operand 3 states and 784 transitions. [2025-04-30 10:27:02,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 264 transitions, 570 flow [2025-04-30 10:27:02,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 264 transitions, 566 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:27:02,743 INFO L231 Difference]: Finished difference. Result has 269 places, 264 transitions, 532 flow [2025-04-30 10:27:02,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=532, PETRI_PLACES=269, PETRI_TRANSITIONS=264} [2025-04-30 10:27:02,744 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -10 predicate places. [2025-04-30 10:27:02,744 INFO L485 AbstractCegarLoop]: Abstraction has has 269 places, 264 transitions, 532 flow [2025-04-30 10:27:02,745 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 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,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:02,745 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] [2025-04-30 10:27:02,745 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:27:02,745 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:27:02,745 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:02,745 INFO L85 PathProgramCache]: Analyzing trace with hash -744891557, now seen corresponding path program 1 times [2025-04-30 10:27:02,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:02,746 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016477712] [2025-04-30 10:27:02,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:02,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:02,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-04-30 10:27:02,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-04-30 10:27:02,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:02,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:03,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:27:03,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:03,127 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016477712] [2025-04-30 10:27:03,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016477712] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:03,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:03,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:03,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044447010] [2025-04-30 10:27:03,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:03,127 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:03,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:03,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:03,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:03,395 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 276 [2025-04-30 10:27:03,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 264 transitions, 532 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:27:03,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:03,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 276 [2025-04-30 10:27:03,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:03,606 INFO L116 PetriNetUnfolderBase]: 638/2519 cut-off events. [2025-04-30 10:27:03,607 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:27:03,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3891 conditions, 2519 events. 638/2519 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 16283 event pairs, 638 based on Foata normal form. 0/2317 useless extension candidates. Maximal degree in co-relation 3822. Up to 1362 conditions per place. [2025-04-30 10:27:03,616 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 85 selfloop transitions, 5 changer transitions 0/263 dead transitions. [2025-04-30 10:27:03,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 263 transitions, 710 flow [2025-04-30 10:27:03,617 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:03,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:03,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1201 transitions. [2025-04-30 10:27:03,619 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7252415458937198 [2025-04-30 10:27:03,619 INFO L175 Difference]: Start difference. First operand has 269 places, 264 transitions, 532 flow. Second operand 6 states and 1201 transitions. [2025-04-30 10:27:03,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 263 transitions, 710 flow [2025-04-30 10:27:03,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 263 transitions, 709 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:27:03,623 INFO L231 Difference]: Finished difference. Result has 272 places, 263 transitions, 539 flow [2025-04-30 10:27:03,623 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=539, PETRI_PLACES=272, PETRI_TRANSITIONS=263} [2025-04-30 10:27:03,623 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -7 predicate places. [2025-04-30 10:27:03,624 INFO L485 AbstractCegarLoop]: Abstraction has has 272 places, 263 transitions, 539 flow [2025-04-30 10:27:03,624 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:27:03,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:03,624 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:27:03,624 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:27:03,625 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:27:03,625 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:03,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1605273385, now seen corresponding path program 1 times [2025-04-30 10:27:03,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:03,625 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391011965] [2025-04-30 10:27:03,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:03,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:03,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-04-30 10:27:03,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-04-30 10:27:03,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:03,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:03,694 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:03,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:03,694 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391011965] [2025-04-30 10:27:03,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391011965] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:03,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:03,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:27:03,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364971769] [2025-04-30 10:27:03,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:03,695 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:27:03,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:03,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:27:03,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:27:03,712 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 276 [2025-04-30 10:27:03,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 263 transitions, 539 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 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,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:03,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 276 [2025-04-30 10:27:03,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:03,771 INFO L116 PetriNetUnfolderBase]: 30/706 cut-off events. [2025-04-30 10:27:03,771 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:27:03,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 796 conditions, 706 events. 30/706 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2689 event pairs, 30 based on Foata normal form. 0/645 useless extension candidates. Maximal degree in co-relation 737. Up to 78 conditions per place. [2025-04-30 10:27:03,773 INFO L140 encePairwiseOnDemand]: 273/276 looper letters, 17 selfloop transitions, 2 changer transitions 0/262 dead transitions. [2025-04-30 10:27:03,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 262 transitions, 575 flow [2025-04-30 10:27:03,774 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:27:03,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:27:03,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 788 transitions. [2025-04-30 10:27:03,775 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9516908212560387 [2025-04-30 10:27:03,775 INFO L175 Difference]: Start difference. First operand has 272 places, 263 transitions, 539 flow. Second operand 3 states and 788 transitions. [2025-04-30 10:27:03,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 262 transitions, 575 flow [2025-04-30 10:27:03,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 262 transitions, 565 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:03,778 INFO L231 Difference]: Finished difference. Result has 268 places, 262 transitions, 531 flow [2025-04-30 10:27:03,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=531, PETRI_PLACES=268, PETRI_TRANSITIONS=262} [2025-04-30 10:27:03,779 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -11 predicate places. [2025-04-30 10:27:03,779 INFO L485 AbstractCegarLoop]: Abstraction has has 268 places, 262 transitions, 531 flow [2025-04-30 10:27:03,780 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 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,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:03,780 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:03,780 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:27:03,780 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:27:03,781 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:03,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1215126668, now seen corresponding path program 1 times [2025-04-30 10:27:03,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:03,781 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021662102] [2025-04-30 10:27:03,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:03,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:03,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-04-30 10:27:03,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-04-30 10:27:03,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:03,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:03,825 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:03,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:03,825 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021662102] [2025-04-30 10:27:03,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021662102] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:03,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:03,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:27:03,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899748649] [2025-04-30 10:27:03,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:03,826 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:27:03,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:03,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:27:03,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:27:03,842 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 276 [2025-04-30 10:27:03,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 262 transitions, 531 flow. Second operand has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 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,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:03,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 276 [2025-04-30 10:27:03,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:03,912 INFO L116 PetriNetUnfolderBase]: 36/734 cut-off events. [2025-04-30 10:27:03,912 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:27:03,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 734 events. 36/734 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2925 event pairs, 36 based on Foata normal form. 0/678 useless extension candidates. Maximal degree in co-relation 774. Up to 89 conditions per place. [2025-04-30 10:27:03,915 INFO L140 encePairwiseOnDemand]: 271/276 looper letters, 17 selfloop transitions, 1 changer transitions 0/258 dead transitions. [2025-04-30 10:27:03,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 258 transitions, 559 flow [2025-04-30 10:27:03,915 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:27:03,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:27:03,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 784 transitions. [2025-04-30 10:27:03,917 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9468599033816425 [2025-04-30 10:27:03,917 INFO L175 Difference]: Start difference. First operand has 268 places, 262 transitions, 531 flow. Second operand 3 states and 784 transitions. [2025-04-30 10:27:03,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 258 transitions, 559 flow [2025-04-30 10:27:03,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 258 transitions, 555 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:27:03,920 INFO L231 Difference]: Finished difference. Result has 264 places, 258 transitions, 521 flow [2025-04-30 10:27:03,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=521, PETRI_PLACES=264, PETRI_TRANSITIONS=258} [2025-04-30 10:27:03,921 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -15 predicate places. [2025-04-30 10:27:03,921 INFO L485 AbstractCegarLoop]: Abstraction has has 264 places, 258 transitions, 521 flow [2025-04-30 10:27:03,921 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 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,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:03,921 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] [2025-04-30 10:27:03,921 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:27:03,922 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:27:03,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:03,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1203165847, now seen corresponding path program 1 times [2025-04-30 10:27:03,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:03,922 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827045590] [2025-04-30 10:27:03,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:03,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:03,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-04-30 10:27:03,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-04-30 10:27:03,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:03,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:04,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:27:04,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:04,337 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827045590] [2025-04-30 10:27:04,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827045590] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:04,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:04,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:04,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554724816] [2025-04-30 10:27:04,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:04,337 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:04,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:04,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:04,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:04,601 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 276 [2025-04-30 10:27:04,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 258 transitions, 521 flow. Second operand has 6 states, 6 states have (on average 191.16666666666666) internal successors, (1147), 6 states have internal predecessors, (1147), 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:04,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:04,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 276 [2025-04-30 10:27:04,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:04,946 INFO L116 PetriNetUnfolderBase]: 638/2428 cut-off events. [2025-04-30 10:27:04,947 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:27:04,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3801 conditions, 2428 events. 638/2428 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 15408 event pairs, 638 based on Foata normal form. 0/2281 useless extension candidates. Maximal degree in co-relation 3733. Up to 1362 conditions per place. [2025-04-30 10:27:04,956 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 85 selfloop transitions, 5 changer transitions 0/257 dead transitions. [2025-04-30 10:27:04,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 257 transitions, 699 flow [2025-04-30 10:27:04,957 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:04,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:04,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1201 transitions. [2025-04-30 10:27:04,959 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7252415458937198 [2025-04-30 10:27:04,959 INFO L175 Difference]: Start difference. First operand has 264 places, 258 transitions, 521 flow. Second operand 6 states and 1201 transitions. [2025-04-30 10:27:04,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 257 transitions, 699 flow [2025-04-30 10:27:04,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 257 transitions, 698 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:27:04,964 INFO L231 Difference]: Finished difference. Result has 267 places, 257 transitions, 528 flow [2025-04-30 10:27:04,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=528, PETRI_PLACES=267, PETRI_TRANSITIONS=257} [2025-04-30 10:27:04,965 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -12 predicate places. [2025-04-30 10:27:04,965 INFO L485 AbstractCegarLoop]: Abstraction has has 267 places, 257 transitions, 528 flow [2025-04-30 10:27:04,966 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 191.16666666666666) internal successors, (1147), 6 states have internal predecessors, (1147), 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:04,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:04,967 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] [2025-04-30 10:27:04,967 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:27:04,967 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:27:04,968 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:04,968 INFO L85 PathProgramCache]: Analyzing trace with hash -2046601516, now seen corresponding path program 1 times [2025-04-30 10:27:04,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:04,968 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877123662] [2025-04-30 10:27:04,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:04,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:04,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-04-30 10:27:05,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-04-30 10:27:05,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:05,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:05,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:27:05,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:05,340 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877123662] [2025-04-30 10:27:05,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877123662] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:05,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:05,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:05,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651291657] [2025-04-30 10:27:05,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:05,341 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:05,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:05,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:05,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:05,705 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 276 [2025-04-30 10:27:05,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 257 transitions, 528 flow. Second operand has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 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,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:05,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 276 [2025-04-30 10:27:05,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:05,984 INFO L116 PetriNetUnfolderBase]: 232/1787 cut-off events. [2025-04-30 10:27:05,984 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:27:05,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2345 conditions, 1787 events. 232/1787 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 11375 event pairs, 20 based on Foata normal form. 0/1663 useless extension candidates. Maximal degree in co-relation 2277. Up to 305 conditions per place. [2025-04-30 10:27:05,991 INFO L140 encePairwiseOnDemand]: 257/276 looper letters, 100 selfloop transitions, 38 changer transitions 0/331 dead transitions. [2025-04-30 10:27:05,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 331 transitions, 952 flow [2025-04-30 10:27:05,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:05,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:05,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1412 transitions. [2025-04-30 10:27:05,994 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8526570048309179 [2025-04-30 10:27:05,994 INFO L175 Difference]: Start difference. First operand has 267 places, 257 transitions, 528 flow. Second operand 6 states and 1412 transitions. [2025-04-30 10:27:05,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 331 transitions, 952 flow [2025-04-30 10:27:05,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 331 transitions, 942 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:06,000 INFO L231 Difference]: Finished difference. Result has 271 places, 293 transitions, 776 flow [2025-04-30 10:27:06,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=776, PETRI_PLACES=271, PETRI_TRANSITIONS=293} [2025-04-30 10:27:06,001 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -8 predicate places. [2025-04-30 10:27:06,001 INFO L485 AbstractCegarLoop]: Abstraction has has 271 places, 293 transitions, 776 flow [2025-04-30 10:27:06,002 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 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,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:06,002 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] [2025-04-30 10:27:06,002 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:27:06,002 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:27:06,003 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:06,003 INFO L85 PathProgramCache]: Analyzing trace with hash 893767704, now seen corresponding path program 1 times [2025-04-30 10:27:06,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:06,003 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174433149] [2025-04-30 10:27:06,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:06,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:06,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-04-30 10:27:06,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-04-30 10:27:06,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:06,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:06,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:27:06,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:06,349 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174433149] [2025-04-30 10:27:06,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174433149] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:06,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:06,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:06,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890968372] [2025-04-30 10:27:06,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:06,350 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:06,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:06,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:06,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:06,727 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 276 [2025-04-30 10:27:06,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 293 transitions, 776 flow. Second operand has 6 states, 6 states have (on average 224.66666666666666) internal successors, (1348), 6 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:27:06,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:06,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 276 [2025-04-30 10:27:06,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:06,922 INFO L116 PetriNetUnfolderBase]: 185/1591 cut-off events. [2025-04-30 10:27:06,922 INFO L117 PetriNetUnfolderBase]: For 201/206 co-relation queries the response was YES. [2025-04-30 10:27:06,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2363 conditions, 1591 events. 185/1591 cut-off events. For 201/206 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 9965 event pairs, 75 based on Foata normal form. 0/1471 useless extension candidates. Maximal degree in co-relation 2293. Up to 354 conditions per place. [2025-04-30 10:27:06,929 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 96 selfloop transitions, 5 changer transitions 0/308 dead transitions. [2025-04-30 10:27:06,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 308 transitions, 1008 flow [2025-04-30 10:27:06,930 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:06,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:06,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1382 transitions. [2025-04-30 10:27:06,933 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8345410628019324 [2025-04-30 10:27:06,933 INFO L175 Difference]: Start difference. First operand has 271 places, 293 transitions, 776 flow. Second operand 6 states and 1382 transitions. [2025-04-30 10:27:06,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 308 transitions, 1008 flow [2025-04-30 10:27:06,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 308 transitions, 1008 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:27:06,938 INFO L231 Difference]: Finished difference. Result has 275 places, 292 transitions, 784 flow [2025-04-30 10:27:06,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=784, PETRI_PLACES=275, PETRI_TRANSITIONS=292} [2025-04-30 10:27:06,939 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -4 predicate places. [2025-04-30 10:27:06,940 INFO L485 AbstractCegarLoop]: Abstraction has has 275 places, 292 transitions, 784 flow [2025-04-30 10:27:06,940 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.66666666666666) internal successors, (1348), 6 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:27:06,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:06,941 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] [2025-04-30 10:27:06,941 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:27:06,941 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:27:06,941 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:06,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1777114751, now seen corresponding path program 1 times [2025-04-30 10:27:06,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:06,941 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588478358] [2025-04-30 10:27:06,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:06,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:06,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-04-30 10:27:06,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-04-30 10:27:06,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:06,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:07,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:27:07,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:07,239 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588478358] [2025-04-30 10:27:07,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588478358] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:07,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:07,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:07,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508699159] [2025-04-30 10:27:07,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:07,240 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:07,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:07,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:07,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:07,626 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 276 [2025-04-30 10:27:07,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 292 transitions, 784 flow. Second operand has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:07,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 276 [2025-04-30 10:27:07,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:07,939 INFO L116 PetriNetUnfolderBase]: 583/2948 cut-off events. [2025-04-30 10:27:07,940 INFO L117 PetriNetUnfolderBase]: For 699/706 co-relation queries the response was YES. [2025-04-30 10:27:07,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5026 conditions, 2948 events. 583/2948 cut-off events. For 699/706 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 21812 event pairs, 69 based on Foata normal form. 0/2761 useless extension candidates. Maximal degree in co-relation 4953. Up to 795 conditions per place. [2025-04-30 10:27:07,951 INFO L140 encePairwiseOnDemand]: 254/276 looper letters, 111 selfloop transitions, 72 changer transitions 0/381 dead transitions. [2025-04-30 10:27:07,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 381 transitions, 1520 flow [2025-04-30 10:27:07,952 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:07,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:07,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1389 transitions. [2025-04-30 10:27:07,954 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8387681159420289 [2025-04-30 10:27:07,954 INFO L175 Difference]: Start difference. First operand has 275 places, 292 transitions, 784 flow. Second operand 6 states and 1389 transitions. [2025-04-30 10:27:07,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 381 transitions, 1520 flow [2025-04-30 10:27:07,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 381 transitions, 1502 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:07,962 INFO L231 Difference]: Finished difference. Result has 280 places, 362 transitions, 1440 flow [2025-04-30 10:27:07,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1440, PETRI_PLACES=280, PETRI_TRANSITIONS=362} [2025-04-30 10:27:07,963 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 1 predicate places. [2025-04-30 10:27:07,963 INFO L485 AbstractCegarLoop]: Abstraction has has 280 places, 362 transitions, 1440 flow [2025-04-30 10:27:07,964 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:07,964 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] [2025-04-30 10:27:07,964 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:27:07,964 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:27:07,965 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:07,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1489313437, now seen corresponding path program 1 times [2025-04-30 10:27:07,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:07,965 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366843392] [2025-04-30 10:27:07,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:07,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:07,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-04-30 10:27:07,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-04-30 10:27:07,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:07,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:08,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:27:08,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:08,338 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366843392] [2025-04-30 10:27:08,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366843392] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:08,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:08,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:08,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736218673] [2025-04-30 10:27:08,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:08,339 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:08,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:08,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:08,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:08,557 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 276 [2025-04-30 10:27:08,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 362 transitions, 1440 flow. Second operand has 6 states, 6 states have (on average 196.33333333333334) internal successors, (1178), 6 states have internal predecessors, (1178), 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:08,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:08,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 276 [2025-04-30 10:27:08,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:09,217 INFO L116 PetriNetUnfolderBase]: 1657/5695 cut-off events. [2025-04-30 10:27:09,217 INFO L117 PetriNetUnfolderBase]: For 3356/3416 co-relation queries the response was YES. [2025-04-30 10:27:09,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12784 conditions, 5695 events. 1657/5695 cut-off events. For 3356/3416 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 45947 event pairs, 861 based on Foata normal form. 0/5366 useless extension candidates. Maximal degree in co-relation 12709. Up to 3147 conditions per place. [2025-04-30 10:27:09,244 INFO L140 encePairwiseOnDemand]: 253/276 looper letters, 201 selfloop transitions, 89 changer transitions 0/462 dead transitions. [2025-04-30 10:27:09,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 462 transitions, 2424 flow [2025-04-30 10:27:09,244 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:09,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:09,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1302 transitions. [2025-04-30 10:27:09,247 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7862318840579711 [2025-04-30 10:27:09,247 INFO L175 Difference]: Start difference. First operand has 280 places, 362 transitions, 1440 flow. Second operand 6 states and 1302 transitions. [2025-04-30 10:27:09,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 462 transitions, 2424 flow [2025-04-30 10:27:09,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 462 transitions, 2424 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:27:09,262 INFO L231 Difference]: Finished difference. Result has 290 places, 446 transitions, 2242 flow [2025-04-30 10:27:09,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=1440, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2242, PETRI_PLACES=290, PETRI_TRANSITIONS=446} [2025-04-30 10:27:09,263 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 11 predicate places. [2025-04-30 10:27:09,263 INFO L485 AbstractCegarLoop]: Abstraction has has 290 places, 446 transitions, 2242 flow [2025-04-30 10:27:09,264 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 196.33333333333334) internal successors, (1178), 6 states have internal predecessors, (1178), 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,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:09,264 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:09,264 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:27:09,264 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:27:09,265 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:09,265 INFO L85 PathProgramCache]: Analyzing trace with hash 106924031, now seen corresponding path program 1 times [2025-04-30 10:27:09,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:09,265 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408668430] [2025-04-30 10:27:09,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:09,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:09,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-04-30 10:27:09,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-04-30 10:27:09,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:09,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:09,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:27:09,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:09,391 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408668430] [2025-04-30 10:27:09,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408668430] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:09,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:09,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:27:09,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192065278] [2025-04-30 10:27:09,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:09,391 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:27:09,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:09,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:27:09,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:27:09,402 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 276 [2025-04-30 10:27:09,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 446 transitions, 2242 flow. Second operand has 3 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 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,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:09,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 276 [2025-04-30 10:27:09,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:09,575 INFO L116 PetriNetUnfolderBase]: 312/1967 cut-off events. [2025-04-30 10:27:09,575 INFO L117 PetriNetUnfolderBase]: For 1143/1206 co-relation queries the response was YES. [2025-04-30 10:27:09,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4111 conditions, 1967 events. 312/1967 cut-off events. For 1143/1206 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 13450 event pairs, 31 based on Foata normal form. 4/1891 useless extension candidates. Maximal degree in co-relation 4038. Up to 312 conditions per place. [2025-04-30 10:27:09,583 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 10 selfloop transitions, 6 changer transitions 0/386 dead transitions. [2025-04-30 10:27:09,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 386 transitions, 1710 flow [2025-04-30 10:27:09,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:27:09,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:27:09,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 816 transitions. [2025-04-30 10:27:09,585 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9855072463768116 [2025-04-30 10:27:09,585 INFO L175 Difference]: Start difference. First operand has 290 places, 446 transitions, 2242 flow. Second operand 3 states and 816 transitions. [2025-04-30 10:27:09,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 386 transitions, 1710 flow [2025-04-30 10:27:09,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 386 transitions, 1622 flow, removed 44 selfloop flow, removed 0 redundant places. [2025-04-30 10:27:09,598 INFO L231 Difference]: Finished difference. Result has 293 places, 384 transitions, 1612 flow [2025-04-30 10:27:09,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=1578, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1612, PETRI_PLACES=293, PETRI_TRANSITIONS=384} [2025-04-30 10:27:09,600 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 14 predicate places. [2025-04-30 10:27:09,600 INFO L485 AbstractCegarLoop]: Abstraction has has 293 places, 384 transitions, 1612 flow [2025-04-30 10:27:09,600 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 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,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:09,600 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:09,601 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:27:09,601 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:27:09,601 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:09,601 INFO L85 PathProgramCache]: Analyzing trace with hash 735522291, now seen corresponding path program 1 times [2025-04-30 10:27:09,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:09,602 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629477403] [2025-04-30 10:27:09,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:09,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:09,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-04-30 10:27:09,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-04-30 10:27:09,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:09,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:09,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:27:09,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:09,923 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629477403] [2025-04-30 10:27:09,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629477403] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:09,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:09,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:09,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970054287] [2025-04-30 10:27:09,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:09,923 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:09,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:09,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:09,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:10,265 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 276 [2025-04-30 10:27:10,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 384 transitions, 1612 flow. Second operand has 6 states, 6 states have (on average 219.33333333333334) internal successors, (1316), 6 states have internal predecessors, (1316), 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,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:10,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 276 [2025-04-30 10:27:10,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:10,694 INFO L116 PetriNetUnfolderBase]: 690/3113 cut-off events. [2025-04-30 10:27:10,694 INFO L117 PetriNetUnfolderBase]: For 3014/3224 co-relation queries the response was YES. [2025-04-30 10:27:10,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7440 conditions, 3113 events. 690/3113 cut-off events. For 3014/3224 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 23862 event pairs, 54 based on Foata normal form. 20/3022 useless extension candidates. Maximal degree in co-relation 7357. Up to 734 conditions per place. [2025-04-30 10:27:10,706 INFO L140 encePairwiseOnDemand]: 257/276 looper letters, 184 selfloop transitions, 124 changer transitions 4/542 dead transitions. [2025-04-30 10:27:10,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 542 transitions, 3203 flow [2025-04-30 10:27:10,707 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:10,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:10,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1430 transitions. [2025-04-30 10:27:10,709 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8635265700483091 [2025-04-30 10:27:10,710 INFO L175 Difference]: Start difference. First operand has 293 places, 384 transitions, 1612 flow. Second operand 6 states and 1430 transitions. [2025-04-30 10:27:10,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 542 transitions, 3203 flow [2025-04-30 10:27:10,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 542 transitions, 3180 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:27:10,724 INFO L231 Difference]: Finished difference. Result has 301 places, 486 transitions, 2988 flow [2025-04-30 10:27:10,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=1604, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2988, PETRI_PLACES=301, PETRI_TRANSITIONS=486} [2025-04-30 10:27:10,725 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 22 predicate places. [2025-04-30 10:27:10,725 INFO L485 AbstractCegarLoop]: Abstraction has has 301 places, 486 transitions, 2988 flow [2025-04-30 10:27:10,725 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 219.33333333333334) internal successors, (1316), 6 states have internal predecessors, (1316), 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,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:10,726 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:10,726 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:27:10,726 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:27:10,726 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:10,726 INFO L85 PathProgramCache]: Analyzing trace with hash 347820555, now seen corresponding path program 1 times [2025-04-30 10:27:10,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:10,727 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954416733] [2025-04-30 10:27:10,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:10,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:10,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-04-30 10:27:10,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-04-30 10:27:10,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:10,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:11,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:27:11,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:11,089 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954416733] [2025-04-30 10:27:11,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954416733] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:11,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:11,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:11,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819317563] [2025-04-30 10:27:11,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:11,090 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:11,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:11,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:11,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:11,470 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 276 [2025-04-30 10:27:11,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 486 transitions, 2988 flow. Second operand has 6 states, 6 states have (on average 225.66666666666666) internal successors, (1354), 6 states have internal predecessors, (1354), 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:11,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:11,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 276 [2025-04-30 10:27:11,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:11,838 INFO L116 PetriNetUnfolderBase]: 605/2890 cut-off events. [2025-04-30 10:27:11,838 INFO L117 PetriNetUnfolderBase]: For 5486/5701 co-relation queries the response was YES. [2025-04-30 10:27:11,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7823 conditions, 2890 events. 605/2890 cut-off events. For 5486/5701 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 21873 event pairs, 92 based on Foata normal form. 18/2852 useless extension candidates. Maximal degree in co-relation 7737. Up to 803 conditions per place. [2025-04-30 10:27:11,853 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 218 selfloop transitions, 17 changer transitions 0/501 dead transitions. [2025-04-30 10:27:11,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 501 transitions, 3512 flow [2025-04-30 10:27:11,855 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:11,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:11,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1382 transitions. [2025-04-30 10:27:11,857 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8345410628019324 [2025-04-30 10:27:11,857 INFO L175 Difference]: Start difference. First operand has 301 places, 486 transitions, 2988 flow. Second operand 6 states and 1382 transitions. [2025-04-30 10:27:11,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 501 transitions, 3512 flow [2025-04-30 10:27:11,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 501 transitions, 3494 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-04-30 10:27:11,875 INFO L231 Difference]: Finished difference. Result has 305 places, 485 transitions, 3002 flow [2025-04-30 10:27:11,877 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=2968, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3002, PETRI_PLACES=305, PETRI_TRANSITIONS=485} [2025-04-30 10:27:11,878 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 26 predicate places. [2025-04-30 10:27:11,878 INFO L485 AbstractCegarLoop]: Abstraction has has 305 places, 485 transitions, 3002 flow [2025-04-30 10:27:11,879 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 225.66666666666666) internal successors, (1354), 6 states have internal predecessors, (1354), 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:11,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:11,879 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:11,879 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-30 10:27:11,879 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:27:11,880 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:11,880 INFO L85 PathProgramCache]: Analyzing trace with hash 982429328, now seen corresponding path program 1 times [2025-04-30 10:27:11,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:11,880 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479542855] [2025-04-30 10:27:11,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:11,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:11,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-04-30 10:27:11,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-04-30 10:27:11,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:11,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:12,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:27:12,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:12,205 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479542855] [2025-04-30 10:27:12,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479542855] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:12,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:12,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:12,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151564737] [2025-04-30 10:27:12,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:12,205 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:12,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:12,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:12,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:12,395 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 276 [2025-04-30 10:27:12,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 485 transitions, 3002 flow. Second operand has 6 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 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,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:12,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 276 [2025-04-30 10:27:12,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:12,986 INFO L116 PetriNetUnfolderBase]: 1547/5161 cut-off events. [2025-04-30 10:27:12,987 INFO L117 PetriNetUnfolderBase]: For 7535/7618 co-relation queries the response was YES. [2025-04-30 10:27:13,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15138 conditions, 5161 events. 1547/5161 cut-off events. For 7535/7618 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 41510 event pairs, 582 based on Foata normal form. 1/5009 useless extension candidates. Maximal degree in co-relation 15051. Up to 2881 conditions per place. [2025-04-30 10:27:13,012 INFO L140 encePairwiseOnDemand]: 253/276 looper letters, 304 selfloop transitions, 103 changer transitions 8/591 dead transitions. [2025-04-30 10:27:13,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 591 transitions, 4442 flow [2025-04-30 10:27:13,012 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:13,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:13,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1302 transitions. [2025-04-30 10:27:13,014 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7862318840579711 [2025-04-30 10:27:13,014 INFO L175 Difference]: Start difference. First operand has 305 places, 485 transitions, 3002 flow. Second operand 6 states and 1302 transitions. [2025-04-30 10:27:13,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 591 transitions, 4442 flow [2025-04-30 10:27:13,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 591 transitions, 4408 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:13,039 INFO L231 Difference]: Finished difference. Result has 310 places, 571 transitions, 3986 flow [2025-04-30 10:27:13,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=2968, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3986, PETRI_PLACES=310, PETRI_TRANSITIONS=571} [2025-04-30 10:27:13,040 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 31 predicate places. [2025-04-30 10:27:13,040 INFO L485 AbstractCegarLoop]: Abstraction has has 310 places, 571 transitions, 3986 flow [2025-04-30 10:27:13,040 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 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:13,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:13,040 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:13,041 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:27:13,041 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:27:13,041 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:13,041 INFO L85 PathProgramCache]: Analyzing trace with hash -506954707, now seen corresponding path program 1 times [2025-04-30 10:27:13,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:13,042 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921454160] [2025-04-30 10:27:13,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:13,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:13,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-04-30 10:27:13,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-04-30 10:27:13,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:13,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:14,530 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:27:14,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:14,530 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921454160] [2025-04-30 10:27:14,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921454160] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:14,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:14,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-04-30 10:27:14,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815318184] [2025-04-30 10:27:14,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:14,531 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-30 10:27:14,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:14,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-30 10:27:14,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-04-30 10:27:16,597 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 276 [2025-04-30 10:27:16,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 571 transitions, 3986 flow. Second operand has 20 states, 20 states have (on average 151.15) internal successors, (3023), 20 states have internal predecessors, (3023), 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:16,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:16,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 276 [2025-04-30 10:27:16,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:18,190 INFO L116 PetriNetUnfolderBase]: 1717/5670 cut-off events. [2025-04-30 10:27:18,190 INFO L117 PetriNetUnfolderBase]: For 11254/11323 co-relation queries the response was YES. [2025-04-30 10:27:18,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18569 conditions, 5670 events. 1717/5670 cut-off events. For 11254/11323 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 46284 event pairs, 195 based on Foata normal form. 19/5643 useless extension candidates. Maximal degree in co-relation 18462. Up to 1900 conditions per place. [2025-04-30 10:27:18,214 INFO L140 encePairwiseOnDemand]: 245/276 looper letters, 529 selfloop transitions, 101 changer transitions 23/785 dead transitions. [2025-04-30 10:27:18,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 785 transitions, 6962 flow [2025-04-30 10:27:18,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-30 10:27:18,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-04-30 10:27:18,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 4364 transitions. [2025-04-30 10:27:18,219 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5646997929606625 [2025-04-30 10:27:18,220 INFO L175 Difference]: Start difference. First operand has 310 places, 571 transitions, 3986 flow. Second operand 28 states and 4364 transitions. [2025-04-30 10:27:18,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 785 transitions, 6962 flow [2025-04-30 10:27:18,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 785 transitions, 6758 flow, removed 102 selfloop flow, removed 0 redundant places. [2025-04-30 10:27:18,260 INFO L231 Difference]: Finished difference. Result has 347 places, 604 transitions, 4436 flow [2025-04-30 10:27:18,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=3838, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=4436, PETRI_PLACES=347, PETRI_TRANSITIONS=604} [2025-04-30 10:27:18,261 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 68 predicate places. [2025-04-30 10:27:18,261 INFO L485 AbstractCegarLoop]: Abstraction has has 347 places, 604 transitions, 4436 flow [2025-04-30 10:27:18,262 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 151.15) internal successors, (3023), 20 states have internal predecessors, (3023), 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:18,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:18,262 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:18,262 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:27:18,262 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:27:18,263 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:18,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1784194913, now seen corresponding path program 1 times [2025-04-30 10:27:18,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:18,263 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558125137] [2025-04-30 10:27:18,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:18,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:18,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-04-30 10:27:18,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-04-30 10:27:18,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:18,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:19,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:27:19,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:19,359 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558125137] [2025-04-30 10:27:19,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558125137] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:19,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:19,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-04-30 10:27:19,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137323124] [2025-04-30 10:27:19,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:19,360 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-30 10:27:19,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:19,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-30 10:27:19,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:27:21,680 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 276 [2025-04-30 10:27:21,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 604 transitions, 4436 flow. Second operand has 18 states, 18 states have (on average 176.66666666666666) internal successors, (3180), 18 states have internal predecessors, (3180), 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:21,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:21,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 276 [2025-04-30 10:27:21,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:22,793 INFO L116 PetriNetUnfolderBase]: 1407/5298 cut-off events. [2025-04-30 10:27:22,793 INFO L117 PetriNetUnfolderBase]: For 13190/13375 co-relation queries the response was YES. [2025-04-30 10:27:22,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17957 conditions, 5298 events. 1407/5298 cut-off events. For 13190/13375 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 45180 event pairs, 151 based on Foata normal form. 27/5271 useless extension candidates. Maximal degree in co-relation 17833. Up to 1437 conditions per place. [2025-04-30 10:27:22,822 INFO L140 encePairwiseOnDemand]: 243/276 looper letters, 400 selfloop transitions, 123 changer transitions 8/777 dead transitions. [2025-04-30 10:27:22,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 777 transitions, 7003 flow [2025-04-30 10:27:22,823 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-30 10:27:22,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-04-30 10:27:22,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4148 transitions. [2025-04-30 10:27:22,825 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6534341524889729 [2025-04-30 10:27:22,825 INFO L175 Difference]: Start difference. First operand has 347 places, 604 transitions, 4436 flow. Second operand 23 states and 4148 transitions. [2025-04-30 10:27:22,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 777 transitions, 7003 flow [2025-04-30 10:27:22,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 777 transitions, 6879 flow, removed 51 selfloop flow, removed 10 redundant places. [2025-04-30 10:27:22,878 INFO L231 Difference]: Finished difference. Result has 367 places, 668 transitions, 5598 flow [2025-04-30 10:27:22,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=4354, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=5598, PETRI_PLACES=367, PETRI_TRANSITIONS=668} [2025-04-30 10:27:22,879 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 88 predicate places. [2025-04-30 10:27:22,879 INFO L485 AbstractCegarLoop]: Abstraction has has 367 places, 668 transitions, 5598 flow [2025-04-30 10:27:22,880 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 176.66666666666666) internal successors, (3180), 18 states have internal predecessors, (3180), 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:22,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:22,880 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:22,880 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-30 10:27:22,880 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:27:22,881 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:22,881 INFO L85 PathProgramCache]: Analyzing trace with hash -93022475, now seen corresponding path program 2 times [2025-04-30 10:27:22,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:22,881 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270895582] [2025-04-30 10:27:22,881 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:27:22,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:22,902 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 188 statements into 2 equivalence classes. [2025-04-30 10:27:22,928 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 188 of 188 statements. [2025-04-30 10:27:22,928 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:27:22,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:23,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:27:23,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:23,906 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270895582] [2025-04-30 10:27:23,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270895582] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:23,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:23,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-04-30 10:27:23,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858875917] [2025-04-30 10:27:23,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:23,907 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-30 10:27:23,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:23,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-30 10:27:23,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2025-04-30 10:27:26,154 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 276 [2025-04-30 10:27:26,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 668 transitions, 5598 flow. Second operand has 20 states, 20 states have (on average 174.35) internal successors, (3487), 20 states have internal predecessors, (3487), 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:26,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:26,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 276 [2025-04-30 10:27:26,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:27,654 INFO L116 PetriNetUnfolderBase]: 1484/5521 cut-off events. [2025-04-30 10:27:27,654 INFO L117 PetriNetUnfolderBase]: For 18003/18246 co-relation queries the response was YES. [2025-04-30 10:27:27,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19886 conditions, 5521 events. 1484/5521 cut-off events. For 18003/18246 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 47037 event pairs, 151 based on Foata normal form. 76/5541 useless extension candidates. Maximal degree in co-relation 19752. Up to 802 conditions per place. [2025-04-30 10:27:27,691 INFO L140 encePairwiseOnDemand]: 244/276 looper letters, 475 selfloop transitions, 171 changer transitions 9/897 dead transitions. [2025-04-30 10:27:27,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 897 transitions, 8829 flow [2025-04-30 10:27:27,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-30 10:27:27,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-04-30 10:27:27,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 6028 transitions. [2025-04-30 10:27:27,695 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6423699914748509 [2025-04-30 10:27:27,695 INFO L175 Difference]: Start difference. First operand has 367 places, 668 transitions, 5598 flow. Second operand 34 states and 6028 transitions. [2025-04-30 10:27:27,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 897 transitions, 8829 flow [2025-04-30 10:27:27,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 897 transitions, 8743 flow, removed 23 selfloop flow, removed 11 redundant places. [2025-04-30 10:27:27,768 INFO L231 Difference]: Finished difference. Result has 402 places, 734 transitions, 6802 flow [2025-04-30 10:27:27,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=5548, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=668, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=6802, PETRI_PLACES=402, PETRI_TRANSITIONS=734} [2025-04-30 10:27:27,769 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 123 predicate places. [2025-04-30 10:27:27,769 INFO L485 AbstractCegarLoop]: Abstraction has has 402 places, 734 transitions, 6802 flow [2025-04-30 10:27:27,770 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 174.35) internal successors, (3487), 20 states have internal predecessors, (3487), 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:27,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:27,770 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:27,770 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-30 10:27:27,770 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:27:27,771 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:27,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1974530083, now seen corresponding path program 3 times [2025-04-30 10:27:27,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:27,771 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282306518] [2025-04-30 10:27:27,771 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:27:27,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:27,801 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 188 statements into 2 equivalence classes. [2025-04-30 10:27:27,865 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 188 of 188 statements. [2025-04-30 10:27:27,865 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-30 10:27:27,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:28,944 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:27:28,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:28,944 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282306518] [2025-04-30 10:27:28,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282306518] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:27:28,945 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990604571] [2025-04-30 10:27:28,945 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:27:28,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:28,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:27:28,947 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:28,949 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:29,098 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 188 statements into 2 equivalence classes. [2025-04-30 10:27:31,366 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 188 of 188 statements. [2025-04-30 10:27:31,366 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-30 10:27:31,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:31,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 94 conjuncts are in the unsatisfiable core [2025-04-30 10:27:31,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:27:31,422 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2025-04-30 10:27:31,521 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-30 10:27:31,521 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-30 10:27:31,798 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 11 treesize of output 7 [2025-04-30 10:27:31,804 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 11 treesize of output 7 [2025-04-30 10:27:31,912 INFO L325 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-04-30 10:27:31,912 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-04-30 10:27:32,169 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:27:32,177 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:27:32,281 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:27:32,288 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:27:32,435 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 32 treesize of output 23 [2025-04-30 10:27:32,441 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-04-30 10:27:32,922 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 11 treesize of output 7 [2025-04-30 10:27:33,002 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-04-30 10:27:33,047 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-04-30 10:27:33,141 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-30 10:27:33,147 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2025-04-30 10:27:33,182 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2025-04-30 10:27:33,225 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2025-04-30 10:27:33,240 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2025-04-30 10:27:33,253 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2025-04-30 10:27:33,266 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2025-04-30 10:27:33,311 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 37 treesize of output 26 [2025-04-30 10:27:33,320 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 37 treesize of output 26 [2025-04-30 10:27:33,330 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 37 treesize of output 26 [2025-04-30 10:27:33,339 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 37 treesize of output 26 [2025-04-30 10:27:33,374 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 37 treesize of output 26 [2025-04-30 10:27:33,400 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:27:33,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:27:33,422 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2558 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2558) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2558 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2558) c_~B~0.base) (+ 6 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2558 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2558) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2558 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2558) c_~B~0.base) (+ 7 c_~B~0.offset)) 0))) is different from false [2025-04-30 10:27:33,513 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2553 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2553) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2558) c_~B~0.base) (+ 6 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2553 (Array Int Int))) (= 0 (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2553) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2558) c_~B~0.base) (+ 5 c_~B~0.offset)))) (forall ((v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2553 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2553) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2558) c_~B~0.base) (+ 7 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2553 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2553) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2558) c_~B~0.base) (+ 4 c_~B~0.offset)) 0))) is different from false [2025-04-30 10:27:33,550 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse1 0)))) (and (forall ((v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2553 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2553) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2558) c_~B~0.base) (+ 6 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2553 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2553) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2558) c_~B~0.base) .cse1) 0)) (forall ((v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2553 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2553) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2558) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2553 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2553) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2558) c_~B~0.base) (+ 4 c_~B~0.offset)) 0))))) is different from false [2025-04-30 10:27:33,564 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 7 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse2 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4)))) (and (forall ((v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2553 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2553) .cse1 v_ArrVal_2558) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2553 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2553) .cse1 v_ArrVal_2558) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2553 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2553) .cse1 v_ArrVal_2558) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2553 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2553) .cse1 v_ArrVal_2558) c_~B~0.base) (+ 6 c_~B~0.offset)) 0))))) is different from false [2025-04-30 10:27:33,619 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 6 c_~B~0.offset)) (.cse3 (+ 7 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (store (select |c_#race| c_~B~0.base) .cse2 0) .cse3 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4)))) (and (forall ((v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2553 (Array Int Int))) (= 0 (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2553) .cse1 v_ArrVal_2558) c_~B~0.base) .cse2))) (forall ((v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2553 (Array Int Int))) (= 0 (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2553) .cse1 v_ArrVal_2558) c_~B~0.base) .cse3))) (forall ((v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2553 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2553) .cse1 v_ArrVal_2558) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2553 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2553) .cse1 v_ArrVal_2558) c_~B~0.base) (+ 5 c_~B~0.offset)) 0))))) is different from false [2025-04-30 10:27:33,634 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 5 c_~B~0.offset)) (.cse2 (+ 6 c_~B~0.offset)) (.cse3 (+ 7 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (store (store (select |c_#race| c_~B~0.base) .cse4 0) .cse2 0) .cse3 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4)))) (and (forall ((v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2553 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2553) .cse1 v_ArrVal_2558) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2553 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2553) .cse1 v_ArrVal_2558) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2553 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2553) .cse1 v_ArrVal_2558) c_~B~0.base) .cse3) 0)) (forall ((v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2553 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2553) .cse1 v_ArrVal_2558) c_~B~0.base) .cse4) 0))))) is different from false [2025-04-30 10:27:33,668 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:33,668 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 46 treesize of output 62 [2025-04-30 10:27:33,673 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:33,673 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 124 treesize of output 94 [2025-04-30 10:27:33,677 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2025-04-30 10:27:33,679 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2025-04-30 10:27:33,699 INFO L325 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-04-30 10:27:33,699 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 1 [2025-04-30 10:27:33,704 INFO L325 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-04-30 10:27:33,704 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 1 [2025-04-30 10:27:33,708 INFO L325 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-04-30 10:27:33,708 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 1 [2025-04-30 10:27:34,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:27:34,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990604571] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:27:34,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:27:34,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 17] total 50 [2025-04-30 10:27:34,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501953841] [2025-04-30 10:27:34,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:27:34,268 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-04-30 10:27:34,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:34,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-04-30 10:27:34,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1796, Unknown=9, NotChecked=546, Total=2550 [2025-04-30 10:27:34,424 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 276 [2025-04-30 10:27:34,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 734 transitions, 6802 flow. Second operand has 51 states, 51 states have (on average 113.17647058823529) internal successors, (5772), 51 states have internal predecessors, (5772), 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:34,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:34,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 276 [2025-04-30 10:27:34,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:39,062 INFO L116 PetriNetUnfolderBase]: 3674/10175 cut-off events. [2025-04-30 10:27:39,062 INFO L117 PetriNetUnfolderBase]: For 38307/38333 co-relation queries the response was YES. [2025-04-30 10:27:39,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39922 conditions, 10175 events. 3674/10175 cut-off events. For 38307/38333 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 88528 event pairs, 624 based on Foata normal form. 17/10081 useless extension candidates. Maximal degree in co-relation 39769. Up to 2102 conditions per place. [2025-04-30 10:27:39,130 INFO L140 encePairwiseOnDemand]: 237/276 looper letters, 923 selfloop transitions, 209 changer transitions 29/1258 dead transitions. [2025-04-30 10:27:39,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 1258 transitions, 13334 flow [2025-04-30 10:27:39,130 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-30 10:27:39,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-04-30 10:27:39,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 3494 transitions. [2025-04-30 10:27:39,135 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45212215320910976 [2025-04-30 10:27:39,135 INFO L175 Difference]: Start difference. First operand has 402 places, 734 transitions, 6802 flow. Second operand 28 states and 3494 transitions. [2025-04-30 10:27:39,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 1258 transitions, 13334 flow [2025-04-30 10:27:39,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 1258 transitions, 13152 flow, removed 26 selfloop flow, removed 18 redundant places. [2025-04-30 10:27:39,329 INFO L231 Difference]: Finished difference. Result has 421 places, 821 transitions, 8841 flow [2025-04-30 10:27:39,329 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=6662, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=734, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=8841, PETRI_PLACES=421, PETRI_TRANSITIONS=821} [2025-04-30 10:27:39,330 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 142 predicate places. [2025-04-30 10:27:39,330 INFO L485 AbstractCegarLoop]: Abstraction has has 421 places, 821 transitions, 8841 flow [2025-04-30 10:27:39,332 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 113.17647058823529) internal successors, (5772), 51 states have internal predecessors, (5772), 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:39,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:39,332 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:39,342 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:39,532 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:39,533 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:27:39,534 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:39,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1022643871, now seen corresponding path program 4 times [2025-04-30 10:27:39,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:39,534 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962637763] [2025-04-30 10:27:39,534 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:27:39,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:39,558 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 188 statements into 2 equivalence classes. [2025-04-30 10:27:39,578 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 182 of 188 statements. [2025-04-30 10:27:39,578 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:27:39,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:40,497 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:27:40,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:40,498 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962637763] [2025-04-30 10:27:40,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962637763] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:27:40,498 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890145722] [2025-04-30 10:27:40,498 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:27:40,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:40,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:27:40,500 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:40,501 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:40,686 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 188 statements into 2 equivalence classes. [2025-04-30 10:27:40,735 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 182 of 188 statements. [2025-04-30 10:27:40,735 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:27:40,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:40,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-30 10:27:40,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:27:40,751 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:40,813 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-30 10:27:40,814 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-30 10:27:40,950 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-30 10:27:41,006 INFO L325 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2025-04-30 10:27:41,006 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2025-04-30 10:27:41,113 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 29 treesize of output 22 [2025-04-30 10:27:41,154 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 29 treesize of output 22 [2025-04-30 10:27:41,189 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 29 treesize of output 22 [2025-04-30 10:27:41,322 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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:41,368 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 30 treesize of output 12 [2025-04-30 10:27:41,391 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-30 10:27:41,396 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-30 10:27:41,401 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-30 10:27:41,410 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-30 10:27:41,418 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 18 treesize of output 13 [2025-04-30 10:27:41,426 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 18 treesize of output 13 [2025-04-30 10:27:41,430 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 18 treesize of output 13 [2025-04-30 10:27:41,435 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 18 treesize of output 13 [2025-04-30 10:27:41,441 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:41,449 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:41,449 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:41,459 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:41,459 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:41,483 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:41,488 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:27:41,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:27:41,501 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2927 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2927) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2927 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2927) c_~B~0.base) (+ 7 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2927 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2927) c_~B~0.base) (+ 6 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2927 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2927) c_~B~0.base) (+ 5 c_~B~0.offset)) 0))) is different from false [2025-04-30 10:27:41,716 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 6 c_~B~0.offset)) (.cse2 (+ 7 c_~B~0.offset)) (.cse0 (+ 5 c_~B~0.offset))) (and (forall ((v_ArrVal_2922 (Array Int Int)) (v_ArrVal_2927 (Array Int Int))) (= (select (select (store (store |c_#race| c_~B~0.base (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2922) c_~B~0.base) .cse0 0) .cse1 0) .cse2 0)) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2927) c_~B~0.base) .cse1) 0)) (forall ((v_ArrVal_2922 (Array Int Int)) (v_ArrVal_2927 (Array Int Int))) (= (select (select (store (store |c_#race| c_~B~0.base (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2922) c_~B~0.base) .cse0 0) .cse1 0) .cse2 0)) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2927) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_2922 (Array Int Int)) (v_ArrVal_2927 (Array Int Int))) (= (select (select (store (store |c_#race| c_~B~0.base (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2922) c_~B~0.base) .cse0 0) .cse1 0) .cse2 0)) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2927) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2922 (Array Int Int)) (v_ArrVal_2927 (Array Int Int))) (= (select (select (store (store |c_#race| c_~B~0.base (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2922) c_~B~0.base) .cse0 0) .cse1 0) .cse2 0)) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2927) c_~B~0.base) .cse0) 0)))) is different from false [2025-04-30 10:27:41,779 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 6 c_~B~0.offset)) (.cse3 (+ 7 c_~B~0.offset)) (.cse1 (+ 5 c_~B~0.offset))) (and (forall ((v_ArrVal_2922 (Array Int Int)) (v_ArrVal_2918 (Array Int Int)) (v_ArrVal_2927 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| c_~A~0.base v_ArrVal_2918))) (store .cse0 c_~B~0.base (store (store (store (select (store .cse0 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2922) c_~B~0.base) .cse1 0) .cse2 0) .cse3 0))) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2927) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2922 (Array Int Int)) (v_ArrVal_2918 (Array Int Int)) (v_ArrVal_2927 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| c_~A~0.base v_ArrVal_2918))) (store .cse4 c_~B~0.base (store (store (store (select (store .cse4 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2922) c_~B~0.base) .cse1 0) .cse2 0) .cse3 0))) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2927) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_2922 (Array Int Int)) (v_ArrVal_2918 (Array Int Int)) (v_ArrVal_2927 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| c_~A~0.base v_ArrVal_2918))) (store .cse5 c_~B~0.base (store (store (store (select (store .cse5 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2922) c_~B~0.base) .cse1 0) .cse2 0) .cse3 0))) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2927) c_~B~0.base) .cse3) 0)) (forall ((v_ArrVal_2922 (Array Int Int)) (v_ArrVal_2918 (Array Int Int)) (v_ArrVal_2927 (Array Int Int))) (= 0 (select (select (store (let ((.cse6 (store |c_#race| c_~A~0.base v_ArrVal_2918))) (store .cse6 c_~B~0.base (store (store (store (select (store .cse6 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2922) c_~B~0.base) .cse1 0) .cse2 0) .cse3 0))) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2927) c_~B~0.base) .cse1))))) is different from false [2025-04-30 10:27:41,932 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:27:41,935 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:41,935 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 1 case distinctions, treesize of input 31 treesize of output 32 [2025-04-30 10:27:41,937 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:27:41,938 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 36 treesize of output 24 [2025-04-30 10:27:41,941 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:27:41,942 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:27:41,943 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:27:41,943 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:27:42,423 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:27:42,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890145722] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:27:42,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:27:42,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 39 [2025-04-30 10:27:42,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767882948] [2025-04-30 10:27:42,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:27:42,424 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-30 10:27:42,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:42,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-30 10:27:42,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1136, Unknown=71, NotChecked=216, Total=1560 [2025-04-30 10:27:42,727 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 276 [2025-04-30 10:27:42,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 821 transitions, 8841 flow. Second operand has 40 states, 40 states have (on average 114.7) internal successors, (4588), 40 states have internal predecessors, (4588), 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:42,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:42,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 276 [2025-04-30 10:27:42,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:47,930 INFO L116 PetriNetUnfolderBase]: 4393/12147 cut-off events. [2025-04-30 10:27:47,930 INFO L117 PetriNetUnfolderBase]: For 57725/57757 co-relation queries the response was YES. [2025-04-30 10:27:47,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50062 conditions, 12147 events. 4393/12147 cut-off events. For 57725/57757 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 110299 event pairs, 926 based on Foata normal form. 17/12019 useless extension candidates. Maximal degree in co-relation 49898. Up to 2580 conditions per place. [2025-04-30 10:27:48,009 INFO L140 encePairwiseOnDemand]: 242/276 looper letters, 946 selfloop transitions, 227 changer transitions 12/1284 dead transitions. [2025-04-30 10:27:48,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 1284 transitions, 15664 flow [2025-04-30 10:27:48,009 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-30 10:27:48,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-04-30 10:27:48,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2914 transitions. [2025-04-30 10:27:48,011 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4590422180214241 [2025-04-30 10:27:48,011 INFO L175 Difference]: Start difference. First operand has 421 places, 821 transitions, 8841 flow. Second operand 23 states and 2914 transitions. [2025-04-30 10:27:48,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 1284 transitions, 15664 flow [2025-04-30 10:27:48,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 1284 transitions, 15581 flow, removed 19 selfloop flow, removed 14 redundant places. [2025-04-30 10:27:48,290 INFO L231 Difference]: Finished difference. Result has 437 places, 914 transitions, 11405 flow [2025-04-30 10:27:48,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=8767, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=821, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=608, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=11405, PETRI_PLACES=437, PETRI_TRANSITIONS=914} [2025-04-30 10:27:48,291 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 158 predicate places. [2025-04-30 10:27:48,291 INFO L485 AbstractCegarLoop]: Abstraction has has 437 places, 914 transitions, 11405 flow [2025-04-30 10:27:48,293 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 114.7) internal successors, (4588), 40 states have internal predecessors, (4588), 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:48,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:48,293 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:48,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-30 10:27:48,493 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-30 10:27:48,494 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-30 10:27:48,495 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:48,495 INFO L85 PathProgramCache]: Analyzing trace with hash -2136589447, now seen corresponding path program 5 times [2025-04-30 10:27:48,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:48,495 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363728455] [2025-04-30 10:27:48,495 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:27:48,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:48,516 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 188 statements into 3 equivalence classes. [2025-04-30 10:27:48,532 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 188 of 188 statements. [2025-04-30 10:27:48,532 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-30 10:27:48,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:49,389 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:27:49,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:49,390 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363728455] [2025-04-30 10:27:49,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363728455] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:27:49,390 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929162325] [2025-04-30 10:27:49,390 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:27:49,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:49,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:27:49,392 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:27:49,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-30 10:27:49,544 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 188 statements into 3 equivalence classes. [2025-04-30 10:27:50,779 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 188 of 188 statements. [2025-04-30 10:27:50,779 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-30 10:27:50,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:50,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-30 10:27:50,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:27:50,794 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:50,817 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-30 10:27:50,817 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-30 10:27:50,907 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 19 treesize of output 1 [2025-04-30 10:27:50,942 INFO L325 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2025-04-30 10:27:50,942 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2025-04-30 10:27:50,985 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 19 treesize of output 14 [2025-04-30 10:27:51,009 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 19 treesize of output 14 [2025-04-30 10:27:51,032 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 19 treesize of output 14 [2025-04-30 10:27:51,111 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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:51,117 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-04-30 10:27:51,174 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 20 treesize of output 8 [2025-04-30 10:27:51,183 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2025-04-30 10:27:51,193 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:51,193 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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:51,202 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2025-04-30 10:27:51,216 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:51,216 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2025-04-30 10:27:51,232 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-04-30 10:27:51,243 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-04-30 10:27:51,269 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:51,280 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:51,290 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:51,301 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:51,341 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:51,347 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:27:51,348 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:27:51,362 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3296 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3296) c_~B~0.base) (+ 7 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3296 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3296) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3296 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3296) c_~B~0.base) (+ 6 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3296 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3296) c_~B~0.base) (+ 4 c_~B~0.offset)) 0))) is different from false [2025-04-30 10:27:51,503 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse1 0)))) (and (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3291 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_3291) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3296) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3291 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_3291) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3296) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3291 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_3291) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3296) c_~B~0.base) (+ 6 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3291 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_3291) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3296) c_~B~0.base) .cse1) 0))))) is different from false [2025-04-30 10:27:51,515 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 7 c_~B~0.offset))) (and (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3291 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base (store (select (store |c_#race| c_~A~0.base v_ArrVal_3288) c_~B~0.base) .cse0 0)) c_~A~0.base v_ArrVal_3291) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3296) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3291 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base (store (select (store |c_#race| c_~A~0.base v_ArrVal_3288) c_~B~0.base) .cse0 0)) c_~A~0.base v_ArrVal_3291) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3296) c_~B~0.base) (+ 6 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3291 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base (store (select (store |c_#race| c_~A~0.base v_ArrVal_3288) c_~B~0.base) .cse0 0)) c_~A~0.base v_ArrVal_3291) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3296) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3291 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base (store (select (store |c_#race| c_~A~0.base v_ArrVal_3288) c_~B~0.base) .cse0 0)) c_~A~0.base v_ArrVal_3291) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3296) c_~B~0.base) .cse0) 0)))) is different from false [2025-04-30 10:27:51,531 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 6 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse2 0))) (.cse1 (+ 7 c_~B~0.offset))) (and (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3291 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base (store (select (store .cse0 c_~A~0.base v_ArrVal_3288) c_~B~0.base) .cse1 0)) c_~A~0.base v_ArrVal_3291) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3296) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3291 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base (store (select (store .cse0 c_~A~0.base v_ArrVal_3288) c_~B~0.base) .cse1 0)) c_~A~0.base v_ArrVal_3291) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3296) c_~B~0.base) .cse1) 0)) (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3291 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base (store (select (store .cse0 c_~A~0.base v_ArrVal_3288) c_~B~0.base) .cse1 0)) c_~A~0.base v_ArrVal_3291) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3296) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3291 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base (store (select (store .cse0 c_~A~0.base v_ArrVal_3288) c_~B~0.base) .cse1 0)) c_~A~0.base v_ArrVal_3291) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3296) c_~B~0.base) (+ 4 c_~B~0.offset)) 0))))) is different from false [2025-04-30 10:27:51,544 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 6 c_~B~0.offset)) (.cse1 (+ 7 c_~B~0.offset))) (and (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3286 (Array Int Int)) (v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3291 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base (store (select (store (store |c_#race| c_~B~0.base (store (select (store |c_#race| c_~A~0.base v_ArrVal_3286) c_~B~0.base) .cse0 0)) c_~A~0.base v_ArrVal_3288) c_~B~0.base) .cse1 0)) c_~A~0.base v_ArrVal_3291) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3296) c_~B~0.base) .cse0) 0)) (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3286 (Array Int Int)) (v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3291 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base (store (select (store (store |c_#race| c_~B~0.base (store (select (store |c_#race| c_~A~0.base v_ArrVal_3286) c_~B~0.base) .cse0 0)) c_~A~0.base v_ArrVal_3288) c_~B~0.base) .cse1 0)) c_~A~0.base v_ArrVal_3291) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3296) c_~B~0.base) .cse1) 0)) (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3286 (Array Int Int)) (v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3291 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base (store (select (store (store |c_#race| c_~B~0.base (store (select (store |c_#race| c_~A~0.base v_ArrVal_3286) c_~B~0.base) .cse0 0)) c_~A~0.base v_ArrVal_3288) c_~B~0.base) .cse1 0)) c_~A~0.base v_ArrVal_3291) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3296) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3286 (Array Int Int)) (v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3291 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base (store (select (store (store |c_#race| c_~B~0.base (store (select (store |c_#race| c_~A~0.base v_ArrVal_3286) c_~B~0.base) .cse0 0)) c_~A~0.base v_ArrVal_3288) c_~B~0.base) .cse1 0)) c_~A~0.base v_ArrVal_3291) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3296) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)))) is different from false [2025-04-30 10:27:51,558 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 6 c_~B~0.offset)) (.cse1 (+ 7 c_~B~0.offset)) (.cse2 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4)))) (and (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3286 (Array Int Int)) (v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3291 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base (store (select (store (store |c_#race| c_~B~0.base (store (select (store |c_#race| c_~A~0.base v_ArrVal_3286) c_~B~0.base) .cse0 0)) c_~A~0.base v_ArrVal_3288) c_~B~0.base) .cse1 0)) c_~A~0.base v_ArrVal_3291) .cse2 v_ArrVal_3296) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3286 (Array Int Int)) (v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3291 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base (store (select (store (store |c_#race| c_~B~0.base (store (select (store |c_#race| c_~A~0.base v_ArrVal_3286) c_~B~0.base) .cse0 0)) c_~A~0.base v_ArrVal_3288) c_~B~0.base) .cse1 0)) c_~A~0.base v_ArrVal_3291) .cse2 v_ArrVal_3296) c_~B~0.base) .cse0) 0)) (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3286 (Array Int Int)) (v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3291 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base (store (select (store (store |c_#race| c_~B~0.base (store (select (store |c_#race| c_~A~0.base v_ArrVal_3286) c_~B~0.base) .cse0 0)) c_~A~0.base v_ArrVal_3288) c_~B~0.base) .cse1 0)) c_~A~0.base v_ArrVal_3291) .cse2 v_ArrVal_3296) c_~B~0.base) .cse1) 0)) (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3286 (Array Int Int)) (v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3291 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base (store (select (store (store |c_#race| c_~B~0.base (store (select (store |c_#race| c_~A~0.base v_ArrVal_3286) c_~B~0.base) .cse0 0)) c_~A~0.base v_ArrVal_3288) c_~B~0.base) .cse1 0)) c_~A~0.base v_ArrVal_3291) .cse2 v_ArrVal_3296) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)))) is different from false [2025-04-30 10:27:51,600 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 5 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse4 0))) (.cse1 (+ 6 c_~B~0.offset)) (.cse2 (+ 7 c_~B~0.offset)) (.cse3 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4)))) (and (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3286 (Array Int Int)) (v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3291 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base (store (select (store (store |c_#race| c_~B~0.base (store (select (store .cse0 c_~A~0.base v_ArrVal_3286) c_~B~0.base) .cse1 0)) c_~A~0.base v_ArrVal_3288) c_~B~0.base) .cse2 0)) c_~A~0.base v_ArrVal_3291) .cse3 v_ArrVal_3296) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3286 (Array Int Int)) (v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3291 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base (store (select (store (store |c_#race| c_~B~0.base (store (select (store .cse0 c_~A~0.base v_ArrVal_3286) c_~B~0.base) .cse1 0)) c_~A~0.base v_ArrVal_3288) c_~B~0.base) .cse2 0)) c_~A~0.base v_ArrVal_3291) .cse3 v_ArrVal_3296) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3286 (Array Int Int)) (v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3291 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base (store (select (store (store |c_#race| c_~B~0.base (store (select (store .cse0 c_~A~0.base v_ArrVal_3286) c_~B~0.base) .cse1 0)) c_~A~0.base v_ArrVal_3288) c_~B~0.base) .cse2 0)) c_~A~0.base v_ArrVal_3291) .cse3 v_ArrVal_3296) c_~B~0.base) .cse1) 0)) (forall ((v_ArrVal_3296 (Array Int Int)) (v_ArrVal_3286 (Array Int Int)) (v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3291 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base (store (select (store (store |c_#race| c_~B~0.base (store (select (store .cse0 c_~A~0.base v_ArrVal_3286) c_~B~0.base) .cse1 0)) c_~A~0.base v_ArrVal_3288) c_~B~0.base) .cse2 0)) c_~A~0.base v_ArrVal_3291) .cse3 v_ArrVal_3296) c_~B~0.base) .cse4) 0))))) is different from false [2025-04-30 10:27:51,611 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:27:51,611 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 2 case distinctions, treesize of input 119 treesize of output 124 [2025-04-30 10:27:51,616 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 63 [2025-04-30 10:27:51,618 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2025-04-30 10:27:51,620 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2025-04-30 10:27:51,633 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:27:51,633 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:27:51,636 INFO L325 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2025-04-30 10:27:51,636 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 1 [2025-04-30 10:27:51,638 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:27:51,638 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:27:51,639 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:27:51,640 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:27:52,055 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:27:52,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929162325] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:27:52,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:27:52,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 19] total 36 [2025-04-30 10:27:52,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431775236] [2025-04-30 10:27:52,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:27:52,056 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-30 10:27:52,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:52,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-30 10:27:52,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=767, Unknown=24, NotChecked=434, Total=1332 [2025-04-30 10:27:52,268 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 276 [2025-04-30 10:27:52,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 914 transitions, 11405 flow. Second operand has 37 states, 37 states have (on average 114.29729729729729) internal successors, (4229), 37 states have internal predecessors, (4229), 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:52,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:52,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 276 [2025-04-30 10:27:52,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15