./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_18-nested_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 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_18-nested_rc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf117fc0bf8ae8b9ef4bb89156c7168763fcd2ba3d8567cd686924f85ad04dca --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:17:17,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:17:17,607 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:17:17,610 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:17:17,611 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:17:17,630 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:17:17,631 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:17:17,631 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:17:17,632 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:17:17,632 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:17:17,633 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:17:17,633 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:17:17,633 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:17:17,633 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:17:17,633 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:17:17,633 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:17:17,633 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:17:17,634 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:17:17,634 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:17:17,634 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:17:17,634 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:17:17,634 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:17:17,634 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:17:17,634 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:17:17,634 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:17:17,634 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:17:17,635 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:17:17,635 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:17:17,635 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:17:17,635 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:17:17,635 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:17:17,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:17:17,635 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:17:17,635 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:17:17,635 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:17:17,635 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:17:17,635 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:17:17,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:17:17,636 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:17:17,636 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:17:17,636 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:17:17,636 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:17:17,636 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 -> bf117fc0bf8ae8b9ef4bb89156c7168763fcd2ba3d8567cd686924f85ad04dca [2025-03-13 22:17:17,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:17:17,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:17:17,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:17:17,859 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:17:17,859 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:17:17,861 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_18-nested_rc.i [2025-03-13 22:17:18,998 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b2e9359f/92aa4c82b3544743bb52aab488b80ca1/FLAGa744321e5 [2025-03-13 22:17:19,285 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:17:19,285 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_18-nested_rc.i [2025-03-13 22:17:19,304 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b2e9359f/92aa4c82b3544743bb52aab488b80ca1/FLAGa744321e5 [2025-03-13 22:17:19,319 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b2e9359f/92aa4c82b3544743bb52aab488b80ca1 [2025-03-13 22:17:19,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:17:19,323 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:17:19,324 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:17:19,325 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:17:19,328 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:17:19,328 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:17:19" (1/1) ... [2025-03-13 22:17:19,329 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a1a7767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:19, skipping insertion in model container [2025-03-13 22:17:19,330 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:17:19" (1/1) ... [2025-03-13 22:17:19,368 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:17:19,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:17:19,731 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:17:19,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:17:19,838 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:17:19,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:19 WrapperNode [2025-03-13 22:17:19,840 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:17:19,840 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:17:19,841 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:17:19,841 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:17:19,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:19" (1/1) ... [2025-03-13 22:17:19,858 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:19" (1/1) ... [2025-03-13 22:17:19,885 INFO L138 Inliner]: procedures = 372, calls = 87, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 286 [2025-03-13 22:17:19,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:17:19,888 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:17:19,888 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:17:19,888 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:17:19,893 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:19" (1/1) ... [2025-03-13 22:17:19,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:19" (1/1) ... [2025-03-13 22:17:19,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:19" (1/1) ... [2025-03-13 22:17:19,898 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:19" (1/1) ... [2025-03-13 22:17:19,909 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:19" (1/1) ... [2025-03-13 22:17:19,911 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:19" (1/1) ... [2025-03-13 22:17:19,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:19" (1/1) ... [2025-03-13 22:17:19,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:19" (1/1) ... [2025-03-13 22:17:19,924 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:17:19,925 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:17:19,925 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:17:19,925 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:17:19,926 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:19" (1/1) ... [2025-03-13 22:17:19,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:17:19,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:17:19,951 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-13 22:17:19,953 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-13 22:17:19,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-13 22:17:19,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-13 22:17:19,969 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 22:17:19,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:17:19,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:17:19,969 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 22:17:19,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:17:19,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:17:19,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-13 22:17:19,969 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-13 22:17:19,969 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-13 22:17:19,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:17:19,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:17:19,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:17:19,970 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:17:20,086 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:17:20,089 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:17:20,608 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:17:20,609 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:17:20,610 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:17:20,639 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:17:20,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:17:20 BoogieIcfgContainer [2025-03-13 22:17:20,639 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:17:20,641 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:17:20,641 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:17:20,644 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:17:20,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:17:19" (1/3) ... [2025-03-13 22:17:20,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328f954f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:17:20, skipping insertion in model container [2025-03-13 22:17:20,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:19" (2/3) ... [2025-03-13 22:17:20,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328f954f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:17:20, skipping insertion in model container [2025-03-13 22:17:20,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:17:20" (3/3) ... [2025-03-13 22:17:20,646 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_18-nested_rc.i [2025-03-13 22:17:20,657 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:17:20,659 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_18-nested_rc.i that has 2 procedures, 328 locations, 1 initial locations, 1 loop locations, and 18 error locations. [2025-03-13 22:17:20,659 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:17:20,728 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:17:20,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 331 places, 330 transitions, 664 flow [2025-03-13 22:17:20,863 INFO L124 PetriNetUnfolderBase]: 3/329 cut-off events. [2025-03-13 22:17:20,865 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:17:20,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 329 events. 3/329 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 129 event pairs, 0 based on Foata normal form. 0/308 useless extension candidates. Maximal degree in co-relation 201. Up to 2 conditions per place. [2025-03-13 22:17:20,871 INFO L82 GeneralOperation]: Start removeDead. Operand has 331 places, 330 transitions, 664 flow [2025-03-13 22:17:20,876 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 330 places, 329 transitions, 661 flow [2025-03-13 22:17:20,883 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:17:20,894 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;@76f79746, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:17:20,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-03-13 22:17:20,912 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:17:20,913 INFO L124 PetriNetUnfolderBase]: 2/102 cut-off events. [2025-03-13 22:17:20,913 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:17:20,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:20,914 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-13 22:17:20,914 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:20,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:20,919 INFO L85 PathProgramCache]: Analyzing trace with hash 537805159, now seen corresponding path program 1 times [2025-03-13 22:17:20,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:20,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103542692] [2025-03-13 22:17:20,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:20,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:21,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-13 22:17:21,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-13 22:17:21,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:21,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:21,250 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-13 22:17:21,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:21,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103542692] [2025-03-13 22:17:21,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103542692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:21,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:21,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:17:21,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602066773] [2025-03-13 22:17:21,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:21,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:17:21,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:21,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:17:21,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:17:21,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 330 [2025-03-13 22:17:21,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 329 transitions, 661 flow. Second operand has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 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-13 22:17:21,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:21,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 330 [2025-03-13 22:17:21,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:21,371 INFO L124 PetriNetUnfolderBase]: 7/407 cut-off events. [2025-03-13 22:17:21,372 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:17:21,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 407 events. 7/407 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 418 event pairs, 6 based on Foata normal form. 5/382 useless extension candidates. Maximal degree in co-relation 219. Up to 24 conditions per place. [2025-03-13 22:17:21,376 INFO L140 encePairwiseOnDemand]: 325/330 looper letters, 10 selfloop transitions, 2 changer transitions 1/328 dead transitions. [2025-03-13 22:17:21,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 328 transitions, 683 flow [2025-03-13 22:17:21,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:17:21,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:17:21,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 966 transitions. [2025-03-13 22:17:21,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9757575757575757 [2025-03-13 22:17:21,394 INFO L175 Difference]: Start difference. First operand has 330 places, 329 transitions, 661 flow. Second operand 3 states and 966 transitions. [2025-03-13 22:17:21,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 328 transitions, 683 flow [2025-03-13 22:17:21,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 328 transitions, 682 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:17:21,407 INFO L231 Difference]: Finished difference. Result has 332 places, 327 transitions, 666 flow [2025-03-13 22:17:21,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=666, PETRI_PLACES=332, PETRI_TRANSITIONS=327} [2025-03-13 22:17:21,412 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 2 predicate places. [2025-03-13 22:17:21,414 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 327 transitions, 666 flow [2025-03-13 22:17:21,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 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-13 22:17:21,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:21,415 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:17:21,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:17:21,415 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:21,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:21,417 INFO L85 PathProgramCache]: Analyzing trace with hash -795116495, now seen corresponding path program 1 times [2025-03-13 22:17:21,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:21,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077339252] [2025-03-13 22:17:21,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:21,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:21,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-13 22:17:21,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-13 22:17:21,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:21,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:21,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:17:21,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:21,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077339252] [2025-03-13 22:17:21,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077339252] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:17:21,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546944126] [2025-03-13 22:17:21,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:21,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:17:21,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:17:21,617 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-13 22:17:21,618 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-13 22:17:21,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-13 22:17:21,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-13 22:17:21,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:21,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:21,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 22:17:21,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:17:21,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:17:21,745 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:17:21,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:17:21,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546944126] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:17:21,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:17:21,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-13 22:17:21,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401159733] [2025-03-13 22:17:21,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:17:21,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 22:17:21,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:21,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 22:17:21,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-13 22:17:21,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 330 [2025-03-13 22:17:21,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 327 transitions, 666 flow. Second operand has 10 states, 10 states have (on average 315.8) internal successors, (3158), 10 states have internal predecessors, (3158), 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-13 22:17:21,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:21,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 330 [2025-03-13 22:17:21,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:21,944 INFO L124 PetriNetUnfolderBase]: 7/413 cut-off events. [2025-03-13 22:17:21,944 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:17:21,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 413 events. 7/413 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 413 event pairs, 6 based on Foata normal form. 2/386 useless extension candidates. Maximal degree in co-relation 377. Up to 24 conditions per place. [2025-03-13 22:17:21,947 INFO L140 encePairwiseOnDemand]: 324/330 looper letters, 14 selfloop transitions, 9 changer transitions 0/335 dead transitions. [2025-03-13 22:17:21,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 335 transitions, 730 flow [2025-03-13 22:17:21,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:17:21,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:17:21,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2851 transitions. [2025-03-13 22:17:21,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.95993265993266 [2025-03-13 22:17:21,956 INFO L175 Difference]: Start difference. First operand has 332 places, 327 transitions, 666 flow. Second operand 9 states and 2851 transitions. [2025-03-13 22:17:21,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 335 transitions, 730 flow [2025-03-13 22:17:21,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 335 transitions, 728 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:17:21,963 INFO L231 Difference]: Finished difference. Result has 341 places, 333 transitions, 714 flow [2025-03-13 22:17:21,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=714, PETRI_PLACES=341, PETRI_TRANSITIONS=333} [2025-03-13 22:17:21,964 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 11 predicate places. [2025-03-13 22:17:21,964 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 333 transitions, 714 flow [2025-03-13 22:17:21,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 315.8) internal successors, (3158), 10 states have internal predecessors, (3158), 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-13 22:17:21,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:21,966 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:17:21,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-13 22:17:22,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:17:22,168 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:22,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:22,169 INFO L85 PathProgramCache]: Analyzing trace with hash 859256305, now seen corresponding path program 2 times [2025-03-13 22:17:22,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:22,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508931051] [2025-03-13 22:17:22,169 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:17:22,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:22,187 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 110 statements into 2 equivalence classes. [2025-03-13 22:17:22,205 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 95 of 110 statements. [2025-03-13 22:17:22,205 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:17:22,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:22,702 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-13 22:17:22,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:22,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508931051] [2025-03-13 22:17:22,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508931051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:22,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:22,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:22,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814999492] [2025-03-13 22:17:22,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:22,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:22,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:22,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:22,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:23,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 330 [2025-03-13 22:17:23,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 333 transitions, 714 flow. Second operand has 6 states, 6 states have (on average 246.33333333333334) internal successors, (1478), 6 states have internal predecessors, (1478), 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-13 22:17:23,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:23,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 330 [2025-03-13 22:17:23,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:23,458 INFO L124 PetriNetUnfolderBase]: 365/1697 cut-off events. [2025-03-13 22:17:23,458 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-13 22:17:23,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2539 conditions, 1697 events. 365/1697 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9289 event pairs, 364 based on Foata normal form. 0/1572 useless extension candidates. Maximal degree in co-relation 2428. Up to 800 conditions per place. [2025-03-13 22:17:23,465 INFO L140 encePairwiseOnDemand]: 318/330 looper letters, 71 selfloop transitions, 10 changer transitions 0/331 dead transitions. [2025-03-13 22:17:23,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 331 transitions, 872 flow [2025-03-13 22:17:23,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:23,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:23,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1553 transitions. [2025-03-13 22:17:23,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7843434343434343 [2025-03-13 22:17:23,468 INFO L175 Difference]: Start difference. First operand has 341 places, 333 transitions, 714 flow. Second operand 6 states and 1553 transitions. [2025-03-13 22:17:23,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 331 transitions, 872 flow [2025-03-13 22:17:23,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 331 transitions, 866 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-13 22:17:23,473 INFO L231 Difference]: Finished difference. Result has 343 places, 331 transitions, 724 flow [2025-03-13 22:17:23,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=724, PETRI_PLACES=343, PETRI_TRANSITIONS=331} [2025-03-13 22:17:23,474 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 13 predicate places. [2025-03-13 22:17:23,474 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 331 transitions, 724 flow [2025-03-13 22:17:23,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 246.33333333333334) internal successors, (1478), 6 states have internal predecessors, (1478), 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-13 22:17:23,475 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:23,475 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:17:23,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:17:23,476 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:23,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:23,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1652349966, now seen corresponding path program 1 times [2025-03-13 22:17:23,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:23,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044415835] [2025-03-13 22:17:23,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:23,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:23,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-13 22:17:23,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-13 22:17:23,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:23,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:23,612 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:17:23,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:23,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044415835] [2025-03-13 22:17:23,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044415835] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:17:23,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27412524] [2025-03-13 22:17:23,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:23,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:17:23,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:17:23,615 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-13 22:17:23,616 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-13 22:17:23,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-13 22:17:23,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-13 22:17:23,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:23,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:23,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 22:17:23,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:17:23,764 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:17:23,765 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:17:23,867 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:17:23,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27412524] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:17:23,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:17:23,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-13 22:17:23,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198222934] [2025-03-13 22:17:23,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:17:23,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-13 22:17:23,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:23,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-13 22:17:23,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-13 22:17:23,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 330 [2025-03-13 22:17:23,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 331 transitions, 724 flow. Second operand has 18 states, 18 states have (on average 315.8888888888889) internal successors, (5686), 18 states have internal predecessors, (5686), 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-13 22:17:23,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:23,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 330 [2025-03-13 22:17:23,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:24,093 INFO L124 PetriNetUnfolderBase]: 7/431 cut-off events. [2025-03-13 22:17:24,093 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-13 22:17:24,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 431 events. 7/431 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 402 event pairs, 6 based on Foata normal form. 4/408 useless extension candidates. Maximal degree in co-relation 363. Up to 24 conditions per place. [2025-03-13 22:17:24,095 INFO L140 encePairwiseOnDemand]: 324/330 looper letters, 18 selfloop transitions, 21 changer transitions 0/349 dead transitions. [2025-03-13 22:17:24,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 349 transitions, 890 flow [2025-03-13 22:17:24,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-13 22:17:24,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-13 22:17:24,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6637 transitions. [2025-03-13 22:17:24,103 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9577200577200577 [2025-03-13 22:17:24,104 INFO L175 Difference]: Start difference. First operand has 343 places, 331 transitions, 724 flow. Second operand 21 states and 6637 transitions. [2025-03-13 22:17:24,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 349 transitions, 890 flow [2025-03-13 22:17:24,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 349 transitions, 870 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:24,108 INFO L231 Difference]: Finished difference. Result has 363 places, 344 transitions, 834 flow [2025-03-13 22:17:24,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=834, PETRI_PLACES=363, PETRI_TRANSITIONS=344} [2025-03-13 22:17:24,109 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 33 predicate places. [2025-03-13 22:17:24,110 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 344 transitions, 834 flow [2025-03-13 22:17:24,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 315.8888888888889) internal successors, (5686), 18 states have internal predecessors, (5686), 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-13 22:17:24,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:24,113 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:17:24,119 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-13 22:17:24,313 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,SelfDestructingSolverStorable3 [2025-03-13 22:17:24,314 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:24,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:24,314 INFO L85 PathProgramCache]: Analyzing trace with hash -2081192078, now seen corresponding path program 2 times [2025-03-13 22:17:24,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:24,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442666449] [2025-03-13 22:17:24,317 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:17:24,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:24,335 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 138 statements into 2 equivalence classes. [2025-03-13 22:17:24,347 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 103 of 138 statements. [2025-03-13 22:17:24,347 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:17:24,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:24,604 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-13 22:17:24,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:24,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442666449] [2025-03-13 22:17:24,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442666449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:24,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:24,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:24,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916601646] [2025-03-13 22:17:24,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:24,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:24,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:24,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:24,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:24,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 330 [2025-03-13 22:17:24,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 344 transitions, 834 flow. Second operand has 6 states, 6 states have (on average 246.33333333333334) internal successors, (1478), 6 states have internal predecessors, (1478), 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-13 22:17:24,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:24,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 330 [2025-03-13 22:17:24,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:25,280 INFO L124 PetriNetUnfolderBase]: 365/1715 cut-off events. [2025-03-13 22:17:25,281 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-13 22:17:25,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2620 conditions, 1715 events. 365/1715 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9248 event pairs, 364 based on Foata normal form. 0/1592 useless extension candidates. Maximal degree in co-relation 2430. Up to 800 conditions per place. [2025-03-13 22:17:25,287 INFO L140 encePairwiseOnDemand]: 318/330 looper letters, 71 selfloop transitions, 10 changer transitions 0/342 dead transitions. [2025-03-13 22:17:25,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 342 transitions, 992 flow [2025-03-13 22:17:25,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:25,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:25,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1553 transitions. [2025-03-13 22:17:25,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7843434343434343 [2025-03-13 22:17:25,290 INFO L175 Difference]: Start difference. First operand has 363 places, 344 transitions, 834 flow. Second operand 6 states and 1553 transitions. [2025-03-13 22:17:25,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 342 transitions, 992 flow [2025-03-13 22:17:25,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 342 transitions, 968 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-13 22:17:25,296 INFO L231 Difference]: Finished difference. Result has 360 places, 342 transitions, 826 flow [2025-03-13 22:17:25,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=826, PETRI_PLACES=360, PETRI_TRANSITIONS=342} [2025-03-13 22:17:25,297 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 30 predicate places. [2025-03-13 22:17:25,297 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 342 transitions, 826 flow [2025-03-13 22:17:25,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 246.33333333333334) internal successors, (1478), 6 states have internal predecessors, (1478), 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-13 22:17:25,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:25,298 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:17:25,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:17:25,298 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:25,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:25,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1862246963, now seen corresponding path program 1 times [2025-03-13 22:17:25,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:25,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348454040] [2025-03-13 22:17:25,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:25,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:25,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-13 22:17:25,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-13 22:17:25,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:25,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:25,591 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:17:25,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:25,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348454040] [2025-03-13 22:17:25,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348454040] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:17:25,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281768896] [2025-03-13 22:17:25,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:25,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:17:25,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:17:25,594 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-13 22:17:25,596 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-13 22:17:25,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-13 22:17:25,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-13 22:17:25,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:25,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:25,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-13 22:17:25,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:17:25,783 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:17:25,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:17:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:17:25,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281768896] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:17:25,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:17:25,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-13 22:17:25,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489810735] [2025-03-13 22:17:25,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:17:25,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-13 22:17:25,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:25,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-13 22:17:25,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-13 22:17:25,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 330 [2025-03-13 22:17:25,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 342 transitions, 826 flow. Second operand has 23 states, 23 states have (on average 316.0) internal successors, (7268), 23 states have internal predecessors, (7268), 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-13 22:17:25,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:26,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 330 [2025-03-13 22:17:26,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:26,258 INFO L124 PetriNetUnfolderBase]: 7/444 cut-off events. [2025-03-13 22:17:26,258 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-03-13 22:17:26,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 635 conditions, 444 events. 7/444 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 396 event pairs, 6 based on Foata normal form. 3/422 useless extension candidates. Maximal degree in co-relation 368. Up to 24 conditions per place. [2025-03-13 22:17:26,260 INFO L140 encePairwiseOnDemand]: 324/330 looper letters, 21 selfloop transitions, 30 changer transitions 0/359 dead transitions. [2025-03-13 22:17:26,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 359 transitions, 1050 flow [2025-03-13 22:17:26,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-13 22:17:26,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-13 22:17:26,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9474 transitions. [2025-03-13 22:17:26,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9569696969696969 [2025-03-13 22:17:26,272 INFO L175 Difference]: Start difference. First operand has 360 places, 342 transitions, 826 flow. Second operand 30 states and 9474 transitions. [2025-03-13 22:17:26,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 359 transitions, 1050 flow [2025-03-13 22:17:26,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 359 transitions, 1030 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:26,278 INFO L231 Difference]: Finished difference. Result has 388 places, 352 transitions, 958 flow [2025-03-13 22:17:26,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=958, PETRI_PLACES=388, PETRI_TRANSITIONS=352} [2025-03-13 22:17:26,279 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 58 predicate places. [2025-03-13 22:17:26,279 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 352 transitions, 958 flow [2025-03-13 22:17:26,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 316.0) internal successors, (7268), 23 states have internal predecessors, (7268), 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-13 22:17:26,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:26,281 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:17:26,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-13 22:17:26,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:17:26,481 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:26,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:26,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1562172009, now seen corresponding path program 2 times [2025-03-13 22:17:26,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:26,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792451136] [2025-03-13 22:17:26,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:17:26,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:26,495 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 165 statements into 2 equivalence classes. [2025-03-13 22:17:26,500 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 115 of 165 statements. [2025-03-13 22:17:26,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:17:26,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:26,766 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-13 22:17:26,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:26,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792451136] [2025-03-13 22:17:26,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792451136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:26,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:26,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:26,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349710718] [2025-03-13 22:17:26,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:26,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:26,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:26,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:26,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:27,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 330 [2025-03-13 22:17:27,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 352 transitions, 958 flow. Second operand has 6 states, 6 states have (on average 243.83333333333334) internal successors, (1463), 6 states have internal predecessors, (1463), 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-13 22:17:27,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:27,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 330 [2025-03-13 22:17:27,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:27,596 INFO L124 PetriNetUnfolderBase]: 417/1909 cut-off events. [2025-03-13 22:17:27,597 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-03-13 22:17:27,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2991 conditions, 1909 events. 417/1909 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10672 event pairs, 416 based on Foata normal form. 0/1777 useless extension candidates. Maximal degree in co-relation 2722. Up to 914 conditions per place. [2025-03-13 22:17:27,604 INFO L140 encePairwiseOnDemand]: 324/330 looper letters, 81 selfloop transitions, 5 changer transitions 0/351 dead transitions. [2025-03-13 22:17:27,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 351 transitions, 1128 flow [2025-03-13 22:17:27,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:27,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:27,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1533 transitions. [2025-03-13 22:17:27,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7742424242424243 [2025-03-13 22:17:27,607 INFO L175 Difference]: Start difference. First operand has 388 places, 352 transitions, 958 flow. Second operand 6 states and 1533 transitions. [2025-03-13 22:17:27,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 351 transitions, 1128 flow [2025-03-13 22:17:27,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 351 transitions, 1082 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-03-13 22:17:27,613 INFO L231 Difference]: Finished difference. Result has 374 places, 351 transitions, 920 flow [2025-03-13 22:17:27,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=920, PETRI_PLACES=374, PETRI_TRANSITIONS=351} [2025-03-13 22:17:27,616 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 44 predicate places. [2025-03-13 22:17:27,616 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 351 transitions, 920 flow [2025-03-13 22:17:27,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 243.83333333333334) internal successors, (1463), 6 states have internal predecessors, (1463), 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-13 22:17:27,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:27,617 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:17:27,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:17:27,617 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:27,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:27,618 INFO L85 PathProgramCache]: Analyzing trace with hash 924038688, now seen corresponding path program 1 times [2025-03-13 22:17:27,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:27,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629876940] [2025-03-13 22:17:27,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:27,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:27,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-13 22:17:27,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-13 22:17:27,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:27,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:28,056 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-13 22:17:28,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:28,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629876940] [2025-03-13 22:17:28,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629876940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:28,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:28,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:28,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097687767] [2025-03-13 22:17:28,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:28,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:28,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:28,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:28,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:28,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 330 [2025-03-13 22:17:28,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 351 transitions, 920 flow. Second operand has 6 states, 6 states have (on average 266.8333333333333) internal successors, (1601), 6 states have internal predecessors, (1601), 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-13 22:17:28,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:28,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 330 [2025-03-13 22:17:28,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:29,037 INFO L124 PetriNetUnfolderBase]: 257/1749 cut-off events. [2025-03-13 22:17:29,037 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-03-13 22:17:29,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2479 conditions, 1749 events. 257/1749 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 10075 event pairs, 34 based on Foata normal form. 0/1620 useless extension candidates. Maximal degree in co-relation 2231. Up to 436 conditions per place. [2025-03-13 22:17:29,043 INFO L140 encePairwiseOnDemand]: 301/330 looper letters, 68 selfloop transitions, 75 changer transitions 0/428 dead transitions. [2025-03-13 22:17:29,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 428 transitions, 1360 flow [2025-03-13 22:17:29,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:29,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:29,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1717 transitions. [2025-03-13 22:17:29,046 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8671717171717171 [2025-03-13 22:17:29,046 INFO L175 Difference]: Start difference. First operand has 374 places, 351 transitions, 920 flow. Second operand 6 states and 1717 transitions. [2025-03-13 22:17:29,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 428 transitions, 1360 flow [2025-03-13 22:17:29,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 428 transitions, 1350 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:29,053 INFO L231 Difference]: Finished difference. Result has 378 places, 419 transitions, 1390 flow [2025-03-13 22:17:29,054 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1390, PETRI_PLACES=378, PETRI_TRANSITIONS=419} [2025-03-13 22:17:29,054 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 48 predicate places. [2025-03-13 22:17:29,055 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 419 transitions, 1390 flow [2025-03-13 22:17:29,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 266.8333333333333) internal successors, (1601), 6 states have internal predecessors, (1601), 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-13 22:17:29,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:29,056 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:17:29,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:17:29,056 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:29,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:29,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1814799138, now seen corresponding path program 1 times [2025-03-13 22:17:29,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:29,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887233736] [2025-03-13 22:17:29,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:29,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:29,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-13 22:17:29,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-13 22:17:29,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:29,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:29,433 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-13 22:17:29,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:29,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887233736] [2025-03-13 22:17:29,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887233736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:29,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:29,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:29,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737044667] [2025-03-13 22:17:29,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:29,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:29,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:29,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:29,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:29,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 330 [2025-03-13 22:17:29,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 419 transitions, 1390 flow. Second operand has 6 states, 6 states have (on average 273.5) internal successors, (1641), 6 states have internal predecessors, (1641), 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-13 22:17:29,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:29,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 330 [2025-03-13 22:17:29,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:30,023 INFO L124 PetriNetUnfolderBase]: 163/1561 cut-off events. [2025-03-13 22:17:30,023 INFO L125 PetriNetUnfolderBase]: For 491/527 co-relation queries the response was YES. [2025-03-13 22:17:30,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2620 conditions, 1561 events. 163/1561 cut-off events. For 491/527 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 8871 event pairs, 51 based on Foata normal form. 0/1458 useless extension candidates. Maximal degree in co-relation 2370. Up to 335 conditions per place. [2025-03-13 22:17:30,031 INFO L140 encePairwiseOnDemand]: 324/330 looper letters, 117 selfloop transitions, 5 changer transitions 0/418 dead transitions. [2025-03-13 22:17:30,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 418 transitions, 1632 flow [2025-03-13 22:17:30,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:30,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:30,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1673 transitions. [2025-03-13 22:17:30,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8449494949494949 [2025-03-13 22:17:30,034 INFO L175 Difference]: Start difference. First operand has 378 places, 419 transitions, 1390 flow. Second operand 6 states and 1673 transitions. [2025-03-13 22:17:30,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 418 transitions, 1632 flow [2025-03-13 22:17:30,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 418 transitions, 1632 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:17:30,041 INFO L231 Difference]: Finished difference. Result has 382 places, 418 transitions, 1398 flow [2025-03-13 22:17:30,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=1388, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1398, PETRI_PLACES=382, PETRI_TRANSITIONS=418} [2025-03-13 22:17:30,043 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 52 predicate places. [2025-03-13 22:17:30,043 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 418 transitions, 1398 flow [2025-03-13 22:17:30,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 273.5) internal successors, (1641), 6 states have internal predecessors, (1641), 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-13 22:17:30,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:30,044 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:17:30,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:17:30,044 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:30,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:30,045 INFO L85 PathProgramCache]: Analyzing trace with hash 738467225, now seen corresponding path program 1 times [2025-03-13 22:17:30,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:30,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243949986] [2025-03-13 22:17:30,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:30,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:30,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-13 22:17:30,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-13 22:17:30,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:30,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:30,417 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-13 22:17:30,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:30,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243949986] [2025-03-13 22:17:30,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243949986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:30,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:30,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:30,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263859486] [2025-03-13 22:17:30,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:30,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:30,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:30,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:30,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:30,664 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 330 [2025-03-13 22:17:30,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 418 transitions, 1398 flow. Second operand has 6 states, 6 states have (on average 249.16666666666666) internal successors, (1495), 6 states have internal predecessors, (1495), 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-13 22:17:30,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:30,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 330 [2025-03-13 22:17:30,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:31,084 INFO L124 PetriNetUnfolderBase]: 701/2966 cut-off events. [2025-03-13 22:17:31,084 INFO L125 PetriNetUnfolderBase]: For 1000/1075 co-relation queries the response was YES. [2025-03-13 22:17:31,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5704 conditions, 2966 events. 701/2966 cut-off events. For 1000/1075 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 20009 event pairs, 395 based on Foata normal form. 0/2766 useless extension candidates. Maximal degree in co-relation 5453. Up to 1482 conditions per place. [2025-03-13 22:17:31,093 INFO L140 encePairwiseOnDemand]: 324/330 looper letters, 146 selfloop transitions, 5 changer transitions 0/417 dead transitions. [2025-03-13 22:17:31,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 417 transitions, 1698 flow [2025-03-13 22:17:31,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:31,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:31,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1543 transitions. [2025-03-13 22:17:31,096 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7792929292929293 [2025-03-13 22:17:31,096 INFO L175 Difference]: Start difference. First operand has 382 places, 418 transitions, 1398 flow. Second operand 6 states and 1543 transitions. [2025-03-13 22:17:31,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 417 transitions, 1698 flow [2025-03-13 22:17:31,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 417 transitions, 1688 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:31,104 INFO L231 Difference]: Finished difference. Result has 381 places, 417 transitions, 1396 flow [2025-03-13 22:17:31,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=1386, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1396, PETRI_PLACES=381, PETRI_TRANSITIONS=417} [2025-03-13 22:17:31,105 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 51 predicate places. [2025-03-13 22:17:31,106 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 417 transitions, 1396 flow [2025-03-13 22:17:31,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 249.16666666666666) internal successors, (1495), 6 states have internal predecessors, (1495), 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-13 22:17:31,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:31,107 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:17:31,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:17:31,107 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:31,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:31,108 INFO L85 PathProgramCache]: Analyzing trace with hash -688289831, now seen corresponding path program 1 times [2025-03-13 22:17:31,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:31,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261809898] [2025-03-13 22:17:31,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:31,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:31,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-13 22:17:31,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-13 22:17:31,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:31,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:31,573 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-13 22:17:31,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:31,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261809898] [2025-03-13 22:17:31,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261809898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:31,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:31,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:31,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417060661] [2025-03-13 22:17:31,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:31,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:31,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:31,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:31,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:31,815 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 330 [2025-03-13 22:17:31,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 417 transitions, 1396 flow. Second operand has 6 states, 6 states have (on average 250.66666666666666) internal successors, (1504), 6 states have internal predecessors, (1504), 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-13 22:17:31,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:31,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 330 [2025-03-13 22:17:31,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:32,209 INFO L124 PetriNetUnfolderBase]: 701/2965 cut-off events. [2025-03-13 22:17:32,210 INFO L125 PetriNetUnfolderBase]: For 1002/1077 co-relation queries the response was YES. [2025-03-13 22:17:32,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5702 conditions, 2965 events. 701/2965 cut-off events. For 1002/1077 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 20010 event pairs, 395 based on Foata normal form. 0/2766 useless extension candidates. Maximal degree in co-relation 5451. Up to 1481 conditions per place. [2025-03-13 22:17:32,221 INFO L140 encePairwiseOnDemand]: 324/330 looper letters, 145 selfloop transitions, 5 changer transitions 0/416 dead transitions. [2025-03-13 22:17:32,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 416 transitions, 1694 flow [2025-03-13 22:17:32,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:32,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:32,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1548 transitions. [2025-03-13 22:17:32,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7818181818181819 [2025-03-13 22:17:32,227 INFO L175 Difference]: Start difference. First operand has 381 places, 417 transitions, 1396 flow. Second operand 6 states and 1548 transitions. [2025-03-13 22:17:32,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 416 transitions, 1694 flow [2025-03-13 22:17:32,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 416 transitions, 1684 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:32,234 INFO L231 Difference]: Finished difference. Result has 380 places, 416 transitions, 1394 flow [2025-03-13 22:17:32,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=1384, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1394, PETRI_PLACES=380, PETRI_TRANSITIONS=416} [2025-03-13 22:17:32,235 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 50 predicate places. [2025-03-13 22:17:32,235 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 416 transitions, 1394 flow [2025-03-13 22:17:32,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 250.66666666666666) internal successors, (1504), 6 states have internal predecessors, (1504), 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-13 22:17:32,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:32,235 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:17:32,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:17:32,235 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:32,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:32,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1019021791, now seen corresponding path program 1 times [2025-03-13 22:17:32,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:32,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372730170] [2025-03-13 22:17:32,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:32,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:32,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-13 22:17:32,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-13 22:17:32,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:32,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:32,638 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-03-13 22:17:32,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:32,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372730170] [2025-03-13 22:17:32,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372730170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:32,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:32,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:32,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063121951] [2025-03-13 22:17:32,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:32,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:32,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:32,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:32,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:32,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 330 [2025-03-13 22:17:32,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 416 transitions, 1394 flow. Second operand has 6 states, 6 states have (on average 275.1666666666667) internal successors, (1651), 6 states have internal predecessors, (1651), 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-13 22:17:32,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:32,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 330 [2025-03-13 22:17:32,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:33,315 INFO L124 PetriNetUnfolderBase]: 500/2481 cut-off events. [2025-03-13 22:17:33,315 INFO L125 PetriNetUnfolderBase]: For 968/1060 co-relation queries the response was YES. [2025-03-13 22:17:33,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4638 conditions, 2481 events. 500/2481 cut-off events. For 968/1060 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 16071 event pairs, 92 based on Foata normal form. 16/2340 useless extension candidates. Maximal degree in co-relation 4386. Up to 813 conditions per place. [2025-03-13 22:17:33,325 INFO L140 encePairwiseOnDemand]: 307/330 looper letters, 131 selfloop transitions, 130 changer transitions 0/553 dead transitions. [2025-03-13 22:17:33,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 553 transitions, 2566 flow [2025-03-13 22:17:33,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:33,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:33,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1751 transitions. [2025-03-13 22:17:33,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8843434343434343 [2025-03-13 22:17:33,328 INFO L175 Difference]: Start difference. First operand has 380 places, 416 transitions, 1394 flow. Second operand 6 states and 1751 transitions. [2025-03-13 22:17:33,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 553 transitions, 2566 flow [2025-03-13 22:17:33,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 553 transitions, 2556 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:33,337 INFO L231 Difference]: Finished difference. Result has 385 places, 545 transitions, 2612 flow [2025-03-13 22:17:33,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=1384, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2612, PETRI_PLACES=385, PETRI_TRANSITIONS=545} [2025-03-13 22:17:33,339 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 55 predicate places. [2025-03-13 22:17:33,339 INFO L471 AbstractCegarLoop]: Abstraction has has 385 places, 545 transitions, 2612 flow [2025-03-13 22:17:33,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 275.1666666666667) internal successors, (1651), 6 states have internal predecessors, (1651), 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-13 22:17:33,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:33,340 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:17:33,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:17:33,340 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:33,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:33,341 INFO L85 PathProgramCache]: Analyzing trace with hash 468016939, now seen corresponding path program 1 times [2025-03-13 22:17:33,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:33,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637349147] [2025-03-13 22:17:33,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:33,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:33,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-13 22:17:33,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-13 22:17:33,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:33,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:33,826 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-03-13 22:17:33,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:33,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637349147] [2025-03-13 22:17:33,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637349147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:33,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:33,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:33,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324302478] [2025-03-13 22:17:33,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:33,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:33,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:33,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:33,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:34,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 330 [2025-03-13 22:17:34,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 545 transitions, 2612 flow. Second operand has 6 states, 6 states have (on average 275.3333333333333) internal successors, (1652), 6 states have internal predecessors, (1652), 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-13 22:17:34,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:34,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 330 [2025-03-13 22:17:34,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:34,462 INFO L124 PetriNetUnfolderBase]: 776/3252 cut-off events. [2025-03-13 22:17:34,462 INFO L125 PetriNetUnfolderBase]: For 3396/3666 co-relation queries the response was YES. [2025-03-13 22:17:34,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7517 conditions, 3252 events. 776/3252 cut-off events. For 3396/3666 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 22180 event pairs, 65 based on Foata normal form. 52/3139 useless extension candidates. Maximal degree in co-relation 7261. Up to 1071 conditions per place. [2025-03-13 22:17:34,476 INFO L140 encePairwiseOnDemand]: 307/330 looper letters, 251 selfloop transitions, 131 changer transitions 5/683 dead transitions. [2025-03-13 22:17:34,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 683 transitions, 4286 flow [2025-03-13 22:17:34,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:34,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:34,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1752 transitions. [2025-03-13 22:17:34,478 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8848484848484849 [2025-03-13 22:17:34,478 INFO L175 Difference]: Start difference. First operand has 385 places, 545 transitions, 2612 flow. Second operand 6 states and 1752 transitions. [2025-03-13 22:17:34,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 683 transitions, 4286 flow [2025-03-13 22:17:34,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 683 transitions, 4286 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:17:34,490 INFO L231 Difference]: Finished difference. Result has 395 places, 673 transitions, 4092 flow [2025-03-13 22:17:34,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=2612, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=507, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4092, PETRI_PLACES=395, PETRI_TRANSITIONS=673} [2025-03-13 22:17:34,491 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 65 predicate places. [2025-03-13 22:17:34,491 INFO L471 AbstractCegarLoop]: Abstraction has has 395 places, 673 transitions, 4092 flow [2025-03-13 22:17:34,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 275.3333333333333) internal successors, (1652), 6 states have internal predecessors, (1652), 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-13 22:17:34,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:34,492 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:17:34,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:17:34,492 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:34,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:34,493 INFO L85 PathProgramCache]: Analyzing trace with hash 12257584, now seen corresponding path program 1 times [2025-03-13 22:17:34,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:34,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137896648] [2025-03-13 22:17:34,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:34,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:34,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-13 22:17:34,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-13 22:17:34,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:34,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:34,856 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-03-13 22:17:34,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:34,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137896648] [2025-03-13 22:17:34,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137896648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:34,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:34,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:34,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85047329] [2025-03-13 22:17:34,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:34,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:34,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:34,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:34,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:35,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 330 [2025-03-13 22:17:35,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 673 transitions, 4092 flow. Second operand has 6 states, 6 states have (on average 255.66666666666666) internal successors, (1534), 6 states have internal predecessors, (1534), 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-13 22:17:35,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:35,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 330 [2025-03-13 22:17:35,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:35,706 INFO L124 PetriNetUnfolderBase]: 1308/4650 cut-off events. [2025-03-13 22:17:35,707 INFO L125 PetriNetUnfolderBase]: For 4863/4920 co-relation queries the response was YES. [2025-03-13 22:17:35,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12215 conditions, 4650 events. 1308/4650 cut-off events. For 4863/4920 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 33787 event pairs, 369 based on Foata normal form. 11/4416 useless extension candidates. Maximal degree in co-relation 11955. Up to 2225 conditions per place. [2025-03-13 22:17:35,730 INFO L140 encePairwiseOnDemand]: 311/330 looper letters, 316 selfloop transitions, 84 changer transitions 0/752 dead transitions. [2025-03-13 22:17:35,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 752 transitions, 5290 flow [2025-03-13 22:17:35,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:35,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:35,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1630 transitions. [2025-03-13 22:17:35,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8232323232323232 [2025-03-13 22:17:35,732 INFO L175 Difference]: Start difference. First operand has 395 places, 673 transitions, 4092 flow. Second operand 6 states and 1630 transitions. [2025-03-13 22:17:35,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 752 transitions, 5290 flow [2025-03-13 22:17:35,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 752 transitions, 5036 flow, removed 127 selfloop flow, removed 0 redundant places. [2025-03-13 22:17:35,754 INFO L231 Difference]: Finished difference. Result has 404 places, 744 transitions, 4628 flow [2025-03-13 22:17:35,755 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=3844, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=625, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4628, PETRI_PLACES=404, PETRI_TRANSITIONS=744} [2025-03-13 22:17:35,755 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 74 predicate places. [2025-03-13 22:17:35,755 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 744 transitions, 4628 flow [2025-03-13 22:17:35,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 255.66666666666666) internal successors, (1534), 6 states have internal predecessors, (1534), 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-13 22:17:35,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:35,756 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:17:35,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:17:35,756 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:35,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:35,757 INFO L85 PathProgramCache]: Analyzing trace with hash -879237976, now seen corresponding path program 1 times [2025-03-13 22:17:35,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:35,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302426652] [2025-03-13 22:17:35,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:35,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:35,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-13 22:17:35,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-13 22:17:35,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:35,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:36,775 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-13 22:17:36,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:36,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302426652] [2025-03-13 22:17:36,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302426652] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:17:36,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313993791] [2025-03-13 22:17:36,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:36,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:17:36,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:17:36,778 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-13 22:17:36,779 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-13 22:17:36,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-13 22:17:36,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-13 22:17:36,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:36,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:36,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-13 22:17:36,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:17:37,303 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-13 22:17:37,305 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-13 22:17:37,402 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-13 22:17:37,402 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-13 22:17:37,622 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-13 22:17:37,623 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-13 22:17:37,655 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 15 treesize of output 11 [2025-03-13 22:17:37,675 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 28 treesize of output 27 [2025-03-13 22:17:37,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:17:37,704 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 40 treesize of output 42 [2025-03-13 22:17:37,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:17:37,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2025-03-13 22:17:37,776 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 56 treesize of output 45 [2025-03-13 22:17:37,802 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-03-13 22:17:37,803 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 22:17:37,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313993791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:37,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 22:17:37,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 19 [2025-03-13 22:17:37,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967889407] [2025-03-13 22:17:37,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:37,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 22:17:37,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:37,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 22:17:37,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-03-13 22:17:39,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 330 [2025-03-13 22:17:39,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 744 transitions, 4628 flow. Second operand has 11 states, 11 states have (on average 260.6363636363636) internal successors, (2867), 11 states have internal predecessors, (2867), 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-13 22:17:39,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:39,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 330 [2025-03-13 22:17:39,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:40,176 INFO L124 PetriNetUnfolderBase]: 1038/3966 cut-off events. [2025-03-13 22:17:40,176 INFO L125 PetriNetUnfolderBase]: For 6148/6431 co-relation queries the response was YES. [2025-03-13 22:17:40,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11612 conditions, 3966 events. 1038/3966 cut-off events. For 6148/6431 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 27777 event pairs, 87 based on Foata normal form. 74/3894 useless extension candidates. Maximal degree in co-relation 11344. Up to 892 conditions per place. [2025-03-13 22:17:40,203 INFO L140 encePairwiseOnDemand]: 307/330 looper letters, 401 selfloop transitions, 143 changer transitions 1/869 dead transitions. [2025-03-13 22:17:40,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 869 transitions, 6652 flow [2025-03-13 22:17:40,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-13 22:17:40,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-13 22:17:40,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 4514 transitions. [2025-03-13 22:17:40,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8046345811051694 [2025-03-13 22:17:40,210 INFO L175 Difference]: Start difference. First operand has 404 places, 744 transitions, 4628 flow. Second operand 17 states and 4514 transitions. [2025-03-13 22:17:40,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 869 transitions, 6652 flow [2025-03-13 22:17:40,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 420 places, 869 transitions, 6580 flow, removed 36 selfloop flow, removed 0 redundant places. [2025-03-13 22:17:40,289 INFO L231 Difference]: Finished difference. Result has 431 places, 801 transitions, 5574 flow [2025-03-13 22:17:40,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=4574, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=744, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=624, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=5574, PETRI_PLACES=431, PETRI_TRANSITIONS=801} [2025-03-13 22:17:40,290 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 101 predicate places. [2025-03-13 22:17:40,290 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 801 transitions, 5574 flow [2025-03-13 22:17:40,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 260.6363636363636) internal successors, (2867), 11 states have internal predecessors, (2867), 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-13 22:17:40,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:40,291 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:17:40,298 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-13 22:17:40,491 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,SelfDestructingSolverStorable14 [2025-03-13 22:17:40,492 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:40,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:40,493 INFO L85 PathProgramCache]: Analyzing trace with hash 130031076, now seen corresponding path program 2 times [2025-03-13 22:17:40,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:40,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910000560] [2025-03-13 22:17:40,493 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:17:40,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:40,517 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 269 statements into 2 equivalence classes. [2025-03-13 22:17:40,566 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 269 of 269 statements. [2025-03-13 22:17:40,566 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 22:17:40,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:42,713 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-13 22:17:42,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:42,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910000560] [2025-03-13 22:17:42,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910000560] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:17:42,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950576815] [2025-03-13 22:17:42,714 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:17:42,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:17:42,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:17:42,716 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-13 22:17:42,718 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-13 22:17:42,844 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 269 statements into 2 equivalence classes. [2025-03-13 22:17:43,176 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 269 of 269 statements. [2025-03-13 22:17:43,177 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 22:17:43,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:43,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-13 22:17:43,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:17:43,466 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-13 22:17:43,466 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-13 22:17:43,546 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-13 22:17:43,547 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-13 22:17:43,714 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 15 treesize of output 11 [2025-03-13 22:17:43,742 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 28 treesize of output 27 [2025-03-13 22:17:43,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:17:43,774 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 40 treesize of output 42 [2025-03-13 22:17:43,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:17:43,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2025-03-13 22:17:43,839 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-13 22:17:43,839 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-13 22:17:43,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 56 treesize of output 45 [2025-03-13 22:17:43,962 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-03-13 22:17:43,963 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 22:17:43,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950576815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:43,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 22:17:43,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 22 [2025-03-13 22:17:43,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770201990] [2025-03-13 22:17:43,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:43,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 22:17:43,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:43,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 22:17:43,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2025-03-13 22:17:45,719 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 330 [2025-03-13 22:17:45,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 801 transitions, 5574 flow. Second operand has 11 states, 11 states have (on average 260.6363636363636) internal successors, (2867), 11 states have internal predecessors, (2867), 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-13 22:17:45,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:45,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 330 [2025-03-13 22:17:45,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:46,735 INFO L124 PetriNetUnfolderBase]: 1506/5671 cut-off events. [2025-03-13 22:17:46,735 INFO L125 PetriNetUnfolderBase]: For 13160/13563 co-relation queries the response was YES. [2025-03-13 22:17:46,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17746 conditions, 5671 events. 1506/5671 cut-off events. For 13160/13563 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 45262 event pairs, 98 based on Foata normal form. 199/5678 useless extension candidates. Maximal degree in co-relation 17464. Up to 1301 conditions per place. [2025-03-13 22:17:46,763 INFO L140 encePairwiseOnDemand]: 296/330 looper letters, 419 selfloop transitions, 261 changer transitions 4/1008 dead transitions. [2025-03-13 22:17:46,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 1008 transitions, 8770 flow [2025-03-13 22:17:46,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 22:17:46,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 22:17:46,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3007 transitions. [2025-03-13 22:17:46,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8283746556473829 [2025-03-13 22:17:46,766 INFO L175 Difference]: Start difference. First operand has 431 places, 801 transitions, 5574 flow. Second operand 11 states and 3007 transitions. [2025-03-13 22:17:46,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 1008 transitions, 8770 flow [2025-03-13 22:17:46,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 1008 transitions, 8724 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-13 22:17:46,813 INFO L231 Difference]: Finished difference. Result has 442 places, 902 transitions, 7765 flow [2025-03-13 22:17:46,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=5550, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=801, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=543, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7765, PETRI_PLACES=442, PETRI_TRANSITIONS=902} [2025-03-13 22:17:46,814 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 112 predicate places. [2025-03-13 22:17:46,814 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 902 transitions, 7765 flow [2025-03-13 22:17:46,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 260.6363636363636) internal successors, (2867), 11 states have internal predecessors, (2867), 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-13 22:17:46,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:46,815 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:17:46,827 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-13 22:17:47,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-13 22:17:47,016 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:47,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:47,017 INFO L85 PathProgramCache]: Analyzing trace with hash 150936714, now seen corresponding path program 3 times [2025-03-13 22:17:47,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:47,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422975141] [2025-03-13 22:17:47,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 22:17:47,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:47,038 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 269 statements into 11 equivalence classes. [2025-03-13 22:17:47,071 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 222 of 269 statements. [2025-03-13 22:17:47,071 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-13 22:17:47,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:49,098 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-13 22:17:49,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:49,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422975141] [2025-03-13 22:17:49,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422975141] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:17:49,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836213805] [2025-03-13 22:17:49,099 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 22:17:49,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:17:49,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:17:49,101 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-13 22:17:49,102 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-13 22:17:49,236 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 269 statements into 11 equivalence classes. [2025-03-13 22:17:50,225 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 222 of 269 statements. [2025-03-13 22:17:50,225 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-13 22:17:50,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:50,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-13 22:17:50,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:17:50,475 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-13 22:17:50,475 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-13 22:17:50,543 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-13 22:17:50,543 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-13 22:17:50,686 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-13 22:17:50,686 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-13 22:17:50,729 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 15 treesize of output 11 [2025-03-13 22:17:50,801 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 28 treesize of output 27 [2025-03-13 22:17:50,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:17:50,827 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 40 treesize of output 42 [2025-03-13 22:17:50,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:17:50,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2025-03-13 22:17:50,914 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 56 treesize of output 45 [2025-03-13 22:17:50,945 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-03-13 22:17:50,945 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 22:17:50,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836213805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:50,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 22:17:50,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 21 [2025-03-13 22:17:50,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763321934] [2025-03-13 22:17:50,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:50,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 22:17:50,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:50,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 22:17:50,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2025-03-13 22:17:52,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 330 [2025-03-13 22:17:52,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 902 transitions, 7765 flow. Second operand has 11 states, 11 states have (on average 260.6363636363636) internal successors, (2867), 11 states have internal predecessors, (2867), 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-13 22:17:52,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:52,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 330 [2025-03-13 22:17:52,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:54,669 INFO L124 PetriNetUnfolderBase]: 2372/8785 cut-off events. [2025-03-13 22:17:54,669 INFO L125 PetriNetUnfolderBase]: For 29458/30113 co-relation queries the response was YES. [2025-03-13 22:17:54,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29138 conditions, 8785 events. 2372/8785 cut-off events. For 29458/30113 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 80525 event pairs, 161 based on Foata normal form. 233/8706 useless extension candidates. Maximal degree in co-relation 28850. Up to 1941 conditions per place. [2025-03-13 22:17:54,726 INFO L140 encePairwiseOnDemand]: 299/330 looper letters, 556 selfloop transitions, 329 changer transitions 1/1210 dead transitions. [2025-03-13 22:17:54,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 1210 transitions, 13094 flow [2025-03-13 22:17:54,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-13 22:17:54,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-13 22:17:54,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 4268 transitions. [2025-03-13 22:17:54,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8083333333333333 [2025-03-13 22:17:54,731 INFO L175 Difference]: Start difference. First operand has 442 places, 902 transitions, 7765 flow. Second operand 16 states and 4268 transitions. [2025-03-13 22:17:54,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 1210 transitions, 13094 flow [2025-03-13 22:17:54,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 1210 transitions, 12978 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:54,829 INFO L231 Difference]: Finished difference. Result has 463 places, 1062 transitions, 11387 flow [2025-03-13 22:17:54,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=7681, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=902, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=594, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=11387, PETRI_PLACES=463, PETRI_TRANSITIONS=1062} [2025-03-13 22:17:54,831 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 133 predicate places. [2025-03-13 22:17:54,831 INFO L471 AbstractCegarLoop]: Abstraction has has 463 places, 1062 transitions, 11387 flow [2025-03-13 22:17:54,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 260.6363636363636) internal successors, (2867), 11 states have internal predecessors, (2867), 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-13 22:17:54,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:54,832 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:17:54,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-13 22:17:55,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-13 22:17:55,033 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:55,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:55,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1162884278, now seen corresponding path program 4 times [2025-03-13 22:17:55,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:55,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750110080] [2025-03-13 22:17:55,034 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 22:17:55,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:55,066 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 269 statements into 2 equivalence classes. [2025-03-13 22:17:55,171 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 269 of 269 statements. [2025-03-13 22:17:55,171 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 22:17:55,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:56,167 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-03-13 22:17:56,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:56,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750110080] [2025-03-13 22:17:56,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750110080] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:17:56,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616829867] [2025-03-13 22:17:56,167 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 22:17:56,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:17:56,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:17:56,169 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:17:56,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-13 22:17:56,303 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 269 statements into 2 equivalence classes. [2025-03-13 22:17:57,930 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 269 of 269 statements. [2025-03-13 22:17:57,930 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 22:17:57,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:57,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-13 22:17:57,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:17:58,180 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-13 22:17:58,180 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-13 22:17:58,258 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-13 22:17:58,258 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-13 22:17:58,399 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 15 treesize of output 11 [2025-03-13 22:17:58,407 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 28 treesize of output 27 [2025-03-13 22:17:58,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:17:58,413 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 40 treesize of output 42 [2025-03-13 22:17:58,436 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-13 22:17:58,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-13 22:17:58,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:17:58,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2025-03-13 22:17:58,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2025-03-13 22:17:58,548 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-03-13 22:17:58,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:17:58,573 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (and (forall ((v_ArrVal_2632 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2632) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse0 1)) 0)) (forall ((v_ArrVal_2632 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2632) |c_~#c~0.base|) (+ 2 |c_~#c~0.offset| .cse0)) 0)) (forall ((v_ArrVal_2632 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2632) |c_~#c~0.base|) (+ 3 |c_~#c~0.offset| .cse0)) 0)) (forall ((v_ArrVal_2632 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2632) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse0)) 0)))) is different from false [2025-03-13 22:17:58,597 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse2 (+ 3 |c_~#c~0.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_~#c~0.base| (store (select |c_#race| |c_~#c~0.base|) .cse2 0)))) (and (forall ((v_ArrVal_2632 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2632) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse1 1)) 0)) (forall ((v_ArrVal_2632 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2632) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse1)) 0)) (forall ((v_ArrVal_2632 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2632) |c_~#c~0.base|) (+ 2 |c_~#c~0.offset| .cse1)) 0)) (forall ((v_ArrVal_2632 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2632) |c_~#c~0.base|) .cse2) 0)))))) is different from false [2025-03-13 22:17:58,618 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse2 (+ 3 |c_~#c~0.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_~#c~0.base| (store (select |c_#race| |c_~#c~0.base|) .cse2 0)))) (and (forall ((v_ArrVal_2632 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_2632) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse1 1)) 0)) (forall ((v_ArrVal_2632 (Array Int Int))) (= 0 (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_2632) |c_~#c~0.base|) (+ 2 |c_~#c~0.offset| .cse1)))) (forall ((v_ArrVal_2632 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_2632) |c_~#c~0.base|) .cse2) 0)) (forall ((v_ArrVal_2632 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_2632) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse1)) 0)))))) is different from false [2025-03-13 22:17:58,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:17:58,915 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 50 treesize of output 66 [2025-03-13 22:17:58,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:17:58,920 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 81 treesize of output 38 [2025-03-13 22:17:58,927 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-13 22:17:58,927 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 51 treesize of output 1 [2025-03-13 22:17:58,930 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-13 22:17:58,930 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 51 treesize of output 1 [2025-03-13 22:17:58,936 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-13 22:17:58,936 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 51 treesize of output 1 [2025-03-13 22:18:21,565 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 1 not checked. [2025-03-13 22:18:21,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616829867] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:18:21,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:18:21,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-03-13 22:18:21,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129109202] [2025-03-13 22:18:21,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:18:21,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-13 22:18:21,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:18:21,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-13 22:18:21,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=300, Unknown=11, NotChecked=114, Total=506 [2025-03-13 22:18:21,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 330 [2025-03-13 22:18:21,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 463 places, 1062 transitions, 11387 flow. Second operand has 23 states, 23 states have (on average 144.6086956521739) internal successors, (3326), 23 states have internal predecessors, (3326), 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-13 22:18:21,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:18:21,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 330 [2025-03-13 22:18:21,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:18:27,528 INFO L124 PetriNetUnfolderBase]: 7332/19871 cut-off events. [2025-03-13 22:18:27,528 INFO L125 PetriNetUnfolderBase]: For 80119/80318 co-relation queries the response was YES. [2025-03-13 22:18:27,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72521 conditions, 19871 events. 7332/19871 cut-off events. For 80119/80318 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 191436 event pairs, 1960 based on Foata normal form. 114/19134 useless extension candidates. Maximal degree in co-relation 72150. Up to 5817 conditions per place. [2025-03-13 22:18:27,670 INFO L140 encePairwiseOnDemand]: 296/330 looper letters, 952 selfloop transitions, 420 changer transitions 8/1542 dead transitions. [2025-03-13 22:18:27,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 1542 transitions, 18589 flow [2025-03-13 22:18:27,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-13 22:18:27,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-13 22:18:27,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2335 transitions. [2025-03-13 22:18:27,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5054112554112554 [2025-03-13 22:18:27,673 INFO L175 Difference]: Start difference. First operand has 463 places, 1062 transitions, 11387 flow. Second operand 14 states and 2335 transitions. [2025-03-13 22:18:27,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 1542 transitions, 18589 flow [2025-03-13 22:18:27,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 1542 transitions, 18492 flow, removed 47 selfloop flow, removed 2 redundant places. [2025-03-13 22:18:27,898 INFO L231 Difference]: Finished difference. Result has 483 places, 1203 transitions, 15606 flow [2025-03-13 22:18:27,899 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=11302, PETRI_DIFFERENCE_MINUEND_PLACES=461, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1062, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=282, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=655, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=15606, PETRI_PLACES=483, PETRI_TRANSITIONS=1203} [2025-03-13 22:18:27,899 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 153 predicate places. [2025-03-13 22:18:27,899 INFO L471 AbstractCegarLoop]: Abstraction has has 483 places, 1203 transitions, 15606 flow [2025-03-13 22:18:27,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 144.6086956521739) internal successors, (3326), 23 states have internal predecessors, (3326), 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-13 22:18:27,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:18:27,900 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:18:27,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-13 22:18:28,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:18:28,105 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:18:28,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:18:28,106 INFO L85 PathProgramCache]: Analyzing trace with hash 608988930, now seen corresponding path program 5 times [2025-03-13 22:18:28,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:18:28,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310957440] [2025-03-13 22:18:28,106 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 22:18:28,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:18:28,129 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 269 statements into 11 equivalence classes. [2025-03-13 22:18:28,167 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 269 of 269 statements. [2025-03-13 22:18:28,167 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-13 22:18:28,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:29,366 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-13 22:18:29,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:18:29,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310957440] [2025-03-13 22:18:29,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310957440] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:18:29,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117141400] [2025-03-13 22:18:29,367 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 22:18:29,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:18:29,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:18:29,369 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:18:29,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-13 22:18:29,517 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 269 statements into 11 equivalence classes. [2025-03-13 22:18:32,702 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 269 of 269 statements. [2025-03-13 22:18:32,702 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-13 22:18:32,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:32,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-13 22:18:32,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:18:33,308 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-13 22:18:33,308 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-13 22:18:33,530 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-13 22:18:33,530 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-13 22:18:34,056 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 13 treesize of output 9 [2025-03-13 22:18:34,088 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 25 treesize of output 24 [2025-03-13 22:18:34,252 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-13 22:18:34,252 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-13 22:18:34,335 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 0 case distinctions, treesize of input 36 treesize of output 38 [2025-03-13 22:18:34,375 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 0 case distinctions, treesize of input 47 treesize of output 52 [2025-03-13 22:18:34,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 55 [2025-03-13 22:18:34,468 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-03-13 22:18:34,468 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:18:37,916 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-03-13 22:18:37,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117141400] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:18:37,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:18:37,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 13] total 40 [2025-03-13 22:18:37,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104449604] [2025-03-13 22:18:37,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:18:37,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-13 22:18:37,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:18:37,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-13 22:18:37,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1351, Unknown=0, NotChecked=0, Total=1640