./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_06-ptra_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 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 ../sv-benchmarks/c/goblint-regression/09-regions_06-ptra_nr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c74b9abfd84bef3aa9e712193319c6938e59ac72c91a2b202dc32aee3a54e2e3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:05:21,515 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:05:21,561 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:05:21,564 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:05:21,565 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:05:21,579 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:05:21,581 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:05:21,581 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:05:21,581 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:05:21,581 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:05:21,581 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:05:21,581 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:05:21,582 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:05:21,582 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:05:21,582 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:05:21,582 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:05:21,582 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:05:21,582 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:05:21,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:05:21,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:05:21,582 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:05:21,582 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:05:21,582 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:05:21,582 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:05:21,582 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:05:21,582 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:05:21,582 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:05:21,582 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:05:21,582 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:05:21,582 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:05:21,582 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:05:21,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:05:21,583 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:05:21,583 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:05:21,583 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:05:21,583 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:05:21,583 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:05:21,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:05:21,583 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:05:21,583 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:05:21,583 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:05:21,583 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:05:21,583 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 -> c74b9abfd84bef3aa9e712193319c6938e59ac72c91a2b202dc32aee3a54e2e3 [2025-03-17 11:05:21,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:05:21,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:05:21,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:05:21,805 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:05:21,805 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:05:21,806 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_06-ptra_nr.i [2025-03-17 11:05:22,999 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b443dd3ca/a2617227923246e1a6e82a4b39a98dc9/FLAGc080041a4 [2025-03-17 11:05:23,324 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:05:23,325 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_06-ptra_nr.i [2025-03-17 11:05:23,354 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b443dd3ca/a2617227923246e1a6e82a4b39a98dc9/FLAGc080041a4 [2025-03-17 11:05:23,564 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b443dd3ca/a2617227923246e1a6e82a4b39a98dc9 [2025-03-17 11:05:23,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:05:23,567 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:05:23,568 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:05:23,568 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:05:23,570 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:05:23,571 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:05:23" (1/1) ... [2025-03-17 11:05:23,572 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d464b30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:23, skipping insertion in model container [2025-03-17 11:05:23,572 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:05:23" (1/1) ... [2025-03-17 11:05:23,595 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:05:23,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:05:23,866 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:05:23,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:05:23,947 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:05:23,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:23 WrapperNode [2025-03-17 11:05:23,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:05:23,948 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:05:23,948 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:05:23,948 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:05:23,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:23" (1/1) ... [2025-03-17 11:05:23,961 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:23" (1/1) ... [2025-03-17 11:05:23,983 INFO L138 Inliner]: procedures = 189, calls = 29, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 258 [2025-03-17 11:05:23,984 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:05:23,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:05:23,984 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:05:23,984 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:05:23,989 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:23" (1/1) ... [2025-03-17 11:05:23,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:23" (1/1) ... [2025-03-17 11:05:23,997 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:23" (1/1) ... [2025-03-17 11:05:23,997 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:23" (1/1) ... [2025-03-17 11:05:24,009 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:23" (1/1) ... [2025-03-17 11:05:24,012 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:23" (1/1) ... [2025-03-17 11:05:24,013 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:23" (1/1) ... [2025-03-17 11:05:24,014 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:23" (1/1) ... [2025-03-17 11:05:24,016 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:05:24,017 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:05:24,017 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:05:24,017 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:05:24,017 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:23" (1/1) ... [2025-03-17 11:05:24,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:05:24,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:05:24,039 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-03-17 11:05:24,044 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-03-17 11:05:24,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:05:24,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:05:24,056 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 11:05:24,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:05:24,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:05:24,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-17 11:05:24,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-17 11:05:24,056 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-17 11:05:24,056 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-17 11:05:24,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:05:24,056 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 11:05:24,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:05:24,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:05:24,057 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:05:24,151 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:05:24,153 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:05:24,517 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:05:24,517 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:05:24,546 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:05:24,547 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:05:24,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:05:24 BoogieIcfgContainer [2025-03-17 11:05:24,547 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:05:24,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:05:24,550 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:05:24,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:05:24,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:05:23" (1/3) ... [2025-03-17 11:05:24,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32da19a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:05:24, skipping insertion in model container [2025-03-17 11:05:24,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:23" (2/3) ... [2025-03-17 11:05:24,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32da19a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:05:24, skipping insertion in model container [2025-03-17 11:05:24,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:05:24" (3/3) ... [2025-03-17 11:05:24,558 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_06-ptra_nr.i [2025-03-17 11:05:24,569 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:05:24,572 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_06-ptra_nr.i that has 2 procedures, 294 locations, 1 initial locations, 0 loop locations, and 22 error locations. [2025-03-17 11:05:24,572 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:05:24,641 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 11:05:24,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 297 places, 293 transitions, 590 flow [2025-03-17 11:05:24,790 INFO L124 PetriNetUnfolderBase]: 0/292 cut-off events. [2025-03-17 11:05:24,792 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:05:24,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 292 events. 0/292 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 114 event pairs, 0 based on Foata normal form. 0/270 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-03-17 11:05:24,795 INFO L82 GeneralOperation]: Start removeDead. Operand has 297 places, 293 transitions, 590 flow [2025-03-17 11:05:24,801 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 296 places, 292 transitions, 587 flow [2025-03-17 11:05:24,806 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:05:24,820 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3fdcb10f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:05:24,820 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-03-17 11:05:24,835 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:05:24,835 INFO L124 PetriNetUnfolderBase]: 0/87 cut-off events. [2025-03-17 11:05:24,835 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:05:24,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:24,836 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] [2025-03-17 11:05:24,836 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:05:24,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:24,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1978285835, now seen corresponding path program 1 times [2025-03-17 11:05:24,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:24,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397898301] [2025-03-17 11:05:24,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:24,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:24,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 11:05:24,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 11:05:24,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:24,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:25,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:05:25,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:25,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397898301] [2025-03-17 11:05:25,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397898301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:25,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:25,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:05:25,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089198937] [2025-03-17 11:05:25,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:25,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:05:25,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:25,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:05:25,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:05:26,013 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 293 [2025-03-17 11:05:26,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 292 transitions, 587 flow. Second operand has 6 states, 6 states have (on average 224.33333333333334) internal successors, (1346), 6 states have internal predecessors, (1346), 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-03-17 11:05:26,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:26,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 293 [2025-03-17 11:05:26,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:26,266 INFO L124 PetriNetUnfolderBase]: 220/1135 cut-off events. [2025-03-17 11:05:26,266 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:05:26,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1647 conditions, 1135 events. 220/1135 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5604 event pairs, 220 based on Foata normal form. 0/1027 useless extension candidates. Maximal degree in co-relation 1424. Up to 493 conditions per place. [2025-03-17 11:05:26,275 INFO L140 encePairwiseOnDemand]: 275/293 looper letters, 52 selfloop transitions, 15 changer transitions 0/289 dead transitions. [2025-03-17 11:05:26,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 289 transitions, 715 flow [2025-03-17 11:05:26,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:05:26,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:05:26,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1408 transitions. [2025-03-17 11:05:26,296 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.800910125142207 [2025-03-17 11:05:26,297 INFO L175 Difference]: Start difference. First operand has 296 places, 292 transitions, 587 flow. Second operand 6 states and 1408 transitions. [2025-03-17 11:05:26,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 289 transitions, 715 flow [2025-03-17 11:05:26,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 289 transitions, 714 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:05:26,310 INFO L231 Difference]: Finished difference. Result has 297 places, 289 transitions, 610 flow [2025-03-17 11:05:26,312 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=610, PETRI_PLACES=297, PETRI_TRANSITIONS=289} [2025-03-17 11:05:26,316 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 1 predicate places. [2025-03-17 11:05:26,316 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 289 transitions, 610 flow [2025-03-17 11:05:26,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.33333333333334) internal successors, (1346), 6 states have internal predecessors, (1346), 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-03-17 11:05:26,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:26,317 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] [2025-03-17 11:05:26,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:05:26,318 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:05:26,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:26,319 INFO L85 PathProgramCache]: Analyzing trace with hash 471840654, now seen corresponding path program 1 times [2025-03-17 11:05:26,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:26,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508070304] [2025-03-17 11:05:26,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:26,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:26,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 11:05:26,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 11:05:26,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:26,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:26,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:05:26,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:26,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508070304] [2025-03-17 11:05:26,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508070304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:26,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:26,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:05:26,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673840485] [2025-03-17 11:05:26,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:26,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:05:26,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:26,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:05:26,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:05:27,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 293 [2025-03-17 11:05:27,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 289 transitions, 610 flow. Second operand has 6 states, 6 states have (on average 224.33333333333334) internal successors, (1346), 6 states have internal predecessors, (1346), 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-03-17 11:05:27,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:27,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 293 [2025-03-17 11:05:27,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:27,273 INFO L124 PetriNetUnfolderBase]: 220/1132 cut-off events. [2025-03-17 11:05:27,274 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:05:27,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1659 conditions, 1132 events. 220/1132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5631 event pairs, 220 based on Foata normal form. 0/1027 useless extension candidates. Maximal degree in co-relation 1449. Up to 493 conditions per place. [2025-03-17 11:05:27,279 INFO L140 encePairwiseOnDemand]: 275/293 looper letters, 52 selfloop transitions, 15 changer transitions 0/286 dead transitions. [2025-03-17 11:05:27,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 286 transitions, 738 flow [2025-03-17 11:05:27,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:05:27,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:05:27,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1408 transitions. [2025-03-17 11:05:27,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.800910125142207 [2025-03-17 11:05:27,286 INFO L175 Difference]: Start difference. First operand has 297 places, 289 transitions, 610 flow. Second operand 6 states and 1408 transitions. [2025-03-17 11:05:27,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 286 transitions, 738 flow [2025-03-17 11:05:27,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 286 transitions, 708 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:05:27,294 INFO L231 Difference]: Finished difference. Result has 294 places, 286 transitions, 604 flow [2025-03-17 11:05:27,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=604, PETRI_PLACES=294, PETRI_TRANSITIONS=286} [2025-03-17 11:05:27,295 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -2 predicate places. [2025-03-17 11:05:27,295 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 286 transitions, 604 flow [2025-03-17 11:05:27,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.33333333333334) internal successors, (1346), 6 states have internal predecessors, (1346), 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-03-17 11:05:27,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:27,296 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] [2025-03-17 11:05:27,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:05:27,296 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:05:27,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:27,297 INFO L85 PathProgramCache]: Analyzing trace with hash 120540968, now seen corresponding path program 1 times [2025-03-17 11:05:27,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:27,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917403631] [2025-03-17 11:05:27,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:27,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:27,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 11:05:27,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 11:05:27,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:27,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:27,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:05:27,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:27,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917403631] [2025-03-17 11:05:27,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917403631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:27,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:27,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:05:27,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120601498] [2025-03-17 11:05:27,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:27,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:05:27,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:27,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:05:27,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:05:27,396 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 293 [2025-03-17 11:05:27,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 286 transitions, 604 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-03-17 11:05:27,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:27,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 293 [2025-03-17 11:05:27,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:27,440 INFO L124 PetriNetUnfolderBase]: 16/421 cut-off events. [2025-03-17 11:05:27,440 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:05:27,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 421 events. 16/421 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 789 event pairs, 16 based on Foata normal form. 0/386 useless extension candidates. Maximal degree in co-relation 291. Up to 47 conditions per place. [2025-03-17 11:05:27,442 INFO L140 encePairwiseOnDemand]: 290/293 looper letters, 14 selfloop transitions, 2 changer transitions 0/285 dead transitions. [2025-03-17 11:05:27,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 285 transitions, 634 flow [2025-03-17 11:05:27,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:05:27,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:05:27,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 845 transitions. [2025-03-17 11:05:27,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9613196814562003 [2025-03-17 11:05:27,447 INFO L175 Difference]: Start difference. First operand has 294 places, 286 transitions, 604 flow. Second operand 3 states and 845 transitions. [2025-03-17 11:05:27,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 285 transitions, 634 flow [2025-03-17 11:05:27,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 285 transitions, 604 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:05:27,450 INFO L231 Difference]: Finished difference. Result has 290 places, 285 transitions, 576 flow [2025-03-17 11:05:27,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=576, PETRI_PLACES=290, PETRI_TRANSITIONS=285} [2025-03-17 11:05:27,451 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -6 predicate places. [2025-03-17 11:05:27,451 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 285 transitions, 576 flow [2025-03-17 11:05:27,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-03-17 11:05:27,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:27,453 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] [2025-03-17 11:05:27,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:05:27,453 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:05:27,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:27,454 INFO L85 PathProgramCache]: Analyzing trace with hash 873109951, now seen corresponding path program 1 times [2025-03-17 11:05:27,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:27,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208308647] [2025-03-17 11:05:27,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:27,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:27,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 11:05:27,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 11:05:27,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:27,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:27,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:05:27,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:27,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208308647] [2025-03-17 11:05:27,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208308647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:27,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:27,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:05:27,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813809039] [2025-03-17 11:05:27,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:27,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:05:27,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:27,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:05:27,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:05:27,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 293 [2025-03-17 11:05:27,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 285 transitions, 576 flow. Second operand has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 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-03-17 11:05:27,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:27,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 293 [2025-03-17 11:05:27,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:27,589 INFO L124 PetriNetUnfolderBase]: 24/498 cut-off events. [2025-03-17 11:05:27,589 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:05:27,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 498 events. 24/498 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1230 event pairs, 24 based on Foata normal form. 0/465 useless extension candidates. Maximal degree in co-relation 458. Up to 63 conditions per place. [2025-03-17 11:05:27,591 INFO L140 encePairwiseOnDemand]: 287/293 looper letters, 15 selfloop transitions, 1 changer transitions 0/280 dead transitions. [2025-03-17 11:05:27,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 280 transitions, 598 flow [2025-03-17 11:05:27,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:05:27,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:05:27,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 837 transitions. [2025-03-17 11:05:27,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9522184300341296 [2025-03-17 11:05:27,593 INFO L175 Difference]: Start difference. First operand has 290 places, 285 transitions, 576 flow. Second operand 3 states and 837 transitions. [2025-03-17 11:05:27,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 280 transitions, 598 flow [2025-03-17 11:05:27,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 280 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:05:27,598 INFO L231 Difference]: Finished difference. Result has 285 places, 280 transitions, 564 flow [2025-03-17 11:05:27,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=285, PETRI_TRANSITIONS=280} [2025-03-17 11:05:27,599 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -11 predicate places. [2025-03-17 11:05:27,599 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 280 transitions, 564 flow [2025-03-17 11:05:27,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 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-03-17 11:05:27,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:27,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] [2025-03-17 11:05:27,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:05:27,600 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:05:27,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:27,601 INFO L85 PathProgramCache]: Analyzing trace with hash -851905311, now seen corresponding path program 1 times [2025-03-17 11:05:27,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:27,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24375319] [2025-03-17 11:05:27,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:27,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:27,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 11:05:27,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 11:05:27,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:27,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:27,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:05:27,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:27,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24375319] [2025-03-17 11:05:27,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24375319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:27,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:27,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:05:27,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350162352] [2025-03-17 11:05:27,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:27,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:05:27,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:27,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:05:27,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:05:28,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 293 [2025-03-17 11:05:28,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 280 transitions, 564 flow. Second operand has 6 states, 6 states have (on average 225.16666666666666) internal successors, (1351), 6 states have internal predecessors, (1351), 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-03-17 11:05:28,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:28,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 293 [2025-03-17 11:05:28,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:28,385 INFO L124 PetriNetUnfolderBase]: 288/1275 cut-off events. [2025-03-17 11:05:28,386 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:05:28,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1928 conditions, 1275 events. 288/1275 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6533 event pairs, 288 based on Foata normal form. 0/1214 useless extension candidates. Maximal degree in co-relation 1807. Up to 643 conditions per place. [2025-03-17 11:05:28,389 INFO L140 encePairwiseOnDemand]: 287/293 looper letters, 66 selfloop transitions, 5 changer transitions 0/279 dead transitions. [2025-03-17 11:05:28,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 279 transitions, 704 flow [2025-03-17 11:05:28,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:05:28,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:05:28,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1398 transitions. [2025-03-17 11:05:28,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7952218430034129 [2025-03-17 11:05:28,392 INFO L175 Difference]: Start difference. First operand has 285 places, 280 transitions, 564 flow. Second operand 6 states and 1398 transitions. [2025-03-17 11:05:28,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 279 transitions, 704 flow [2025-03-17 11:05:28,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 279 transitions, 703 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:05:28,395 INFO L231 Difference]: Finished difference. Result has 288 places, 279 transitions, 571 flow [2025-03-17 11:05:28,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=571, PETRI_PLACES=288, PETRI_TRANSITIONS=279} [2025-03-17 11:05:28,396 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -8 predicate places. [2025-03-17 11:05:28,396 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 279 transitions, 571 flow [2025-03-17 11:05:28,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 225.16666666666666) internal successors, (1351), 6 states have internal predecessors, (1351), 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-03-17 11:05:28,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:28,397 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] [2025-03-17 11:05:28,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:05:28,397 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:05:28,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:28,397 INFO L85 PathProgramCache]: Analyzing trace with hash -842735307, now seen corresponding path program 1 times [2025-03-17 11:05:28,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:28,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383905435] [2025-03-17 11:05:28,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:28,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:28,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 11:05:28,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 11:05:28,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:28,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:28,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:05:28,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:28,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383905435] [2025-03-17 11:05:28,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383905435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:28,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:28,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:05:28,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59046964] [2025-03-17 11:05:28,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:28,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:05:28,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:28,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:05:28,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:05:28,460 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 293 [2025-03-17 11:05:28,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 279 transitions, 571 flow. Second operand has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 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-03-17 11:05:28,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:28,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 293 [2025-03-17 11:05:28,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:28,492 INFO L124 PetriNetUnfolderBase]: 6/342 cut-off events. [2025-03-17 11:05:28,492 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:05:28,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 342 events. 6/342 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 393 event pairs, 6 based on Foata normal form. 0/325 useless extension candidates. Maximal degree in co-relation 266. Up to 23 conditions per place. [2025-03-17 11:05:28,494 INFO L140 encePairwiseOnDemand]: 290/293 looper letters, 10 selfloop transitions, 2 changer transitions 0/278 dead transitions. [2025-03-17 11:05:28,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 278 transitions, 593 flow [2025-03-17 11:05:28,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:05:28,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:05:28,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 853 transitions. [2025-03-17 11:05:28,495 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704209328782708 [2025-03-17 11:05:28,495 INFO L175 Difference]: Start difference. First operand has 288 places, 279 transitions, 571 flow. Second operand 3 states and 853 transitions. [2025-03-17 11:05:28,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 278 transitions, 593 flow [2025-03-17 11:05:28,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 278 transitions, 583 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:05:28,499 INFO L231 Difference]: Finished difference. Result has 284 places, 278 transitions, 563 flow [2025-03-17 11:05:28,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=563, PETRI_PLACES=284, PETRI_TRANSITIONS=278} [2025-03-17 11:05:28,501 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -12 predicate places. [2025-03-17 11:05:28,501 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 278 transitions, 563 flow [2025-03-17 11:05:28,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 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-03-17 11:05:28,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:28,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 11:05:28,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:05:28,502 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:05:28,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:28,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1308515756, now seen corresponding path program 1 times [2025-03-17 11:05:28,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:28,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942615961] [2025-03-17 11:05:28,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:28,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:28,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 11:05:28,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 11:05:28,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:28,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:28,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:05:28,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:28,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942615961] [2025-03-17 11:05:28,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942615961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:28,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:28,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:05:28,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020916195] [2025-03-17 11:05:28,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:28,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:05:28,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:28,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:05:28,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:05:28,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 284 out of 293 [2025-03-17 11:05:28,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 278 transitions, 563 flow. Second operand has 3 states, 3 states have (on average 285.0) internal successors, (855), 3 states have internal predecessors, (855), 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-03-17 11:05:28,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:28,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 284 of 293 [2025-03-17 11:05:28,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:28,592 INFO L124 PetriNetUnfolderBase]: 4/339 cut-off events. [2025-03-17 11:05:28,592 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:05:28,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 339 events. 4/339 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 248 event pairs, 4 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 253. Up to 15 conditions per place. [2025-03-17 11:05:28,593 INFO L140 encePairwiseOnDemand]: 291/293 looper letters, 7 selfloop transitions, 1 changer transitions 0/277 dead transitions. [2025-03-17 11:05:28,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 277 transitions, 577 flow [2025-03-17 11:05:28,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:05:28,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:05:28,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 861 transitions. [2025-03-17 11:05:28,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9795221843003413 [2025-03-17 11:05:28,595 INFO L175 Difference]: Start difference. First operand has 284 places, 278 transitions, 563 flow. Second operand 3 states and 861 transitions. [2025-03-17 11:05:28,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 277 transitions, 577 flow [2025-03-17 11:05:28,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 277 transitions, 573 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:05:28,598 INFO L231 Difference]: Finished difference. Result has 283 places, 277 transitions, 559 flow [2025-03-17 11:05:28,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=559, PETRI_PLACES=283, PETRI_TRANSITIONS=277} [2025-03-17 11:05:28,600 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -13 predicate places. [2025-03-17 11:05:28,600 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 277 transitions, 559 flow [2025-03-17 11:05:28,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 285.0) internal successors, (855), 3 states have internal predecessors, (855), 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-03-17 11:05:28,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:28,601 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-03-17 11:05:28,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:05:28,601 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:05:28,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:28,601 INFO L85 PathProgramCache]: Analyzing trace with hash 716145100, now seen corresponding path program 1 times [2025-03-17 11:05:28,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:28,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111162531] [2025-03-17 11:05:28,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:28,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:28,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 11:05:28,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 11:05:28,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:28,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:28,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:05:28,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:28,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111162531] [2025-03-17 11:05:28,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111162531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:28,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:28,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:05:28,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876090426] [2025-03-17 11:05:28,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:28,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:05:28,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:28,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:05:28,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:05:29,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 293 [2025-03-17 11:05:29,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 277 transitions, 559 flow. Second operand has 6 states, 6 states have (on average 234.33333333333334) internal successors, (1406), 6 states have internal predecessors, (1406), 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-03-17 11:05:29,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:29,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 293 [2025-03-17 11:05:29,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:29,575 INFO L124 PetriNetUnfolderBase]: 316/1589 cut-off events. [2025-03-17 11:05:29,575 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:05:29,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2329 conditions, 1589 events. 316/1589 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 9547 event pairs, 43 based on Foata normal form. 0/1500 useless extension candidates. Maximal degree in co-relation 2209. Up to 388 conditions per place. [2025-03-17 11:05:29,580 INFO L140 encePairwiseOnDemand]: 265/293 looper letters, 107 selfloop transitions, 70 changer transitions 0/389 dead transitions. [2025-03-17 11:05:29,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 389 transitions, 1137 flow [2025-03-17 11:05:29,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:05:29,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:05:29,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1547 transitions. [2025-03-17 11:05:29,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8799772468714449 [2025-03-17 11:05:29,583 INFO L175 Difference]: Start difference. First operand has 283 places, 277 transitions, 559 flow. Second operand 6 states and 1547 transitions. [2025-03-17 11:05:29,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 389 transitions, 1137 flow [2025-03-17 11:05:29,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 389 transitions, 1136 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:05:29,590 INFO L231 Difference]: Finished difference. Result has 291 places, 347 transitions, 1036 flow [2025-03-17 11:05:29,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1036, PETRI_PLACES=291, PETRI_TRANSITIONS=347} [2025-03-17 11:05:29,591 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -5 predicate places. [2025-03-17 11:05:29,591 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 347 transitions, 1036 flow [2025-03-17 11:05:29,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 234.33333333333334) internal successors, (1406), 6 states have internal predecessors, (1406), 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-03-17 11:05:29,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:29,591 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:05:29,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:05:29,592 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:05:29,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:29,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1628205132, now seen corresponding path program 1 times [2025-03-17 11:05:29,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:29,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784582582] [2025-03-17 11:05:29,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:29,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:29,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 11:05:29,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 11:05:29,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:29,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:29,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:05:29,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:29,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784582582] [2025-03-17 11:05:29,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784582582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:29,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:29,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:05:29,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463095850] [2025-03-17 11:05:29,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:29,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:05:29,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:29,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:05:29,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:05:30,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 293 [2025-03-17 11:05:30,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 347 transitions, 1036 flow. Second operand has 6 states, 6 states have (on average 235.16666666666666) internal successors, (1411), 6 states have internal predecessors, (1411), 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-03-17 11:05:30,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:30,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 293 [2025-03-17 11:05:30,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:30,581 INFO L124 PetriNetUnfolderBase]: 588/2368 cut-off events. [2025-03-17 11:05:30,582 INFO L125 PetriNetUnfolderBase]: For 603/609 co-relation queries the response was YES. [2025-03-17 11:05:30,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4766 conditions, 2368 events. 588/2368 cut-off events. For 603/609 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 15358 event pairs, 222 based on Foata normal form. 0/2256 useless extension candidates. Maximal degree in co-relation 4644. Up to 1090 conditions per place. [2025-03-17 11:05:30,592 INFO L140 encePairwiseOnDemand]: 278/293 looper letters, 114 selfloop transitions, 48 changer transitions 0/398 dead transitions. [2025-03-17 11:05:30,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 398 transitions, 1532 flow [2025-03-17 11:05:30,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:05:30,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:05:30,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1484 transitions. [2025-03-17 11:05:30,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8441410693970421 [2025-03-17 11:05:30,594 INFO L175 Difference]: Start difference. First operand has 291 places, 347 transitions, 1036 flow. Second operand 6 states and 1484 transitions. [2025-03-17 11:05:30,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 398 transitions, 1532 flow [2025-03-17 11:05:30,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 398 transitions, 1532 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:05:30,602 INFO L231 Difference]: Finished difference. Result has 301 places, 390 transitions, 1424 flow [2025-03-17 11:05:30,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1424, PETRI_PLACES=301, PETRI_TRANSITIONS=390} [2025-03-17 11:05:30,603 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 5 predicate places. [2025-03-17 11:05:30,603 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 390 transitions, 1424 flow [2025-03-17 11:05:30,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 235.16666666666666) internal successors, (1411), 6 states have internal predecessors, (1411), 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-03-17 11:05:30,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:30,604 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:05:30,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:05:30,604 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:05:30,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:30,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1895885378, now seen corresponding path program 1 times [2025-03-17 11:05:30,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:30,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038653157] [2025-03-17 11:05:30,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:30,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:30,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-17 11:05:30,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-17 11:05:30,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:30,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:30,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:05:30,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:30,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038653157] [2025-03-17 11:05:30,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038653157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:30,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:30,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:05:30,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220683665] [2025-03-17 11:05:30,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:30,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:05:30,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:30,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:05:30,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:05:31,225 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 293 [2025-03-17 11:05:31,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 390 transitions, 1424 flow. Second operand has 6 states, 6 states have (on average 241.16666666666666) internal successors, (1447), 6 states have internal predecessors, (1447), 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-03-17 11:05:31,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:31,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 293 [2025-03-17 11:05:31,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:31,613 INFO L124 PetriNetUnfolderBase]: 689/2809 cut-off events. [2025-03-17 11:05:31,614 INFO L125 PetriNetUnfolderBase]: For 1554/1610 co-relation queries the response was YES. [2025-03-17 11:05:31,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6391 conditions, 2809 events. 689/2809 cut-off events. For 1554/1610 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 19682 event pairs, 57 based on Foata normal form. 0/2722 useless extension candidates. Maximal degree in co-relation 6262. Up to 932 conditions per place. [2025-03-17 11:05:31,627 INFO L140 encePairwiseOnDemand]: 270/293 looper letters, 135 selfloop transitions, 136 changer transitions 4/530 dead transitions. [2025-03-17 11:05:31,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 530 transitions, 2730 flow [2025-03-17 11:05:31,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:05:31,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:05:31,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1547 transitions. [2025-03-17 11:05:31,631 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8799772468714449 [2025-03-17 11:05:31,631 INFO L175 Difference]: Start difference. First operand has 301 places, 390 transitions, 1424 flow. Second operand 6 states and 1547 transitions. [2025-03-17 11:05:31,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 530 transitions, 2730 flow [2025-03-17 11:05:31,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 530 transitions, 2712 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-17 11:05:31,645 INFO L231 Difference]: Finished difference. Result has 311 places, 521 transitions, 2772 flow [2025-03-17 11:05:31,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=1406, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2772, PETRI_PLACES=311, PETRI_TRANSITIONS=521} [2025-03-17 11:05:31,646 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 15 predicate places. [2025-03-17 11:05:31,646 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 521 transitions, 2772 flow [2025-03-17 11:05:31,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 241.16666666666666) internal successors, (1447), 6 states have internal predecessors, (1447), 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-03-17 11:05:31,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:31,647 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:05:31,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:05:31,647 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:05:31,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:31,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1945135672, now seen corresponding path program 1 times [2025-03-17 11:05:31,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:31,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697694486] [2025-03-17 11:05:31,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:31,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:31,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-17 11:05:31,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-17 11:05:31,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:31,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:32,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:05:32,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:32,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697694486] [2025-03-17 11:05:32,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697694486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:32,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:32,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:05:32,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910529199] [2025-03-17 11:05:32,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:32,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:05:32,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:32,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:05:32,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:05:32,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 293 [2025-03-17 11:05:32,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 521 transitions, 2772 flow. Second operand has 6 states, 6 states have (on average 235.16666666666666) internal successors, (1411), 6 states have internal predecessors, (1411), 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-03-17 11:05:32,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:32,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 293 [2025-03-17 11:05:32,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:32,649 INFO L124 PetriNetUnfolderBase]: 968/3493 cut-off events. [2025-03-17 11:05:32,649 INFO L125 PetriNetUnfolderBase]: For 3836/3908 co-relation queries the response was YES. [2025-03-17 11:05:32,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9734 conditions, 3493 events. 968/3493 cut-off events. For 3836/3908 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 24908 event pairs, 207 based on Foata normal form. 0/3406 useless extension candidates. Maximal degree in co-relation 9602. Up to 1565 conditions per place. [2025-03-17 11:05:32,667 INFO L140 encePairwiseOnDemand]: 278/293 looper letters, 239 selfloop transitions, 62 changer transitions 0/578 dead transitions. [2025-03-17 11:05:32,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 578 transitions, 3716 flow [2025-03-17 11:05:32,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:05:32,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:05:32,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1484 transitions. [2025-03-17 11:05:32,670 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8441410693970421 [2025-03-17 11:05:32,670 INFO L175 Difference]: Start difference. First operand has 311 places, 521 transitions, 2772 flow. Second operand 6 states and 1484 transitions. [2025-03-17 11:05:32,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 578 transitions, 3716 flow [2025-03-17 11:05:32,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 578 transitions, 3680 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-03-17 11:05:32,692 INFO L231 Difference]: Finished difference. Result has 321 places, 570 transitions, 3362 flow [2025-03-17 11:05:32,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=2736, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3362, PETRI_PLACES=321, PETRI_TRANSITIONS=570} [2025-03-17 11:05:32,693 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 25 predicate places. [2025-03-17 11:05:32,693 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 570 transitions, 3362 flow [2025-03-17 11:05:32,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 235.16666666666666) internal successors, (1411), 6 states have internal predecessors, (1411), 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-03-17 11:05:32,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:32,694 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:05:32,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:05:32,694 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:05:32,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:32,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1031502655, now seen corresponding path program 1 times [2025-03-17 11:05:32,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:32,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331984974] [2025-03-17 11:05:32,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:32,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:32,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-17 11:05:32,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 11:05:32,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:32,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:33,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:05:33,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:33,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331984974] [2025-03-17 11:05:33,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331984974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:33,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:33,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 11:05:33,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228696685] [2025-03-17 11:05:33,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:33,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 11:05:33,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:33,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 11:05:33,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:05:34,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 293 [2025-03-17 11:05:34,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 570 transitions, 3362 flow. Second operand has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 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-03-17 11:05:34,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:34,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 293 [2025-03-17 11:05:34,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:35,783 INFO L124 PetriNetUnfolderBase]: 1482/5034 cut-off events. [2025-03-17 11:05:35,783 INFO L125 PetriNetUnfolderBase]: For 8586/8686 co-relation queries the response was YES. [2025-03-17 11:05:35,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16029 conditions, 5034 events. 1482/5034 cut-off events. For 8586/8686 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 40032 event pairs, 100 based on Foata normal form. 47/4999 useless extension candidates. Maximal degree in co-relation 15887. Up to 955 conditions per place. [2025-03-17 11:05:35,816 INFO L140 encePairwiseOnDemand]: 260/293 looper letters, 442 selfloop transitions, 192 changer transitions 1/881 dead transitions. [2025-03-17 11:05:35,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 881 transitions, 7168 flow [2025-03-17 11:05:35,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 11:05:35,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-17 11:05:35,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4321 transitions. [2025-03-17 11:05:35,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.776181067001976 [2025-03-17 11:05:35,823 INFO L175 Difference]: Start difference. First operand has 321 places, 570 transitions, 3362 flow. Second operand 19 states and 4321 transitions. [2025-03-17 11:05:35,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 881 transitions, 7168 flow [2025-03-17 11:05:35,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 881 transitions, 6986 flow, removed 91 selfloop flow, removed 0 redundant places. [2025-03-17 11:05:35,865 INFO L231 Difference]: Finished difference. Result has 348 places, 701 transitions, 5266 flow [2025-03-17 11:05:35,866 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=3250, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=5266, PETRI_PLACES=348, PETRI_TRANSITIONS=701} [2025-03-17 11:05:35,866 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 52 predicate places. [2025-03-17 11:05:35,868 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 701 transitions, 5266 flow [2025-03-17 11:05:35,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 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-03-17 11:05:35,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:35,869 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:05:35,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:05:35,869 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:05:35,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:35,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1520156571, now seen corresponding path program 2 times [2025-03-17 11:05:35,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:35,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033435226] [2025-03-17 11:05:35,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:05:35,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:35,892 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 202 statements into 2 equivalence classes. [2025-03-17 11:05:35,906 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 201 of 202 statements. [2025-03-17 11:05:35,906 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:05:35,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:36,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:05:36,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:36,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033435226] [2025-03-17 11:05:36,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033435226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:36,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:36,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 11:05:36,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760426753] [2025-03-17 11:05:36,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:36,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 11:05:36,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:36,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 11:05:36,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:05:37,619 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 293 [2025-03-17 11:05:37,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 701 transitions, 5266 flow. Second operand has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 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-03-17 11:05:37,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:37,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 293 [2025-03-17 11:05:37,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:39,192 INFO L124 PetriNetUnfolderBase]: 2096/7171 cut-off events. [2025-03-17 11:05:39,192 INFO L125 PetriNetUnfolderBase]: For 17193/17409 co-relation queries the response was YES. [2025-03-17 11:05:39,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24436 conditions, 7171 events. 2096/7171 cut-off events. For 17193/17409 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 64837 event pairs, 173 based on Foata normal form. 84/7150 useless extension candidates. Maximal degree in co-relation 24281. Up to 1553 conditions per place. [2025-03-17 11:05:39,232 INFO L140 encePairwiseOnDemand]: 256/293 looper letters, 444 selfloop transitions, 258 changer transitions 4/952 dead transitions. [2025-03-17 11:05:39,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 952 transitions, 8766 flow [2025-03-17 11:05:39,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 11:05:39,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 11:05:39,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3289 transitions. [2025-03-17 11:05:39,237 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8018039980497318 [2025-03-17 11:05:39,237 INFO L175 Difference]: Start difference. First operand has 348 places, 701 transitions, 5266 flow. Second operand 14 states and 3289 transitions. [2025-03-17 11:05:39,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 952 transitions, 8766 flow [2025-03-17 11:05:39,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 952 transitions, 8703 flow, removed 14 selfloop flow, removed 5 redundant places. [2025-03-17 11:05:39,316 INFO L231 Difference]: Finished difference. Result has 366 places, 780 transitions, 7383 flow [2025-03-17 11:05:39,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=5225, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=7383, PETRI_PLACES=366, PETRI_TRANSITIONS=780} [2025-03-17 11:05:39,317 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 70 predicate places. [2025-03-17 11:05:39,317 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 780 transitions, 7383 flow [2025-03-17 11:05:39,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 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-03-17 11:05:39,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:39,318 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:05:39,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:05:39,318 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:05:39,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:39,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1602898347, now seen corresponding path program 3 times [2025-03-17 11:05:39,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:39,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323147720] [2025-03-17 11:05:39,320 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:05:39,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:39,351 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 202 statements into 2 equivalence classes. [2025-03-17 11:05:39,369 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 201 of 202 statements. [2025-03-17 11:05:39,369 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 11:05:39,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:39,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:05:39,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:39,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323147720] [2025-03-17 11:05:39,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323147720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:39,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:39,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 11:05:39,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496145329] [2025-03-17 11:05:39,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:39,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 11:05:39,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:39,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 11:05:39,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:05:40,811 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 293 [2025-03-17 11:05:40,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 780 transitions, 7383 flow. Second operand has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 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-03-17 11:05:40,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:40,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 293 [2025-03-17 11:05:40,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:42,286 INFO L124 PetriNetUnfolderBase]: 2160/7336 cut-off events. [2025-03-17 11:05:42,286 INFO L125 PetriNetUnfolderBase]: For 26022/26254 co-relation queries the response was YES. [2025-03-17 11:05:42,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27124 conditions, 7336 events. 2160/7336 cut-off events. For 26022/26254 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 66254 event pairs, 212 based on Foata normal form. 82/7304 useless extension candidates. Maximal degree in co-relation 26958. Up to 1395 conditions per place. [2025-03-17 11:05:42,320 INFO L140 encePairwiseOnDemand]: 268/293 looper letters, 538 selfloop transitions, 173 changer transitions 1/958 dead transitions. [2025-03-17 11:05:42,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 958 transitions, 10427 flow [2025-03-17 11:05:42,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 11:05:42,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-17 11:05:42,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4296 transitions. [2025-03-17 11:05:42,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7716903179450332 [2025-03-17 11:05:42,326 INFO L175 Difference]: Start difference. First operand has 366 places, 780 transitions, 7383 flow. Second operand 19 states and 4296 transitions. [2025-03-17 11:05:42,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 958 transitions, 10427 flow [2025-03-17 11:05:42,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 958 transitions, 10422 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 11:05:42,420 INFO L231 Difference]: Finished difference. Result has 390 places, 837 transitions, 8650 flow [2025-03-17 11:05:42,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=7378, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=780, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=623, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=8650, PETRI_PLACES=390, PETRI_TRANSITIONS=837} [2025-03-17 11:05:42,422 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 94 predicate places. [2025-03-17 11:05:42,422 INFO L471 AbstractCegarLoop]: Abstraction has has 390 places, 837 transitions, 8650 flow [2025-03-17 11:05:42,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 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-03-17 11:05:42,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:42,423 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:05:42,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:05:42,424 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:05:42,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:42,424 INFO L85 PathProgramCache]: Analyzing trace with hash -611240715, now seen corresponding path program 4 times [2025-03-17 11:05:42,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:42,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181359735] [2025-03-17 11:05:42,425 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:05:42,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:42,444 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 202 statements into 2 equivalence classes. [2025-03-17 11:05:42,461 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 186 of 202 statements. [2025-03-17 11:05:42,461 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 11:05:42,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:43,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:05:43,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:43,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181359735] [2025-03-17 11:05:43,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181359735] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:05:43,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158989009] [2025-03-17 11:05:43,078 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:05:43,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:05:43,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:05:43,080 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-03-17 11:05:43,082 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-03-17 11:05:43,226 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 202 statements into 2 equivalence classes. [2025-03-17 11:05:43,284 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 186 of 202 statements. [2025-03-17 11:05:43,284 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 11:05:43,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:43,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 11:05:43,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:05:43,334 INFO L378 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-03-17 11:05:43,406 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 11:05:43,407 INFO L378 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 19 treesize of output 16 [2025-03-17 11:05:43,467 INFO L378 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 11 treesize of output 7 [2025-03-17 11:05:43,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-17 11:05:43,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:43,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-03-17 11:05:43,547 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:05:43,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 11:05:43,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:43,569 INFO L378 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 39 treesize of output 44 [2025-03-17 11:05:43,672 INFO L378 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 43 treesize of output 32 [2025-03-17 11:05:43,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:05:43,680 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:05:43,714 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1838) c_~A~0.base) c_~A~0.offset) 0)) (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1838) c_~A~0.base) (+ c_~A~0.offset 1)) 0)) (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1838) c_~A~0.base) (+ c_~A~0.offset 3)) 0)) (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1838) c_~A~0.base) (+ c_~A~0.offset 2)) 0))) is different from false [2025-03-17 11:05:43,758 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1838) c_~A~0.base) (+ c_~A~0.offset 1)) 0)) (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1838) c_~A~0.base) c_~A~0.offset) 0)) (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1838) c_~A~0.base) (+ c_~A~0.offset 2)) 0)) (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1838) c_~A~0.base) (+ c_~A~0.offset 3)) 0))) is different from false [2025-03-17 11:05:43,911 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 3))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_1838) c_~A~0.base) (+ c_~A~0.offset 2)) 0)) (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_1838) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_1838) c_~A~0.base) (+ c_~A~0.offset 1)) 0)) (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_1838) c_~A~0.base) c_~A~0.offset) 0))))) is different from false [2025-03-17 11:05:44,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:44,301 INFO L378 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 33 treesize of output 49 [2025-03-17 11:05:44,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:44,307 INFO L378 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 60 treesize of output 34 [2025-03-17 11:05:44,317 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2025-03-17 11:05:44,317 INFO L378 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 35 treesize of output 1 [2025-03-17 11:05:44,323 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2025-03-17 11:05:44,323 INFO L378 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 35 treesize of output 1 [2025-03-17 11:05:44,328 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2025-03-17 11:05:44,329 INFO L378 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 35 treesize of output 1 [2025-03-17 11:05:44,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:05:44,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158989009] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:05:44,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:05:44,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2025-03-17 11:05:44,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618362972] [2025-03-17 11:05:44,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:05:44,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 11:05:44,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:44,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 11:05:44,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=295, Unknown=27, NotChecked=114, Total=506 [2025-03-17 11:05:44,496 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 293 [2025-03-17 11:05:44,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 837 transitions, 8650 flow. Second operand has 23 states, 23 states have (on average 182.69565217391303) internal successors, (4202), 23 states have internal predecessors, (4202), 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-03-17 11:05:44,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:44,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 293 [2025-03-17 11:05:44,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:48,614 INFO L124 PetriNetUnfolderBase]: 4644/12984 cut-off events. [2025-03-17 11:05:48,614 INFO L125 PetriNetUnfolderBase]: For 51502/51834 co-relation queries the response was YES. [2025-03-17 11:05:48,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51987 conditions, 12984 events. 4644/12984 cut-off events. For 51502/51834 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 122911 event pairs, 935 based on Foata normal form. 80/12862 useless extension candidates. Maximal degree in co-relation 51806. Up to 3057 conditions per place. [2025-03-17 11:05:48,697 INFO L140 encePairwiseOnDemand]: 256/293 looper letters, 812 selfloop transitions, 295 changer transitions 8/1286 dead transitions. [2025-03-17 11:05:48,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 1286 transitions, 14874 flow [2025-03-17 11:05:48,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 11:05:48,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-17 11:05:48,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3079 transitions. [2025-03-17 11:05:48,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7005688282138794 [2025-03-17 11:05:48,701 INFO L175 Difference]: Start difference. First operand has 390 places, 837 transitions, 8650 flow. Second operand 15 states and 3079 transitions. [2025-03-17 11:05:48,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 1286 transitions, 14874 flow [2025-03-17 11:05:48,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 1286 transitions, 14743 flow, removed 33 selfloop flow, removed 9 redundant places. [2025-03-17 11:05:48,917 INFO L231 Difference]: Finished difference. Result has 406 places, 923 transitions, 11320 flow [2025-03-17 11:05:48,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=8554, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=837, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=210, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=11320, PETRI_PLACES=406, PETRI_TRANSITIONS=923} [2025-03-17 11:05:48,918 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 110 predicate places. [2025-03-17 11:05:48,918 INFO L471 AbstractCegarLoop]: Abstraction has has 406 places, 923 transitions, 11320 flow [2025-03-17 11:05:48,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 182.69565217391303) internal successors, (4202), 23 states have internal predecessors, (4202), 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-03-17 11:05:48,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:48,919 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:05:48,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 11:05:49,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 11:05:49,120 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:05:49,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:49,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1732779138, now seen corresponding path program 1 times [2025-03-17 11:05:49,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:49,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169380484] [2025-03-17 11:05:49,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:49,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:49,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-17 11:05:49,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 11:05:49,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:49,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:49,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:05:49,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:49,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169380484] [2025-03-17 11:05:49,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169380484] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:05:49,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412309033] [2025-03-17 11:05:49,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:49,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:05:49,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:05:49,952 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-03-17 11:05:49,953 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-03-17 11:05:50,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-17 11:05:50,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 11:05:50,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:50,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:50,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 11:05:50,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:05:50,165 INFO L378 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-03-17 11:05:50,233 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 11:05:50,233 INFO L378 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 19 treesize of output 16 [2025-03-17 11:05:50,289 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:05:50,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 11:05:50,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:05:50,359 INFO L378 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-03-17 11:05:50,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:50,387 INFO L378 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-03-17 11:05:50,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:50,421 INFO L378 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-03-17 11:05:50,462 INFO L378 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-03-17 11:05:50,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:05:50,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:05:50,480 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2144 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_2144) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 6)) |c_t_funThread1of1ForFork0_init_#t~nondet3#1|)) (forall ((v_ArrVal_2144 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_2144) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 5)) |c_t_funThread1of1ForFork0_init_#t~nondet3#1|)) (forall ((v_ArrVal_2144 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet3#1| (select (select (store |c_#race| c_~A~0.base v_ArrVal_2144) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 7)))) (forall ((v_ArrVal_2144 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet3#1| (select (select (store |c_#race| c_~A~0.base v_ArrVal_2144) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 4))))) is different from false [2025-03-17 11:05:50,493 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 7))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1 |c_t_funThread1of1ForFork0_init_#t~nondet3#1|)))) (and (forall ((v_ArrVal_2144 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_2144) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 4)) |c_t_funThread1of1ForFork0_init_#t~nondet3#1|)) (forall ((v_ArrVal_2144 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_2144) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 5)) |c_t_funThread1of1ForFork0_init_#t~nondet3#1|)) (forall ((v_ArrVal_2144 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_2144) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 6)) |c_t_funThread1of1ForFork0_init_#t~nondet3#1|)) (forall ((v_ArrVal_2144 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_2144) |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1) |c_t_funThread1of1ForFork0_init_#t~nondet3#1|))))) is different from false [2025-03-17 11:05:54,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:54,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53 [2025-03-17 11:05:54,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:54,330 INFO L378 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 86 treesize of output 32 [2025-03-17 11:05:54,335 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-17 11:05:54,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-03-17 11:05:54,342 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-17 11:05:54,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-03-17 11:05:54,347 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-17 11:05:54,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-03-17 11:05:54,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:05:54,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412309033] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:05:54,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:05:54,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2025-03-17 11:05:54,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528440989] [2025-03-17 11:05:54,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:05:54,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-17 11:05:54,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:54,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-17 11:05:54,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=588, Unknown=33, NotChecked=102, Total=812 [2025-03-17 11:05:54,550 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 293 [2025-03-17 11:05:54,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 923 transitions, 11320 flow. Second operand has 29 states, 29 states have (on average 181.17241379310346) internal successors, (5254), 29 states have internal predecessors, (5254), 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-03-17 11:05:54,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:54,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 293 [2025-03-17 11:05:54,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:58,406 INFO L124 PetriNetUnfolderBase]: 4794/13342 cut-off events. [2025-03-17 11:05:58,407 INFO L125 PetriNetUnfolderBase]: For 68836/69114 co-relation queries the response was YES. [2025-03-17 11:05:58,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55817 conditions, 13342 events. 4794/13342 cut-off events. For 68836/69114 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 126559 event pairs, 977 based on Foata normal form. 83/13211 useless extension candidates. Maximal degree in co-relation 55625. Up to 4690 conditions per place. [2025-03-17 11:05:58,511 INFO L140 encePairwiseOnDemand]: 271/293 looper letters, 782 selfloop transitions, 174 changer transitions 0/1124 dead transitions. [2025-03-17 11:05:58,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 1124 transitions, 15696 flow [2025-03-17 11:05:58,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 11:05:58,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-17 11:05:58,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2893 transitions. [2025-03-17 11:05:58,520 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6582480091012515 [2025-03-17 11:05:58,520 INFO L175 Difference]: Start difference. First operand has 406 places, 923 transitions, 11320 flow. Second operand 15 states and 2893 transitions. [2025-03-17 11:05:58,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 1124 transitions, 15696 flow [2025-03-17 11:05:58,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 1124 transitions, 15645 flow, removed 23 selfloop flow, removed 3 redundant places. [2025-03-17 11:05:58,799 INFO L231 Difference]: Finished difference. Result has 422 places, 938 transitions, 12105 flow [2025-03-17 11:05:58,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=11289, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=923, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=752, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=12105, PETRI_PLACES=422, PETRI_TRANSITIONS=938} [2025-03-17 11:05:58,800 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 126 predicate places. [2025-03-17 11:05:58,800 INFO L471 AbstractCegarLoop]: Abstraction has has 422 places, 938 transitions, 12105 flow [2025-03-17 11:05:58,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 181.17241379310346) internal successors, (5254), 29 states have internal predecessors, (5254), 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-03-17 11:05:58,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:58,802 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 11:05:58,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 11:05:59,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 11:05:59,003 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:05:59,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:59,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1958113013, now seen corresponding path program 5 times [2025-03-17 11:05:59,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:59,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468655906] [2025-03-17 11:05:59,005 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:05:59,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:59,030 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 202 statements into 2 equivalence classes. [2025-03-17 11:05:59,048 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 11:05:59,048 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:05:59,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:59,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:05:59,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:59,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468655906] [2025-03-17 11:05:59,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468655906] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:05:59,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135836171] [2025-03-17 11:05:59,868 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:05:59,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:05:59,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:05:59,870 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-03-17 11:05:59,871 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-03-17 11:06:00,024 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 202 statements into 2 equivalence classes. [2025-03-17 11:06:00,088 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 11:06:00,089 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:06:00,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:00,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 11:06:00,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:06:00,104 INFO L378 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-03-17 11:06:00,152 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 11:06:00,153 INFO L378 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-03-17 11:06:00,194 INFO L378 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 11 treesize of output 7 [2025-03-17 11:06:00,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-17 11:06:00,221 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:06:00,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 11:06:00,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:06:00,230 INFO L378 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 30 treesize of output 32 [2025-03-17 11:06:00,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:06:00,243 INFO L378 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 39 treesize of output 44 [2025-03-17 11:06:00,322 INFO L378 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 43 treesize of output 32 [2025-03-17 11:06:00,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:06:00,330 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:06:00,345 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2448 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_2448) c_~A~0.base) c_~A~0.offset) 0)) (forall ((v_ArrVal_2448 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_2448) c_~A~0.base) (+ c_~A~0.offset 2)) 0)) (forall ((v_ArrVal_2448 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_2448) c_~A~0.base) (+ c_~A~0.offset 3)) 0)) (forall ((v_ArrVal_2448 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_2448) c_~A~0.base) (+ c_~A~0.offset 1)) 0))) is different from false [2025-03-17 11:06:00,371 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2448 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_2448) c_~A~0.base) (+ c_~A~0.offset 2)) 0)) (forall ((v_ArrVal_2448 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_2448) c_~A~0.base) c_~A~0.offset) 0)) (forall ((v_ArrVal_2448 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_2448) c_~A~0.base) (+ c_~A~0.offset 3)) 0)) (forall ((v_ArrVal_2448 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_2448) c_~A~0.base) (+ c_~A~0.offset 1)) 0))) is different from false [2025-03-17 11:06:00,388 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2448 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2448) c_~A~0.base) (+ c_~A~0.offset 2)) 0)) (forall ((v_ArrVal_2448 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2448) c_~A~0.base) c_~A~0.offset) 0)) (forall ((v_ArrVal_2448 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2448) c_~A~0.base) (+ c_~A~0.offset 3)) 0)) (forall ((v_ArrVal_2448 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2448) c_~A~0.base) (+ c_~A~0.offset 1)) 0))) is different from false [2025-03-17 11:06:00,402 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2448 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_2448) c_~A~0.base) (+ c_~A~0.offset 3)) 0)) (forall ((v_ArrVal_2448 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_2448) c_~A~0.base) (+ c_~A~0.offset 2)) 0)) (forall ((v_ArrVal_2448 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_2448) c_~A~0.base) (+ c_~A~0.offset 1)) 0)) (forall ((v_ArrVal_2448 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_2448) c_~A~0.base) c_~A~0.offset) 0))) is different from false [2025-03-17 11:06:00,416 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 3))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_2448 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_2448) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_2448 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_2448) c_~A~0.base) (+ c_~A~0.offset 2)) 0)) (forall ((v_ArrVal_2448 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_2448) c_~A~0.base) (+ c_~A~0.offset 1)) 0)) (forall ((v_ArrVal_2448 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_2448) c_~A~0.base) c_~A~0.offset) 0))))) is different from false [2025-03-17 11:06:00,425 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 2)) (.cse2 (+ c_~A~0.offset 3))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (select |c_#race| c_~A~0.base) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_2448 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_2448) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_2448 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_2448) c_~A~0.base) c_~A~0.offset) 0)) (forall ((v_ArrVal_2448 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_2448) c_~A~0.base) (+ c_~A~0.offset 1)) 0)) (forall ((v_ArrVal_2448 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_2448) c_~A~0.base) .cse2) 0))))) is different from false [2025-03-17 11:06:00,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:06:00,596 INFO L378 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 35 treesize of output 51 [2025-03-17 11:06:00,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:06:00,599 INFO L378 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 64 treesize of output 36 [2025-03-17 11:06:00,604 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2025-03-17 11:06:00,604 INFO L378 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 33 treesize of output 1 [2025-03-17 11:06:00,609 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2025-03-17 11:06:00,609 INFO L378 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 35 treesize of output 1 [2025-03-17 11:06:00,615 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2025-03-17 11:06:00,615 INFO L378 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 35 treesize of output 1 [2025-03-17 11:06:06,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2025-03-17 11:06:06,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135836171] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:06:06,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:06:06,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2025-03-17 11:06:06,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36454385] [2025-03-17 11:06:06,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:06:06,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 11:06:06,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:06,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 11:06:06,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=227, Unknown=7, NotChecked=210, Total=506 [2025-03-17 11:06:06,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 293 [2025-03-17 11:06:06,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 938 transitions, 12105 flow. Second operand has 23 states, 23 states have (on average 182.69565217391303) internal successors, (4202), 23 states have internal predecessors, (4202), 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-03-17 11:06:06,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:06,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 293 [2025-03-17 11:06:06,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:11,057 INFO L124 PetriNetUnfolderBase]: 6685/18758 cut-off events. [2025-03-17 11:06:11,057 INFO L125 PetriNetUnfolderBase]: For 107131/107647 co-relation queries the response was YES. [2025-03-17 11:06:11,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81952 conditions, 18758 events. 6685/18758 cut-off events. For 107131/107647 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 194088 event pairs, 1444 based on Foata normal form. 139/18617 useless extension candidates. Maximal degree in co-relation 81753. Up to 6001 conditions per place. [2025-03-17 11:06:11,225 INFO L140 encePairwiseOnDemand]: 257/293 looper letters, 771 selfloop transitions, 449 changer transitions 6/1398 dead transitions. [2025-03-17 11:06:11,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 1398 transitions, 19978 flow [2025-03-17 11:06:11,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 11:06:11,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-17 11:06:11,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3027 transitions. [2025-03-17 11:06:11,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6887372013651877 [2025-03-17 11:06:11,227 INFO L175 Difference]: Start difference. First operand has 422 places, 938 transitions, 12105 flow. Second operand 15 states and 3027 transitions. [2025-03-17 11:06:11,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 1398 transitions, 19978 flow [2025-03-17 11:06:11,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 427 places, 1398 transitions, 19781 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-03-17 11:06:11,666 INFO L231 Difference]: Finished difference. Result has 437 places, 1075 transitions, 16735 flow [2025-03-17 11:06:11,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=11993, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=938, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=320, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=16735, PETRI_PLACES=437, PETRI_TRANSITIONS=1075} [2025-03-17 11:06:11,667 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 141 predicate places. [2025-03-17 11:06:11,667 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 1075 transitions, 16735 flow [2025-03-17 11:06:11,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 182.69565217391303) internal successors, (4202), 23 states have internal predecessors, (4202), 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-03-17 11:06:11,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:11,668 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:06:11,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 11:06:11,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:06:11,869 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:06:11,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:11,870 INFO L85 PathProgramCache]: Analyzing trace with hash -601095991, now seen corresponding path program 6 times [2025-03-17 11:06:11,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:11,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935642564] [2025-03-17 11:06:11,870 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 11:06:11,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:11,891 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 202 statements into 2 equivalence classes. [2025-03-17 11:06:11,913 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 11:06:11,914 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-17 11:06:11,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:12,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:06:12,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:12,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935642564] [2025-03-17 11:06:12,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935642564] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:06:12,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089901124] [2025-03-17 11:06:12,604 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 11:06:12,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:06:12,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:06:12,606 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:06:12,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 11:06:12,746 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 202 statements into 2 equivalence classes. [2025-03-17 11:06:14,166 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 11:06:14,166 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-17 11:06:14,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:14,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 11:06:14,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:06:14,177 INFO L378 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-03-17 11:06:14,223 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 11:06:14,223 INFO L378 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-03-17 11:06:14,266 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:06:14,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 11:06:14,277 INFO L378 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-03-17 11:06:14,282 INFO L378 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 21 treesize of output 20 [2025-03-17 11:06:14,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:06:14,292 INFO L378 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 30 treesize of output 32 [2025-03-17 11:06:14,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:06:14,301 INFO L378 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 39 treesize of output 44 [2025-03-17 11:06:14,337 INFO L378 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 43 treesize of output 32 [2025-03-17 11:06:14,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:06:14,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:06:16,233 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 3))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_2752 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_2752) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_2752 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_2752) c_~A~0.base) (+ c_~A~0.offset 1)) 0)) (forall ((v_ArrVal_2752 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_2752) c_~A~0.base) (+ c_~A~0.offset 2)) 0)) (forall ((v_ArrVal_2752 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_2752) c_~A~0.base) c_~A~0.offset) 0))))) is different from false [2025-03-17 11:06:16,242 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 2)) (.cse2 (+ c_~A~0.offset 3))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (select |c_#race| c_~A~0.base) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_2752 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_2752) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_2752 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_2752) c_~A~0.base) .cse2) 0)) (forall ((v_ArrVal_2752 (Array Int Int))) (= 0 (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_2752) c_~A~0.base) (+ c_~A~0.offset 1)))) (forall ((v_ArrVal_2752 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_2752) c_~A~0.base) c_~A~0.offset) 0))))) is different from false [2025-03-17 11:06:21,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:06:21,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089901124] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:06:21,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:06:21,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 18 [2025-03-17 11:06:21,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913826351] [2025-03-17 11:06:21,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:06:21,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 11:06:21,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:21,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 11:06:21,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=215, Unknown=14, NotChecked=62, Total=342 [2025-03-17 11:06:21,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 293 [2025-03-17 11:06:21,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 1075 transitions, 16735 flow. Second operand has 19 states, 19 states have (on average 183.42105263157896) internal successors, (3485), 19 states have internal predecessors, (3485), 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-03-17 11:06:21,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:21,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 293 [2025-03-17 11:06:21,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:27,588 INFO L124 PetriNetUnfolderBase]: 7232/20325 cut-off events. [2025-03-17 11:06:27,588 INFO L125 PetriNetUnfolderBase]: For 145647/146178 co-relation queries the response was YES. [2025-03-17 11:06:27,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92291 conditions, 20325 events. 7232/20325 cut-off events. For 145647/146178 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 213788 event pairs, 1215 based on Foata normal form. 136/20157 useless extension candidates. Maximal degree in co-relation 92083. Up to 4009 conditions per place. [2025-03-17 11:06:27,822 INFO L140 encePairwiseOnDemand]: 260/293 looper letters, 751 selfloop transitions, 501 changer transitions 2/1426 dead transitions. [2025-03-17 11:06:27,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 1426 transitions, 23665 flow [2025-03-17 11:06:27,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 11:06:27,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-17 11:06:27,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3516 transitions. [2025-03-17 11:06:27,826 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-17 11:06:27,826 INFO L175 Difference]: Start difference. First operand has 437 places, 1075 transitions, 16735 flow. Second operand 18 states and 3516 transitions. [2025-03-17 11:06:27,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 1426 transitions, 23665 flow [2025-03-17 11:06:28,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 1426 transitions, 23578 flow, removed 41 selfloop flow, removed 3 redundant places. [2025-03-17 11:06:28,476 INFO L231 Difference]: Finished difference. Result has 459 places, 1147 transitions, 20449 flow [2025-03-17 11:06:28,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=16670, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1075, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=429, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=20449, PETRI_PLACES=459, PETRI_TRANSITIONS=1147} [2025-03-17 11:06:28,478 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 163 predicate places. [2025-03-17 11:06:28,478 INFO L471 AbstractCegarLoop]: Abstraction has has 459 places, 1147 transitions, 20449 flow [2025-03-17 11:06:28,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 183.42105263157896) internal successors, (3485), 19 states have internal predecessors, (3485), 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-03-17 11:06:28,479 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:28,479 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:06:28,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 11:06:28,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 11:06:28,680 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:06:28,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:28,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1647023749, now seen corresponding path program 7 times [2025-03-17 11:06:28,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:28,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529832153] [2025-03-17 11:06:28,681 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 11:06:28,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:28,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-17 11:06:28,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 11:06:28,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:28,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:29,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:06:29,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:29,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529832153] [2025-03-17 11:06:29,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529832153] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:06:29,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404864398] [2025-03-17 11:06:29,520 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 11:06:29,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:06:29,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:06:29,522 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:06:29,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 11:06:29,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-17 11:06:29,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 11:06:29,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:29,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:29,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 11:06:29,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:06:29,743 INFO L378 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-03-17 11:06:29,799 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 11:06:29,799 INFO L378 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 19 treesize of output 16 [2025-03-17 11:06:29,846 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:06:29,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 11:06:29,852 INFO L378 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-03-17 11:06:29,858 INFO L378 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 21 treesize of output 20 [2025-03-17 11:06:29,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:06:29,867 INFO L378 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 30 treesize of output 32 [2025-03-17 11:06:29,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:06:29,879 INFO L378 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 39 treesize of output 44 [2025-03-17 11:06:29,934 INFO L378 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 43 treesize of output 32 [2025-03-17 11:06:29,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:06:29,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:06:32,075 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 3))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_3056 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_3056) c_~A~0.base) (+ c_~A~0.offset 1)) 0)) (forall ((v_ArrVal_3056 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_3056) c_~A~0.base) c_~A~0.offset) 0)) (forall ((v_ArrVal_3056 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_3056) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_3056 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_3056) c_~A~0.base) (+ c_~A~0.offset 2)) 0))))) is different from false [2025-03-17 11:06:32,086 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset 2)) (.cse1 (+ c_~A~0.offset 3))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (select |c_#race| c_~A~0.base) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_3056 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_3056) c_~A~0.base) c_~A~0.offset) 0)) (forall ((v_ArrVal_3056 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_3056) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_3056 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_3056) c_~A~0.base) .cse2) 0)) (forall ((v_ArrVal_3056 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_3056) c_~A~0.base) (+ c_~A~0.offset 1)) 0))))) is different from false [2025-03-17 11:06:38,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:06:38,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404864398] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:06:38,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:06:38,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 19 [2025-03-17 11:06:38,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778662656] [2025-03-17 11:06:38,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:06:38,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 11:06:38,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:38,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 11:06:38,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=235, Unknown=24, NotChecked=66, Total=380 [2025-03-17 11:06:38,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 293 [2025-03-17 11:06:38,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 1147 transitions, 20449 flow. Second operand has 20 states, 20 states have (on average 183.25) internal successors, (3665), 20 states have internal predecessors, (3665), 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-03-17 11:06:38,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:38,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 293 [2025-03-17 11:06:38,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:47,107 INFO L124 PetriNetUnfolderBase]: 9453/26315 cut-off events. [2025-03-17 11:06:47,107 INFO L125 PetriNetUnfolderBase]: For 213003/213670 co-relation queries the response was YES. [2025-03-17 11:06:47,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122512 conditions, 26315 events. 9453/26315 cut-off events. For 213003/213670 co-relation queries the response was YES. Maximal size of possible extension queue 834. Compared 293604 event pairs, 1914 based on Foata normal form. 157/26078 useless extension candidates. Maximal degree in co-relation 122295. Up to 8251 conditions per place. [2025-03-17 11:06:47,364 INFO L140 encePairwiseOnDemand]: 256/293 looper letters, 840 selfloop transitions, 605 changer transitions 8/1625 dead transitions. [2025-03-17 11:06:47,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 1625 transitions, 29861 flow [2025-03-17 11:06:47,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 11:06:47,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-17 11:06:47,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3964 transitions. [2025-03-17 11:06:47,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6764505119453925 [2025-03-17 11:06:47,369 INFO L175 Difference]: Start difference. First operand has 459 places, 1147 transitions, 20449 flow. Second operand 20 states and 3964 transitions. [2025-03-17 11:06:47,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 478 places, 1625 transitions, 29861 flow [2025-03-17 11:06:48,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 469 places, 1625 transitions, 29786 flow, removed 2 selfloop flow, removed 9 redundant places. [2025-03-17 11:06:48,405 INFO L231 Difference]: Finished difference. Result has 480 places, 1273 transitions, 26301 flow [2025-03-17 11:06:48,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=20380, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=479, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=26301, PETRI_PLACES=480, PETRI_TRANSITIONS=1273} [2025-03-17 11:06:48,406 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 184 predicate places. [2025-03-17 11:06:48,406 INFO L471 AbstractCegarLoop]: Abstraction has has 480 places, 1273 transitions, 26301 flow [2025-03-17 11:06:48,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 183.25) internal successors, (3665), 20 states have internal predecessors, (3665), 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-03-17 11:06:48,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:48,407 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:06:48,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 11:06:48,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:06:48,608 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:06:48,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:48,609 INFO L85 PathProgramCache]: Analyzing trace with hash 128380293, now seen corresponding path program 8 times [2025-03-17 11:06:48,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:48,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095223864] [2025-03-17 11:06:48,609 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:06:48,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:48,631 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 202 statements into 2 equivalence classes. [2025-03-17 11:06:48,649 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 11:06:48,649 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:06:48,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:49,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:06:49,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:49,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095223864] [2025-03-17 11:06:49,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095223864] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:06:49,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637508514] [2025-03-17 11:06:49,548 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:06:49,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:06:49,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:06:49,549 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:06:49,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 11:06:49,704 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 202 statements into 2 equivalence classes. [2025-03-17 11:06:50,213 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 11:06:50,213 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:06:50,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:50,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 11:06:50,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:06:50,332 INFO L378 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 11 treesize of output 7 [2025-03-17 11:06:50,347 INFO L378 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 21 treesize of output 20 [2025-03-17 11:06:50,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:06:50,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-03-17 11:06:50,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:06:50,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-03-17 11:06:50,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:06:50,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:06:50,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:06:50,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:06:50,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:06:50,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 47 [2025-03-17 11:06:50,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:06:50,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:06:51,423 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:06:51,431 INFO L173 IndexEqualityManager]: detected equality via solver