./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_06-ptra_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_06-ptra_nr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c74b9abfd84bef3aa9e712193319c6938e59ac72c91a2b202dc32aee3a54e2e3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:46:23,499 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:46:23,555 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:46:23,559 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:46:23,561 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:46:23,577 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:46:23,579 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:46:23,580 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:46:23,580 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:46:23,580 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:46:23,581 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:46:23,581 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:46:23,581 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:46:23,581 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:46:23,581 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:46:23,581 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:46:23,581 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:46:23,582 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:46:23,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:46:23,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:46:23,582 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:46:23,582 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:46:23,582 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:46:23,582 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:46:23,583 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:46:23,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:46:23,583 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:46:23,583 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:46:23,583 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:46:23,583 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:46:23,583 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:46:23,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:46:23,583 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:46:23,583 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:46:23,583 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:46:23,583 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:46:23,584 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:46:23,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:46:23,584 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:46:23,584 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:46:23,584 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:46:23,584 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:46:23,584 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c74b9abfd84bef3aa9e712193319c6938e59ac72c91a2b202dc32aee3a54e2e3 [2025-03-04 06:46:23,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:46:23,820 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:46:23,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:46:23,823 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:46:23,824 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:46:23,825 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_06-ptra_nr.i [2025-03-04 06:46:24,967 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a35475891/c3a2cdd8f8794eba95b7d49148e0faed/FLAGfeaed0acd [2025-03-04 06:46:25,292 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:46:25,294 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_06-ptra_nr.i [2025-03-04 06:46:25,318 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a35475891/c3a2cdd8f8794eba95b7d49148e0faed/FLAGfeaed0acd [2025-03-04 06:46:25,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a35475891/c3a2cdd8f8794eba95b7d49148e0faed [2025-03-04 06:46:25,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:46:25,531 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:46:25,532 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:46:25,532 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:46:25,534 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:46:25,535 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:46:25" (1/1) ... [2025-03-04 06:46:25,536 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@137c8116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:25, skipping insertion in model container [2025-03-04 06:46:25,536 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:46:25" (1/1) ... [2025-03-04 06:46:25,566 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:46:25,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:46:25,854 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:46:25,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:46:25,938 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:46:25,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:25 WrapperNode [2025-03-04 06:46:25,939 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:46:25,940 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:46:25,940 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:46:25,940 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:46:25,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:25" (1/1) ... [2025-03-04 06:46:25,958 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:25" (1/1) ... [2025-03-04 06:46:25,977 INFO L138 Inliner]: procedures = 189, calls = 29, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 258 [2025-03-04 06:46:25,978 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:46:25,978 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:46:25,978 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:46:25,978 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:46:25,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:25" (1/1) ... [2025-03-04 06:46:25,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:25" (1/1) ... [2025-03-04 06:46:25,993 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:25" (1/1) ... [2025-03-04 06:46:25,993 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:25" (1/1) ... [2025-03-04 06:46:26,008 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:25" (1/1) ... [2025-03-04 06:46:26,009 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:25" (1/1) ... [2025-03-04 06:46:26,012 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:25" (1/1) ... [2025-03-04 06:46:26,013 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:25" (1/1) ... [2025-03-04 06:46:26,015 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:46:26,016 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:46:26,016 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:46:26,016 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:46:26,017 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:25" (1/1) ... [2025-03-04 06:46:26,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:46:26,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:46:26,045 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-04 06:46:26,050 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-04 06:46:26,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:46:26,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:46:26,066 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:46:26,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:46:26,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:46:26,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 06:46:26,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 06:46:26,067 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 06:46:26,067 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 06:46:26,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:46:26,067 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:46:26,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:46:26,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:46:26,068 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:46:26,166 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:46:26,167 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:46:26,504 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:46:26,505 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:46:26,526 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:46:26,526 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:46:26,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:46:26 BoogieIcfgContainer [2025-03-04 06:46:26,527 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:46:26,530 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:46:26,530 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:46:26,534 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:46:26,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:46:25" (1/3) ... [2025-03-04 06:46:26,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e6eeb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:46:26, skipping insertion in model container [2025-03-04 06:46:26,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:25" (2/3) ... [2025-03-04 06:46:26,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e6eeb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:46:26, skipping insertion in model container [2025-03-04 06:46:26,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:46:26" (3/3) ... [2025-03-04 06:46:26,536 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_06-ptra_nr.i [2025-03-04 06:46:26,546 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:46:26,549 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_06-ptra_nr.i that has 2 procedures, 294 locations, 1 initial locations, 0 loop locations, and 22 error locations. [2025-03-04 06:46:26,549 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:46:26,649 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:46:26,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 297 places, 293 transitions, 590 flow [2025-03-04 06:46:26,776 INFO L124 PetriNetUnfolderBase]: 0/292 cut-off events. [2025-03-04 06:46:26,779 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:46:26,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 292 events. 0/292 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 114 event pairs, 0 based on Foata normal form. 0/270 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-03-04 06:46:26,782 INFO L82 GeneralOperation]: Start removeDead. Operand has 297 places, 293 transitions, 590 flow [2025-03-04 06:46:26,790 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 296 places, 292 transitions, 587 flow [2025-03-04 06:46:26,797 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:46:26,811 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;@51ae8790, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:46:26,811 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-03-04 06:46:26,821 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:46:26,821 INFO L124 PetriNetUnfolderBase]: 0/87 cut-off events. [2025-03-04 06:46:26,822 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:46:26,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:46:26,822 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:46:26,823 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-04 06:46:26,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:46:26,827 INFO L85 PathProgramCache]: Analyzing trace with hash 663189225, now seen corresponding path program 1 times [2025-03-04 06:46:26,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:46:26,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790861972] [2025-03-04 06:46:26,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:46:26,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:46:26,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 06:46:26,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 06:46:26,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:46:26,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:27,522 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-04 06:46:27,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:46:27,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790861972] [2025-03-04 06:46:27,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790861972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:46:27,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:46:27,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:46:27,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557921623] [2025-03-04 06:46:27,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:46:27,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:46:27,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:46:27,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:46:27,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:46:27,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 293 [2025-03-04 06:46:27,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 292 transitions, 587 flow. Second operand has 6 states, 6 states have (on average 224.33333333333334) internal successors, (1346), 6 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:27,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:46:27,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 293 [2025-03-04 06:46:27,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:46:28,196 INFO L124 PetriNetUnfolderBase]: 220/1135 cut-off events. [2025-03-04 06:46:28,197 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:46:28,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1647 conditions, 1135 events. 220/1135 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5615 event pairs, 220 based on Foata normal form. 0/1027 useless extension candidates. Maximal degree in co-relation 1424. Up to 493 conditions per place. [2025-03-04 06:46:28,216 INFO L140 encePairwiseOnDemand]: 275/293 looper letters, 52 selfloop transitions, 15 changer transitions 0/289 dead transitions. [2025-03-04 06:46:28,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 289 transitions, 715 flow [2025-03-04 06:46:28,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:46:28,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:46:28,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1408 transitions. [2025-03-04 06:46:28,228 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.800910125142207 [2025-03-04 06:46:28,229 INFO L175 Difference]: Start difference. First operand has 296 places, 292 transitions, 587 flow. Second operand 6 states and 1408 transitions. [2025-03-04 06:46:28,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 289 transitions, 715 flow [2025-03-04 06:46:28,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 289 transitions, 714 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:46:28,238 INFO L231 Difference]: Finished difference. Result has 297 places, 289 transitions, 610 flow [2025-03-04 06:46:28,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=610, PETRI_PLACES=297, PETRI_TRANSITIONS=289} [2025-03-04 06:46:28,243 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 1 predicate places. [2025-03-04 06:46:28,243 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 289 transitions, 610 flow [2025-03-04 06:46:28,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.33333333333334) internal successors, (1346), 6 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:28,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:46:28,244 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-04 06:46:28,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:46:28,244 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-04 06:46:28,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:46:28,245 INFO L85 PathProgramCache]: Analyzing trace with hash -965088443, now seen corresponding path program 1 times [2025-03-04 06:46:28,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:46:28,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10165964] [2025-03-04 06:46:28,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:46:28,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:46:28,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 06:46:28,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 06:46:28,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:46:28,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:28,601 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-04 06:46:28,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:46:28,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10165964] [2025-03-04 06:46:28,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10165964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:46:28,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:46:28,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:46:28,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270146391] [2025-03-04 06:46:28,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:46:28,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:46:28,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:46:28,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:46:28,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:46:28,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 293 [2025-03-04 06:46:28,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 289 transitions, 610 flow. Second operand has 6 states, 6 states have (on average 224.33333333333334) internal successors, (1346), 6 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:28,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:46:28,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 293 [2025-03-04 06:46:28,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:46:29,106 INFO L124 PetriNetUnfolderBase]: 220/1132 cut-off events. [2025-03-04 06:46:29,107 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:46:29,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1659 conditions, 1132 events. 220/1132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5630 event pairs, 220 based on Foata normal form. 0/1027 useless extension candidates. Maximal degree in co-relation 1449. Up to 493 conditions per place. [2025-03-04 06:46:29,113 INFO L140 encePairwiseOnDemand]: 275/293 looper letters, 52 selfloop transitions, 15 changer transitions 0/286 dead transitions. [2025-03-04 06:46:29,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 286 transitions, 738 flow [2025-03-04 06:46:29,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:46:29,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:46:29,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1408 transitions. [2025-03-04 06:46:29,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.800910125142207 [2025-03-04 06:46:29,119 INFO L175 Difference]: Start difference. First operand has 297 places, 289 transitions, 610 flow. Second operand 6 states and 1408 transitions. [2025-03-04 06:46:29,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 286 transitions, 738 flow [2025-03-04 06:46:29,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 286 transitions, 708 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:46:29,125 INFO L231 Difference]: Finished difference. Result has 294 places, 286 transitions, 604 flow [2025-03-04 06:46:29,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=604, PETRI_PLACES=294, PETRI_TRANSITIONS=286} [2025-03-04 06:46:29,127 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -2 predicate places. [2025-03-04 06:46:29,127 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 286 transitions, 604 flow [2025-03-04 06:46:29,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.33333333333334) internal successors, (1346), 6 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:29,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:46:29,128 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:46:29,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:46:29,128 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-04 06:46:29,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:46:29,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1902688389, now seen corresponding path program 1 times [2025-03-04 06:46:29,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:46:29,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970522166] [2025-03-04 06:46:29,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:46:29,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:46:29,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 06:46:29,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 06:46:29,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:46:29,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:29,186 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-04 06:46:29,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:46:29,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970522166] [2025-03-04 06:46:29,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970522166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:46:29,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:46:29,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:46:29,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140369708] [2025-03-04 06:46:29,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:46:29,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:46:29,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:46:29,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:46:29,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:46:29,210 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 293 [2025-03-04 06:46:29,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 286 transitions, 604 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:29,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:46:29,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 293 [2025-03-04 06:46:29,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:46:29,256 INFO L124 PetriNetUnfolderBase]: 16/421 cut-off events. [2025-03-04 06:46:29,256 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:46:29,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 421 events. 16/421 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 787 event pairs, 16 based on Foata normal form. 0/386 useless extension candidates. Maximal degree in co-relation 291. Up to 47 conditions per place. [2025-03-04 06:46:29,258 INFO L140 encePairwiseOnDemand]: 290/293 looper letters, 14 selfloop transitions, 2 changer transitions 0/285 dead transitions. [2025-03-04 06:46:29,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 285 transitions, 634 flow [2025-03-04 06:46:29,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:46:29,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:46:29,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 845 transitions. [2025-03-04 06:46:29,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9613196814562003 [2025-03-04 06:46:29,261 INFO L175 Difference]: Start difference. First operand has 294 places, 286 transitions, 604 flow. Second operand 3 states and 845 transitions. [2025-03-04 06:46:29,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 285 transitions, 634 flow [2025-03-04 06:46:29,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 285 transitions, 604 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:46:29,264 INFO L231 Difference]: Finished difference. Result has 290 places, 285 transitions, 576 flow [2025-03-04 06:46:29,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=576, PETRI_PLACES=290, PETRI_TRANSITIONS=285} [2025-03-04 06:46:29,266 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -6 predicate places. [2025-03-04 06:46:29,266 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 285 transitions, 576 flow [2025-03-04 06:46:29,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:29,267 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:46:29,267 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:46:29,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:46:29,268 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-04 06:46:29,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:46:29,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1501075089, now seen corresponding path program 1 times [2025-03-04 06:46:29,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:46:29,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888645891] [2025-03-04 06:46:29,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:46:29,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:46:29,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 06:46:29,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 06:46:29,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:46:29,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:29,319 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-04 06:46:29,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:46:29,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888645891] [2025-03-04 06:46:29,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888645891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:46:29,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:46:29,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:46:29,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542010189] [2025-03-04 06:46:29,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:46:29,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:46:29,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:46:29,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:46:29,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:46:29,340 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 293 [2025-03-04 06:46:29,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 285 transitions, 576 flow. Second operand has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:29,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:46:29,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 293 [2025-03-04 06:46:29,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:46:29,383 INFO L124 PetriNetUnfolderBase]: 24/498 cut-off events. [2025-03-04 06:46:29,384 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:46:29,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 498 events. 24/498 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1231 event pairs, 24 based on Foata normal form. 0/465 useless extension candidates. Maximal degree in co-relation 458. Up to 63 conditions per place. [2025-03-04 06:46:29,386 INFO L140 encePairwiseOnDemand]: 287/293 looper letters, 15 selfloop transitions, 1 changer transitions 0/280 dead transitions. [2025-03-04 06:46:29,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 280 transitions, 598 flow [2025-03-04 06:46:29,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:46:29,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:46:29,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 837 transitions. [2025-03-04 06:46:29,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9522184300341296 [2025-03-04 06:46:29,388 INFO L175 Difference]: Start difference. First operand has 290 places, 285 transitions, 576 flow. Second operand 3 states and 837 transitions. [2025-03-04 06:46:29,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 280 transitions, 598 flow [2025-03-04 06:46:29,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 280 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:46:29,391 INFO L231 Difference]: Finished difference. Result has 285 places, 280 transitions, 564 flow [2025-03-04 06:46:29,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=285, PETRI_TRANSITIONS=280} [2025-03-04 06:46:29,392 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -11 predicate places. [2025-03-04 06:46:29,393 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 280 transitions, 564 flow [2025-03-04 06:46:29,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:29,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:46:29,393 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:46:29,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:46:29,393 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-04 06:46:29,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:46:29,394 INFO L85 PathProgramCache]: Analyzing trace with hash -507763959, now seen corresponding path program 1 times [2025-03-04 06:46:29,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:46:29,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50657869] [2025-03-04 06:46:29,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:46:29,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:46:29,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 06:46:29,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 06:46:29,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:46:29,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:29,797 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-04 06:46:29,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:46:29,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50657869] [2025-03-04 06:46:29,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50657869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:46:29,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:46:29,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:46:29,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703699122] [2025-03-04 06:46:29,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:46:29,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:46:29,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:46:29,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:46:29,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:46:30,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 293 [2025-03-04 06:46:30,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 280 transitions, 564 flow. Second operand has 6 states, 6 states have (on average 225.16666666666666) internal successors, (1351), 6 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:30,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:46:30,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 293 [2025-03-04 06:46:30,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:46:30,183 INFO L124 PetriNetUnfolderBase]: 288/1275 cut-off events. [2025-03-04 06:46:30,183 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:46:30,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1928 conditions, 1275 events. 288/1275 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6623 event pairs, 288 based on Foata normal form. 0/1214 useless extension candidates. Maximal degree in co-relation 1807. Up to 643 conditions per place. [2025-03-04 06:46:30,188 INFO L140 encePairwiseOnDemand]: 287/293 looper letters, 66 selfloop transitions, 5 changer transitions 0/279 dead transitions. [2025-03-04 06:46:30,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 279 transitions, 704 flow [2025-03-04 06:46:30,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:46:30,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:46:30,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1398 transitions. [2025-03-04 06:46:30,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7952218430034129 [2025-03-04 06:46:30,191 INFO L175 Difference]: Start difference. First operand has 285 places, 280 transitions, 564 flow. Second operand 6 states and 1398 transitions. [2025-03-04 06:46:30,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 279 transitions, 704 flow [2025-03-04 06:46:30,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 279 transitions, 703 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:46:30,194 INFO L231 Difference]: Finished difference. Result has 288 places, 279 transitions, 571 flow [2025-03-04 06:46:30,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=571, PETRI_PLACES=288, PETRI_TRANSITIONS=279} [2025-03-04 06:46:30,195 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -8 predicate places. [2025-03-04 06:46:30,195 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 279 transitions, 571 flow [2025-03-04 06:46:30,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 225.16666666666666) internal successors, (1351), 6 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:30,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:46:30,199 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:46:30,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:46:30,200 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-04 06:46:30,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:46:30,200 INFO L85 PathProgramCache]: Analyzing trace with hash -661294820, now seen corresponding path program 1 times [2025-03-04 06:46:30,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:46:30,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595372449] [2025-03-04 06:46:30,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:46:30,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:46:30,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 06:46:30,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 06:46:30,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:46:30,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:30,264 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-04 06:46:30,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:46:30,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595372449] [2025-03-04 06:46:30,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595372449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:46:30,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:46:30,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:46:30,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454130719] [2025-03-04 06:46:30,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:46:30,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:46:30,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:46:30,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:46:30,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:46:30,275 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 293 [2025-03-04 06:46:30,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 279 transitions, 571 flow. Second operand has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:30,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:46:30,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 293 [2025-03-04 06:46:30,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:46:30,302 INFO L124 PetriNetUnfolderBase]: 6/342 cut-off events. [2025-03-04 06:46:30,303 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:46:30,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 342 events. 6/342 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 393 event pairs, 6 based on Foata normal form. 0/325 useless extension candidates. Maximal degree in co-relation 266. Up to 23 conditions per place. [2025-03-04 06:46:30,304 INFO L140 encePairwiseOnDemand]: 290/293 looper letters, 10 selfloop transitions, 2 changer transitions 0/278 dead transitions. [2025-03-04 06:46:30,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 278 transitions, 593 flow [2025-03-04 06:46:30,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:46:30,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:46:30,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 853 transitions. [2025-03-04 06:46:30,306 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704209328782708 [2025-03-04 06:46:30,306 INFO L175 Difference]: Start difference. First operand has 288 places, 279 transitions, 571 flow. Second operand 3 states and 853 transitions. [2025-03-04 06:46:30,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 278 transitions, 593 flow [2025-03-04 06:46:30,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 278 transitions, 583 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:46:30,309 INFO L231 Difference]: Finished difference. Result has 284 places, 278 transitions, 563 flow [2025-03-04 06:46:30,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=563, PETRI_PLACES=284, PETRI_TRANSITIONS=278} [2025-03-04 06:46:30,309 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -12 predicate places. [2025-03-04 06:46:30,310 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 278 transitions, 563 flow [2025-03-04 06:46:30,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:30,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:46:30,310 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:46:30,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:46:30,310 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-04 06:46:30,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:46:30,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1062513940, now seen corresponding path program 1 times [2025-03-04 06:46:30,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:46:30,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838763520] [2025-03-04 06:46:30,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:46:30,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:46:30,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 06:46:30,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 06:46:30,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:46:30,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:30,360 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-04 06:46:30,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:46:30,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838763520] [2025-03-04 06:46:30,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838763520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:46:30,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:46:30,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:46:30,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329367443] [2025-03-04 06:46:30,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:46:30,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:46:30,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:46:30,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:46:30,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:46:30,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 284 out of 293 [2025-03-04 06:46:30,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 278 transitions, 563 flow. Second operand has 3 states, 3 states have (on average 285.0) internal successors, (855), 3 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:30,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:46:30,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 284 of 293 [2025-03-04 06:46:30,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:46:30,393 INFO L124 PetriNetUnfolderBase]: 4/339 cut-off events. [2025-03-04 06:46:30,393 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:46:30,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 339 events. 4/339 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 247 event pairs, 4 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 253. Up to 15 conditions per place. [2025-03-04 06:46:30,394 INFO L140 encePairwiseOnDemand]: 291/293 looper letters, 7 selfloop transitions, 1 changer transitions 0/277 dead transitions. [2025-03-04 06:46:30,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 277 transitions, 577 flow [2025-03-04 06:46:30,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:46:30,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:46:30,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 861 transitions. [2025-03-04 06:46:30,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9795221843003413 [2025-03-04 06:46:30,396 INFO L175 Difference]: Start difference. First operand has 284 places, 278 transitions, 563 flow. Second operand 3 states and 861 transitions. [2025-03-04 06:46:30,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 277 transitions, 577 flow [2025-03-04 06:46:30,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 277 transitions, 573 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:46:30,399 INFO L231 Difference]: Finished difference. Result has 283 places, 277 transitions, 559 flow [2025-03-04 06:46:30,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=559, PETRI_PLACES=283, PETRI_TRANSITIONS=277} [2025-03-04 06:46:30,400 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -13 predicate places. [2025-03-04 06:46:30,400 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 277 transitions, 559 flow [2025-03-04 06:46:30,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 285.0) internal successors, (855), 3 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:30,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:46:30,400 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:46:30,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:46:30,401 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-04 06:46:30,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:46:30,401 INFO L85 PathProgramCache]: Analyzing trace with hash 699734421, now seen corresponding path program 1 times [2025-03-04 06:46:30,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:46:30,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453571082] [2025-03-04 06:46:30,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:46:30,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:46:30,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-04 06:46:30,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-04 06:46:30,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:46:30,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:30,839 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-04 06:46:30,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:46:30,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453571082] [2025-03-04 06:46:30,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453571082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:46:30,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:46:30,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:46:30,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865931977] [2025-03-04 06:46:30,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:46:30,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:46:30,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:46:30,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:46:30,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:46:31,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 293 [2025-03-04 06:46:31,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 277 transitions, 559 flow. Second operand has 6 states, 6 states have (on average 234.33333333333334) internal successors, (1406), 6 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:31,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:46:31,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 293 [2025-03-04 06:46:31,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:46:31,379 INFO L124 PetriNetUnfolderBase]: 316/1589 cut-off events. [2025-03-04 06:46:31,379 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:46:31,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2329 conditions, 1589 events. 316/1589 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 9551 event pairs, 43 based on Foata normal form. 0/1500 useless extension candidates. Maximal degree in co-relation 2209. Up to 388 conditions per place. [2025-03-04 06:46:31,385 INFO L140 encePairwiseOnDemand]: 265/293 looper letters, 107 selfloop transitions, 70 changer transitions 0/389 dead transitions. [2025-03-04 06:46:31,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 389 transitions, 1137 flow [2025-03-04 06:46:31,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:46:31,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:46:31,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1547 transitions. [2025-03-04 06:46:31,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8799772468714449 [2025-03-04 06:46:31,388 INFO L175 Difference]: Start difference. First operand has 283 places, 277 transitions, 559 flow. Second operand 6 states and 1547 transitions. [2025-03-04 06:46:31,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 389 transitions, 1137 flow [2025-03-04 06:46:31,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 389 transitions, 1136 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:46:31,395 INFO L231 Difference]: Finished difference. Result has 291 places, 347 transitions, 1036 flow [2025-03-04 06:46:31,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1036, PETRI_PLACES=291, PETRI_TRANSITIONS=347} [2025-03-04 06:46:31,396 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -5 predicate places. [2025-03-04 06:46:31,396 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 347 transitions, 1036 flow [2025-03-04 06:46:31,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 234.33333333333334) internal successors, (1406), 6 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:31,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:46:31,397 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:46:31,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:46:31,397 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-04 06:46:31,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:46:31,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1394376837, now seen corresponding path program 1 times [2025-03-04 06:46:31,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:46:31,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395518943] [2025-03-04 06:46:31,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:46:31,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:46:31,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 06:46:31,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 06:46:31,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:46:31,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:31,777 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-04 06:46:31,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:46:31,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395518943] [2025-03-04 06:46:31,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395518943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:46:31,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:46:31,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:46:31,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763366820] [2025-03-04 06:46:31,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:46:31,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:46:31,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:46:31,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:46:31,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:46:32,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 293 [2025-03-04 06:46:32,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 347 transitions, 1036 flow. Second operand has 6 states, 6 states have (on average 235.16666666666666) internal successors, (1411), 6 states have internal predecessors, (1411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:32,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:46:32,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 293 [2025-03-04 06:46:32,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:46:32,365 INFO L124 PetriNetUnfolderBase]: 588/2368 cut-off events. [2025-03-04 06:46:32,366 INFO L125 PetriNetUnfolderBase]: For 603/609 co-relation queries the response was YES. [2025-03-04 06:46:32,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4766 conditions, 2368 events. 588/2368 cut-off events. For 603/609 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 15342 event pairs, 222 based on Foata normal form. 0/2256 useless extension candidates. Maximal degree in co-relation 4644. Up to 1090 conditions per place. [2025-03-04 06:46:32,376 INFO L140 encePairwiseOnDemand]: 278/293 looper letters, 114 selfloop transitions, 48 changer transitions 0/398 dead transitions. [2025-03-04 06:46:32,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 398 transitions, 1532 flow [2025-03-04 06:46:32,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:46:32,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:46:32,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1484 transitions. [2025-03-04 06:46:32,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8441410693970421 [2025-03-04 06:46:32,379 INFO L175 Difference]: Start difference. First operand has 291 places, 347 transitions, 1036 flow. Second operand 6 states and 1484 transitions. [2025-03-04 06:46:32,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 398 transitions, 1532 flow [2025-03-04 06:46:32,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 398 transitions, 1532 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:46:32,387 INFO L231 Difference]: Finished difference. Result has 301 places, 390 transitions, 1424 flow [2025-03-04 06:46:32,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1424, PETRI_PLACES=301, PETRI_TRANSITIONS=390} [2025-03-04 06:46:32,388 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 5 predicate places. [2025-03-04 06:46:32,388 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 390 transitions, 1424 flow [2025-03-04 06:46:32,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 235.16666666666666) internal successors, (1411), 6 states have internal predecessors, (1411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:32,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:46:32,389 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:46:32,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:46:32,389 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-04 06:46:32,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:46:32,389 INFO L85 PathProgramCache]: Analyzing trace with hash 382575935, now seen corresponding path program 1 times [2025-03-04 06:46:32,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:46:32,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921505205] [2025-03-04 06:46:32,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:46:32,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:46:32,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-04 06:46:32,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-04 06:46:32,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:46:32,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:32,803 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-04 06:46:32,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:46:32,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921505205] [2025-03-04 06:46:32,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921505205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:46:32,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:46:32,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:46:32,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206004687] [2025-03-04 06:46:32,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:46:32,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:46:32,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:46:32,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:46:32,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:46:33,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 293 [2025-03-04 06:46:33,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 390 transitions, 1424 flow. Second operand has 6 states, 6 states have (on average 241.16666666666666) internal successors, (1447), 6 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:33,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:46:33,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 293 [2025-03-04 06:46:33,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:46:33,394 INFO L124 PetriNetUnfolderBase]: 689/2809 cut-off events. [2025-03-04 06:46:33,394 INFO L125 PetriNetUnfolderBase]: For 1552/1608 co-relation queries the response was YES. [2025-03-04 06:46:33,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6391 conditions, 2809 events. 689/2809 cut-off events. For 1552/1608 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 19705 event pairs, 57 based on Foata normal form. 0/2722 useless extension candidates. Maximal degree in co-relation 6262. Up to 932 conditions per place. [2025-03-04 06:46:33,408 INFO L140 encePairwiseOnDemand]: 270/293 looper letters, 135 selfloop transitions, 136 changer transitions 4/530 dead transitions. [2025-03-04 06:46:33,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 530 transitions, 2730 flow [2025-03-04 06:46:33,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:46:33,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:46:33,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1547 transitions. [2025-03-04 06:46:33,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8799772468714449 [2025-03-04 06:46:33,411 INFO L175 Difference]: Start difference. First operand has 301 places, 390 transitions, 1424 flow. Second operand 6 states and 1547 transitions. [2025-03-04 06:46:33,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 530 transitions, 2730 flow [2025-03-04 06:46:33,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 530 transitions, 2712 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-04 06:46:33,428 INFO L231 Difference]: Finished difference. Result has 311 places, 521 transitions, 2772 flow [2025-03-04 06:46:33,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=1406, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2772, PETRI_PLACES=311, PETRI_TRANSITIONS=521} [2025-03-04 06:46:33,430 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 15 predicate places. [2025-03-04 06:46:33,430 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 521 transitions, 2772 flow [2025-03-04 06:46:33,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 241.16666666666666) internal successors, (1447), 6 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:33,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:46:33,431 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:46:33,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:46:33,431 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-04 06:46:33,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:46:33,432 INFO L85 PathProgramCache]: Analyzing trace with hash -432114817, now seen corresponding path program 1 times [2025-03-04 06:46:33,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:46:33,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746893548] [2025-03-04 06:46:33,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:46:33,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:46:33,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-04 06:46:33,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-04 06:46:33,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:46:33,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:33,754 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-04 06:46:33,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:46:33,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746893548] [2025-03-04 06:46:33,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746893548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:46:33,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:46:33,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:46:33,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559320633] [2025-03-04 06:46:33,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:46:33,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:46:33,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:46:33,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:46:33,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:46:33,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 293 [2025-03-04 06:46:33,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 521 transitions, 2772 flow. Second operand has 6 states, 6 states have (on average 235.16666666666666) internal successors, (1411), 6 states have internal predecessors, (1411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:33,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:46:33,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 293 [2025-03-04 06:46:33,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:46:34,371 INFO L124 PetriNetUnfolderBase]: 968/3493 cut-off events. [2025-03-04 06:46:34,371 INFO L125 PetriNetUnfolderBase]: For 3836/3908 co-relation queries the response was YES. [2025-03-04 06:46:34,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9734 conditions, 3493 events. 968/3493 cut-off events. For 3836/3908 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 24929 event pairs, 207 based on Foata normal form. 0/3406 useless extension candidates. Maximal degree in co-relation 9602. Up to 1565 conditions per place. [2025-03-04 06:46:34,392 INFO L140 encePairwiseOnDemand]: 278/293 looper letters, 239 selfloop transitions, 62 changer transitions 0/578 dead transitions. [2025-03-04 06:46:34,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 578 transitions, 3716 flow [2025-03-04 06:46:34,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:46:34,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:46:34,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1484 transitions. [2025-03-04 06:46:34,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8441410693970421 [2025-03-04 06:46:34,395 INFO L175 Difference]: Start difference. First operand has 311 places, 521 transitions, 2772 flow. Second operand 6 states and 1484 transitions. [2025-03-04 06:46:34,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 578 transitions, 3716 flow [2025-03-04 06:46:34,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 578 transitions, 3680 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-03-04 06:46:34,418 INFO L231 Difference]: Finished difference. Result has 321 places, 570 transitions, 3362 flow [2025-03-04 06:46:34,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=2736, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3362, PETRI_PLACES=321, PETRI_TRANSITIONS=570} [2025-03-04 06:46:34,418 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 25 predicate places. [2025-03-04 06:46:34,418 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 570 transitions, 3362 flow [2025-03-04 06:46:34,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 235.16666666666666) internal successors, (1411), 6 states have internal predecessors, (1411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:34,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:46:34,419 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:46:34,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:46:34,419 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-04 06:46:34,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:46:34,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1351092406, now seen corresponding path program 1 times [2025-03-04 06:46:34,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:46:34,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978839042] [2025-03-04 06:46:34,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:46:34,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:46:34,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-04 06:46:34,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-04 06:46:34,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:46:34,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:35,073 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-04 06:46:35,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:46:35,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978839042] [2025-03-04 06:46:35,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978839042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:46:35,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:46:35,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 06:46:35,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073140158] [2025-03-04 06:46:35,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:46:35,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 06:46:35,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:46:35,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 06:46:35,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-04 06:46:36,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 293 [2025-03-04 06:46:36,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 570 transitions, 3362 flow. Second operand has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:36,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:46:36,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 293 [2025-03-04 06:46:36,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:46:37,481 INFO L124 PetriNetUnfolderBase]: 1482/5034 cut-off events. [2025-03-04 06:46:37,481 INFO L125 PetriNetUnfolderBase]: For 8566/8666 co-relation queries the response was YES. [2025-03-04 06:46:37,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16029 conditions, 5034 events. 1482/5034 cut-off events. For 8566/8666 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 40103 event pairs, 100 based on Foata normal form. 47/4999 useless extension candidates. Maximal degree in co-relation 15887. Up to 955 conditions per place. [2025-03-04 06:46:37,521 INFO L140 encePairwiseOnDemand]: 260/293 looper letters, 442 selfloop transitions, 192 changer transitions 1/881 dead transitions. [2025-03-04 06:46:37,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 881 transitions, 7168 flow [2025-03-04 06:46:37,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 06:46:37,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 06:46:37,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4321 transitions. [2025-03-04 06:46:37,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.776181067001976 [2025-03-04 06:46:37,528 INFO L175 Difference]: Start difference. First operand has 321 places, 570 transitions, 3362 flow. Second operand 19 states and 4321 transitions. [2025-03-04 06:46:37,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 881 transitions, 7168 flow [2025-03-04 06:46:37,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 881 transitions, 6986 flow, removed 91 selfloop flow, removed 0 redundant places. [2025-03-04 06:46:37,575 INFO L231 Difference]: Finished difference. Result has 348 places, 701 transitions, 5266 flow [2025-03-04 06:46:37,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=3250, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=5266, PETRI_PLACES=348, PETRI_TRANSITIONS=701} [2025-03-04 06:46:37,577 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 52 predicate places. [2025-03-04 06:46:37,578 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 701 transitions, 5266 flow [2025-03-04 06:46:37,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:37,578 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:46:37,579 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:46:37,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:46:37,579 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-04 06:46:37,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:46:37,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1130547726, now seen corresponding path program 2 times [2025-03-04 06:46:37,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:46:37,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89094684] [2025-03-04 06:46:37,580 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:46:37,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:46:37,602 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 202 statements into 1 equivalence classes. [2025-03-04 06:46:37,616 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-04 06:46:37,617 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:46:37,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:38,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:46:38,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:46:38,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89094684] [2025-03-04 06:46:38,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89094684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:46:38,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:46:38,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 06:46:38,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468149965] [2025-03-04 06:46:38,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:46:38,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 06:46:38,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:46:38,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 06:46:38,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-04 06:46:39,350 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 293 [2025-03-04 06:46:39,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 701 transitions, 5266 flow. Second operand has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:39,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:46:39,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 293 [2025-03-04 06:46:39,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:46:40,845 INFO L124 PetriNetUnfolderBase]: 2096/7121 cut-off events. [2025-03-04 06:46:40,845 INFO L125 PetriNetUnfolderBase]: For 17124/17324 co-relation queries the response was YES. [2025-03-04 06:46:40,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24318 conditions, 7121 events. 2096/7121 cut-off events. For 17124/17324 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 64303 event pairs, 147 based on Foata normal form. 64/7084 useless extension candidates. Maximal degree in co-relation 24163. Up to 1553 conditions per place. [2025-03-04 06:46:40,881 INFO L140 encePairwiseOnDemand]: 256/293 looper letters, 444 selfloop transitions, 258 changer transitions 4/952 dead transitions. [2025-03-04 06:46:40,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 952 transitions, 8766 flow [2025-03-04 06:46:40,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 06:46:40,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 06:46:40,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3289 transitions. [2025-03-04 06:46:40,885 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8018039980497318 [2025-03-04 06:46:40,885 INFO L175 Difference]: Start difference. First operand has 348 places, 701 transitions, 5266 flow. Second operand 14 states and 3289 transitions. [2025-03-04 06:46:40,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 952 transitions, 8766 flow [2025-03-04 06:46:40,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 952 transitions, 8703 flow, removed 14 selfloop flow, removed 5 redundant places. [2025-03-04 06:46:40,955 INFO L231 Difference]: Finished difference. Result has 366 places, 780 transitions, 7383 flow [2025-03-04 06:46:40,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=5225, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=7383, PETRI_PLACES=366, PETRI_TRANSITIONS=780} [2025-03-04 06:46:40,957 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 70 predicate places. [2025-03-04 06:46:40,957 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 780 transitions, 7383 flow [2025-03-04 06:46:40,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:40,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:46:40,959 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:46:40,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:46:40,959 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-04 06:46:40,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:46:40,961 INFO L85 PathProgramCache]: Analyzing trace with hash -501291006, now seen corresponding path program 3 times [2025-03-04 06:46:40,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:46:40,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34209344] [2025-03-04 06:46:40,961 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 06:46:40,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:46:40,990 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 202 statements into 1 equivalence classes. [2025-03-04 06:46:41,006 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-04 06:46:41,006 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 06:46:41,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:41,589 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-04 06:46:41,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:46:41,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34209344] [2025-03-04 06:46:41,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34209344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:46:41,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:46:41,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 06:46:41,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110373995] [2025-03-04 06:46:41,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:46:41,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 06:46:41,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:46:41,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 06:46:41,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-04 06:46:42,407 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 293 [2025-03-04 06:46:42,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 780 transitions, 7383 flow. Second operand has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:42,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:46:42,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 293 [2025-03-04 06:46:42,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:46:43,985 INFO L124 PetriNetUnfolderBase]: 2168/7348 cut-off events. [2025-03-04 06:46:43,985 INFO L125 PetriNetUnfolderBase]: For 26079/26309 co-relation queries the response was YES. [2025-03-04 06:46:44,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27164 conditions, 7348 events. 2168/7348 cut-off events. For 26079/26309 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 66323 event pairs, 208 based on Foata normal form. 82/7316 useless extension candidates. Maximal degree in co-relation 26998. Up to 1395 conditions per place. [2025-03-04 06:46:44,042 INFO L140 encePairwiseOnDemand]: 268/293 looper letters, 538 selfloop transitions, 173 changer transitions 1/958 dead transitions. [2025-03-04 06:46:44,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 958 transitions, 10427 flow [2025-03-04 06:46:44,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 06:46:44,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 06:46:44,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4296 transitions. [2025-03-04 06:46:44,051 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7716903179450332 [2025-03-04 06:46:44,051 INFO L175 Difference]: Start difference. First operand has 366 places, 780 transitions, 7383 flow. Second operand 19 states and 4296 transitions. [2025-03-04 06:46:44,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 958 transitions, 10427 flow [2025-03-04 06:46:44,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 958 transitions, 10422 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 06:46:44,173 INFO L231 Difference]: Finished difference. Result has 390 places, 837 transitions, 8650 flow [2025-03-04 06:46:44,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=7378, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=780, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=623, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=8650, PETRI_PLACES=390, PETRI_TRANSITIONS=837} [2025-03-04 06:46:44,175 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 94 predicate places. [2025-03-04 06:46:44,175 INFO L471 AbstractCegarLoop]: Abstraction has has 390 places, 837 transitions, 8650 flow [2025-03-04 06:46:44,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:44,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:46:44,176 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:46:44,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:46:44,177 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-04 06:46:44,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:46:44,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1819787964, now seen corresponding path program 4 times [2025-03-04 06:46:44,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:46:44,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479854377] [2025-03-04 06:46:44,178 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 06:46:44,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:46:44,213 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 202 statements into 2 equivalence classes. [2025-03-04 06:46:44,228 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 186 of 202 statements. [2025-03-04 06:46:44,229 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 06:46:44,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:44,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:46:44,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:46:44,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479854377] [2025-03-04 06:46:44,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479854377] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:46:44,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506939879] [2025-03-04 06:46:44,739 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 06:46:44,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:46:44,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:46:44,743 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-04 06:46:44,744 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-04 06:46:44,878 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 202 statements into 2 equivalence classes. [2025-03-04 06:46:44,931 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 186 of 202 statements. [2025-03-04 06:46:44,932 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 06:46:44,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:44,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 06:46:44,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:46:44,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 06:46:45,045 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 06:46:45,045 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-04 06:46:45,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 06:46:45,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-04 06:46:45,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:46:45,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-03-04 06:46:45,170 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 06:46:45,171 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-04 06:46:45,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:46:45,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-03-04 06:46:45,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2025-03-04 06:46:45,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:46:45,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:46:45,301 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1838) c_~A~0.base) c_~A~0.offset) 0)) (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1838) c_~A~0.base) (+ c_~A~0.offset 1)) 0)) (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1838) c_~A~0.base) (+ c_~A~0.offset 3)) 0)) (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1838) c_~A~0.base) (+ c_~A~0.offset 2)) 0))) is different from false [2025-03-04 06:46:45,339 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1838) c_~A~0.base) (+ c_~A~0.offset 1)) 0)) (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1838) c_~A~0.base) c_~A~0.offset) 0)) (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1838) c_~A~0.base) (+ c_~A~0.offset 2)) 0)) (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1838) c_~A~0.base) (+ c_~A~0.offset 3)) 0))) is different from false [2025-03-04 06:46:45,467 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 3))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_1838) c_~A~0.base) (+ c_~A~0.offset 2)) 0)) (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_1838) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_1838) c_~A~0.base) (+ c_~A~0.offset 1)) 0)) (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_1838) c_~A~0.base) c_~A~0.offset) 0))))) is different from false [2025-03-04 06:46:45,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:46:45,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 49 [2025-03-04 06:46:45,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:46:45,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 34 [2025-03-04 06:46:45,839 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2025-03-04 06:46:45,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1 [2025-03-04 06:46:45,845 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2025-03-04 06:46:45,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1 [2025-03-04 06:46:45,849 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2025-03-04 06:46:45,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1 [2025-03-04 06:46:46,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:46:46,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506939879] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:46:46,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:46:46,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2025-03-04 06:46:46,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93730303] [2025-03-04 06:46:46,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:46:46,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 06:46:46,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:46:46,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 06:46:46,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=297, Unknown=25, NotChecked=114, Total=506 [2025-03-04 06:46:46,004 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 293 [2025-03-04 06:46:46,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 837 transitions, 8650 flow. Second operand has 23 states, 23 states have (on average 182.69565217391303) internal successors, (4202), 23 states have internal predecessors, (4202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:46,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:46:46,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 293 [2025-03-04 06:46:46,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:46:50,051 INFO L124 PetriNetUnfolderBase]: 4644/12994 cut-off events. [2025-03-04 06:46:50,051 INFO L125 PetriNetUnfolderBase]: For 51642/51974 co-relation queries the response was YES. [2025-03-04 06:46:50,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51997 conditions, 12994 events. 4644/12994 cut-off events. For 51642/51974 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 123128 event pairs, 859 based on Foata normal form. 80/12870 useless extension candidates. Maximal degree in co-relation 51816. Up to 3057 conditions per place. [2025-03-04 06:46:50,157 INFO L140 encePairwiseOnDemand]: 256/293 looper letters, 812 selfloop transitions, 295 changer transitions 8/1286 dead transitions. [2025-03-04 06:46:50,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 1286 transitions, 14874 flow [2025-03-04 06:46:50,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 06:46:50,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 06:46:50,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3079 transitions. [2025-03-04 06:46:50,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7005688282138794 [2025-03-04 06:46:50,161 INFO L175 Difference]: Start difference. First operand has 390 places, 837 transitions, 8650 flow. Second operand 15 states and 3079 transitions. [2025-03-04 06:46:50,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 1286 transitions, 14874 flow [2025-03-04 06:46:50,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 1286 transitions, 14743 flow, removed 33 selfloop flow, removed 9 redundant places. [2025-03-04 06:46:50,378 INFO L231 Difference]: Finished difference. Result has 406 places, 923 transitions, 11320 flow [2025-03-04 06:46:50,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=8554, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=837, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=210, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=11320, PETRI_PLACES=406, PETRI_TRANSITIONS=923} [2025-03-04 06:46:50,378 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 110 predicate places. [2025-03-04 06:46:50,379 INFO L471 AbstractCegarLoop]: Abstraction has has 406 places, 923 transitions, 11320 flow [2025-03-04 06:46:50,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 182.69565217391303) internal successors, (4202), 23 states have internal predecessors, (4202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:50,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:46:50,380 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:46:50,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 06:46:50,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 06:46:50,581 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-04 06:46:50,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:46:50,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1003667844, now seen corresponding path program 1 times [2025-03-04 06:46:50,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:46:50,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573981948] [2025-03-04 06:46:50,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:46:50,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:46:50,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-04 06:46:50,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-04 06:46:50,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:46:50,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:51,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:46:51,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:46:51,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573981948] [2025-03-04 06:46:51,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573981948] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:46:51,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352674832] [2025-03-04 06:46:51,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:46:51,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:46:51,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:46:51,589 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-04 06:46:51,592 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-04 06:46:51,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-04 06:46:51,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-04 06:46:51,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:46:51,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:51,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 06:46:51,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:46:51,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 06:46:51,899 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 06:46:51,899 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-04 06:46:51,946 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 06:46:51,947 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-04 06:46:51,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 06:46:52,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-04 06:46:52,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:46:52,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2025-03-04 06:46:52,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:46:52,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2025-03-04 06:46:52,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-03-04 06:46:52,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:46:52,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:46:52,134 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2142 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet3#1| (select (select (store |c_#race| c_~A~0.base v_ArrVal_2142) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 7)))) (forall ((v_ArrVal_2142 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet3#1| (select (select (store |c_#race| c_~A~0.base v_ArrVal_2142) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 6)))) (forall ((v_ArrVal_2142 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_2142) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 4)) |c_t_funThread1of1ForFork0_init_#t~nondet3#1|)) (forall ((v_ArrVal_2142 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_2142) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 5)) |c_t_funThread1of1ForFork0_init_#t~nondet3#1|))) is different from false [2025-03-04 06:46:52,144 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 7))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1 |c_t_funThread1of1ForFork0_init_#t~nondet3#1|)))) (and (forall ((v_ArrVal_2142 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet3#1| (select (select (store .cse0 c_~A~0.base v_ArrVal_2142) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 5)))) (forall ((v_ArrVal_2142 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet3#1| (select (select (store .cse0 c_~A~0.base v_ArrVal_2142) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 4)))) (forall ((v_ArrVal_2142 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet3#1| (select (select (store .cse0 c_~A~0.base v_ArrVal_2142) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 6)))) (forall ((v_ArrVal_2142 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_2142) |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1) |c_t_funThread1of1ForFork0_init_#t~nondet3#1|))))) is different from false [2025-03-04 06:46:55,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:46:55,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53 [2025-03-04 06:46:55,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:46:55,885 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 70 treesize of output 28 [2025-03-04 06:46:55,890 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-04 06:46:55,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-03-04 06:46:55,894 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-04 06:46:55,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-03-04 06:46:55,898 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-04 06:46:55,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-03-04 06:46:56,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:46:56,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352674832] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:46:56,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:46:56,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2025-03-04 06:46:56,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301433329] [2025-03-04 06:46:56,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:46:56,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 06:46:56,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:46:56,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 06:46:56,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=584, Unknown=37, NotChecked=102, Total=812 [2025-03-04 06:46:56,087 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 293 [2025-03-04 06:46:56,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 923 transitions, 11320 flow. Second operand has 29 states, 29 states have (on average 181.17241379310346) internal successors, (5254), 29 states have internal predecessors, (5254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:56,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:46:56,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 293 [2025-03-04 06:46:56,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:46:59,535 INFO L124 PetriNetUnfolderBase]: 4794/13342 cut-off events. [2025-03-04 06:46:59,536 INFO L125 PetriNetUnfolderBase]: For 68816/69094 co-relation queries the response was YES. [2025-03-04 06:46:59,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55817 conditions, 13342 events. 4794/13342 cut-off events. For 68816/69094 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 126706 event pairs, 977 based on Foata normal form. 83/13211 useless extension candidates. Maximal degree in co-relation 55625. Up to 4690 conditions per place. [2025-03-04 06:46:59,660 INFO L140 encePairwiseOnDemand]: 271/293 looper letters, 782 selfloop transitions, 174 changer transitions 0/1124 dead transitions. [2025-03-04 06:46:59,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 1124 transitions, 15696 flow [2025-03-04 06:46:59,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 06:46:59,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 06:46:59,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2893 transitions. [2025-03-04 06:46:59,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6582480091012515 [2025-03-04 06:46:59,662 INFO L175 Difference]: Start difference. First operand has 406 places, 923 transitions, 11320 flow. Second operand 15 states and 2893 transitions. [2025-03-04 06:46:59,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 1124 transitions, 15696 flow [2025-03-04 06:46:59,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 1124 transitions, 15645 flow, removed 23 selfloop flow, removed 3 redundant places. [2025-03-04 06:46:59,889 INFO L231 Difference]: Finished difference. Result has 422 places, 938 transitions, 12105 flow [2025-03-04 06:46:59,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=11289, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=923, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=752, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=12105, PETRI_PLACES=422, PETRI_TRANSITIONS=938} [2025-03-04 06:46:59,891 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 126 predicate places. [2025-03-04 06:46:59,891 INFO L471 AbstractCegarLoop]: Abstraction has has 422 places, 938 transitions, 12105 flow [2025-03-04 06:46:59,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 181.17241379310346) internal successors, (5254), 29 states have internal predecessors, (5254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:59,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:46:59,895 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:46:59,903 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-04 06:47:00,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 06:47:00,095 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-04 06:47:00,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:00,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1371852126, now seen corresponding path program 5 times [2025-03-04 06:47:00,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:00,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016005326] [2025-03-04 06:47:00,096 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 06:47:00,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:00,117 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 202 statements into 2 equivalence classes. [2025-03-04 06:47:00,138 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 202 of 202 statements. [2025-03-04 06:47:00,138 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:47:00,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:00,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:00,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:00,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016005326] [2025-03-04 06:47:00,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016005326] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:47:00,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4507810] [2025-03-04 06:47:00,837 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 06:47:00,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:47:00,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:47:00,839 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-04 06:47:00,841 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-04 06:47:00,982 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 202 statements into 2 equivalence classes. [2025-03-04 06:47:01,136 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 202 of 202 statements. [2025-03-04 06:47:01,136 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:47:01,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:01,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 06:47:01,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:47:01,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 06:47:01,254 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 06:47:01,255 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-04 06:47:01,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 06:47:01,407 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 19 treesize of output 18 [2025-03-04 06:47:01,447 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 06:47:01,447 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-04 06:47:01,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-03-04 06:47:01,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2025-03-04 06:47:01,646 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 37 treesize of output 26 [2025-03-04 06:47:01,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:01,667 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:47:01,922 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 3))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_2446 (Array Int Int))) (= 0 (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_2446) c_~A~0.base) (+ c_~A~0.offset 1)))) (forall ((v_ArrVal_2446 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_2446) c_~A~0.base) c_~A~0.offset) 0)) (forall ((v_ArrVal_2446 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_2446) c_~A~0.base) (+ c_~A~0.offset 2)) 0)) (forall ((v_ArrVal_2446 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_2446) c_~A~0.base) .cse1) 0))))) is different from false [2025-03-04 06:47:01,932 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset 2)) (.cse1 (+ c_~A~0.offset 3))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (select |c_#race| c_~A~0.base) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_2446 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_2446) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_2446 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_2446) c_~A~0.base) c_~A~0.offset) 0)) (forall ((v_ArrVal_2446 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_2446) c_~A~0.base) (+ c_~A~0.offset 1)) 0)) (forall ((v_ArrVal_2446 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_2446) c_~A~0.base) .cse2) 0))))) is different from false [2025-03-04 06:47:02,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:47:02,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 51 [2025-03-04 06:47:02,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:47:02,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 36 [2025-03-04 06:47:02,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 06:47:02,149 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2025-03-04 06:47:02,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1 [2025-03-04 06:47:02,153 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2025-03-04 06:47:02,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1 [2025-03-04 06:47:02,157 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2025-03-04 06:47:02,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1 [2025-03-04 06:47:02,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:02,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4507810] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:47:02,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:47:02,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 12] total 36 [2025-03-04 06:47:02,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022532888] [2025-03-04 06:47:02,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:47:02,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-04 06:47:02,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:02,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-04 06:47:02,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1007, Unknown=46, NotChecked=134, Total=1332 [2025-03-04 06:47:02,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 293 [2025-03-04 06:47:02,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 938 transitions, 12105 flow. Second operand has 37 states, 37 states have (on average 171.86486486486487) internal successors, (6359), 37 states have internal predecessors, (6359), 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-04 06:47:02,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:02,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 293 [2025-03-04 06:47:02,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:08,620 INFO L124 PetriNetUnfolderBase]: 6685/18730 cut-off events. [2025-03-04 06:47:08,620 INFO L125 PetriNetUnfolderBase]: For 106624/107140 co-relation queries the response was YES. [2025-03-04 06:47:08,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81935 conditions, 18730 events. 6685/18730 cut-off events. For 106624/107140 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 193732 event pairs, 1317 based on Foata normal form. 139/18598 useless extension candidates. Maximal degree in co-relation 81732. Up to 5974 conditions per place. [2025-03-04 06:47:08,775 INFO L140 encePairwiseOnDemand]: 252/293 looper letters, 777 selfloop transitions, 454 changer transitions 6/1398 dead transitions. [2025-03-04 06:47:08,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 1398 transitions, 20000 flow [2025-03-04 06:47:08,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 06:47:08,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 06:47:08,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3541 transitions. [2025-03-04 06:47:08,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6360696964253637 [2025-03-04 06:47:08,777 INFO L175 Difference]: Start difference. First operand has 422 places, 938 transitions, 12105 flow. Second operand 19 states and 3541 transitions. [2025-03-04 06:47:08,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 1398 transitions, 20000 flow [2025-03-04 06:47:09,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 1398 transitions, 19803 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-03-04 06:47:09,180 INFO L231 Difference]: Finished difference. Result has 441 places, 1075 transitions, 16747 flow [2025-03-04 06:47:09,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=11993, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=938, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=325, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=16747, PETRI_PLACES=441, PETRI_TRANSITIONS=1075} [2025-03-04 06:47:09,181 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 145 predicate places. [2025-03-04 06:47:09,181 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 1075 transitions, 16747 flow [2025-03-04 06:47:09,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 171.86486486486487) internal successors, (6359), 37 states have internal predecessors, (6359), 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-04 06:47:09,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:09,183 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:47:09,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 06:47:09,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:47:09,384 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-04 06:47:09,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:09,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1946691346, now seen corresponding path program 6 times [2025-03-04 06:47:09,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:09,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576982021] [2025-03-04 06:47:09,385 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 06:47:09,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:09,405 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 202 statements into 2 equivalence classes. [2025-03-04 06:47:09,421 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 202 of 202 statements. [2025-03-04 06:47:09,421 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 06:47:09,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:10,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:10,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:10,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576982021] [2025-03-04 06:47:10,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576982021] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:47:10,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510820714] [2025-03-04 06:47:10,212 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 06:47:10,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:47:10,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:47:10,214 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-04 06:47:10,216 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-04 06:47:10,363 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 202 statements into 2 equivalence classes. [2025-03-04 06:47:10,841 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 202 of 202 statements. [2025-03-04 06:47:10,841 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 06:47:10,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:10,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-04 06:47:10,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:47:10,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 06:47:10,971 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 06:47:10,971 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-04 06:47:11,081 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 06:47:11,082 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-04 06:47:11,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 06:47:11,164 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 21 treesize of output 20 [2025-03-04 06:47:11,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2025-03-04 06:47:11,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2025-03-04 06:47:11,313 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 54 treesize of output 47 [2025-03-04 06:47:11,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:11,335 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:47:31,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:31,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510820714] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:47:31,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:47:31,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2025-03-04 06:47:31,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041959001] [2025-03-04 06:47:31,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:47:31,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-04 06:47:31,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:31,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 06:47:31,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1010, Unknown=5, NotChecked=0, Total=1190 [2025-03-04 06:47:35,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 06:47:40,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 06:47:44,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 06:47:48,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 06:47:52,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]