./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 a98c974c803b808e0d7e2f56f44a4386aecc7f9a41003cc6d1be849c6b132112 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:23:31,478 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:23:31,536 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:23:31,542 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:23:31,546 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:23:31,566 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:23:31,568 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:23:31,568 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:23:31,569 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:23:31,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:23:31,570 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:23:31,570 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:23:31,570 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:23:31,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:23:31,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:23:31,571 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:23:31,571 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:23:31,571 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:23:31,571 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:23:31,571 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:23:31,571 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:23:31,571 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:23:31,571 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:23:31,571 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:23:31,571 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:23:31,571 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:23:31,571 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:23:31,571 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:23:31,571 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:23:31,572 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:23:31,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:23:31,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:23:31,572 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:23:31,572 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:23:31,572 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:23:31,572 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:23:31,573 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:23:31,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:23:31,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:23:31,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:23:31,573 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:23:31,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:23:31,573 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-jdk21/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 -> a98c974c803b808e0d7e2f56f44a4386aecc7f9a41003cc6d1be849c6b132112 [2025-02-06 09:23:31,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:23:31,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:23:31,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:23:31,838 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:23:31,838 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:23:31,839 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i [2025-02-06 09:23:32,960 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1dc8b7e59/2287b844b5414229bea01784f383ebd3/FLAG4f9cee0cf [2025-02-06 09:23:33,296 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:23:33,298 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i [2025-02-06 09:23:33,315 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1dc8b7e59/2287b844b5414229bea01784f383ebd3/FLAG4f9cee0cf [2025-02-06 09:23:33,539 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1dc8b7e59/2287b844b5414229bea01784f383ebd3 [2025-02-06 09:23:33,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:23:33,543 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:23:33,544 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:23:33,544 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:23:33,547 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:23:33,548 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:23:33" (1/1) ... [2025-02-06 09:23:33,549 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62ef2832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:33, skipping insertion in model container [2025-02-06 09:23:33,550 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:23:33" (1/1) ... [2025-02-06 09:23:33,582 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:23:33,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:23:33,959 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:23:34,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:23:34,059 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:23:34,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:34 WrapperNode [2025-02-06 09:23:34,060 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:23:34,061 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:23:34,061 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:23:34,061 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:23:34,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:34" (1/1) ... [2025-02-06 09:23:34,076 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:34" (1/1) ... [2025-02-06 09:23:34,102 INFO L138 Inliner]: procedures = 370, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 243 [2025-02-06 09:23:34,102 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:23:34,102 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:23:34,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:23:34,103 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:23:34,107 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:34" (1/1) ... [2025-02-06 09:23:34,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:34" (1/1) ... [2025-02-06 09:23:34,111 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:34" (1/1) ... [2025-02-06 09:23:34,111 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:34" (1/1) ... [2025-02-06 09:23:34,123 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:34" (1/1) ... [2025-02-06 09:23:34,125 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:34" (1/1) ... [2025-02-06 09:23:34,131 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:34" (1/1) ... [2025-02-06 09:23:34,132 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:34" (1/1) ... [2025-02-06 09:23:34,134 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:23:34,135 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:23:34,135 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:23:34,135 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:23:34,140 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:34" (1/1) ... [2025-02-06 09:23:34,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:23:34,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:23:34,168 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:23:34,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:23:34,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 09:23:34,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-06 09:23:34,187 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 09:23:34,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:23:34,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:23:34,187 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 09:23:34,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:23:34,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:23:34,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 09:23:34,187 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 09:23:34,187 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 09:23:34,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:23:34,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:23:34,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:23:34,189 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:23:34,307 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:23:34,309 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:23:34,698 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:23:34,698 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:23:34,717 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:23:34,721 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:23:34,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:23:34 BoogieIcfgContainer [2025-02-06 09:23:34,722 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:23:34,724 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:23:34,724 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:23:34,728 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:23:34,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:23:33" (1/3) ... [2025-02-06 09:23:34,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@689ffb1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:23:34, skipping insertion in model container [2025-02-06 09:23:34,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:34" (2/3) ... [2025-02-06 09:23:34,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@689ffb1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:23:34, skipping insertion in model container [2025-02-06 09:23:34,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:23:34" (3/3) ... [2025-02-06 09:23:34,730 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_26-alloc_region_rc.i [2025-02-06 09:23:34,743 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:23:34,745 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_26-alloc_region_rc.i that has 2 procedures, 273 locations, 1 initial locations, 1 loop locations, and 20 error locations. [2025-02-06 09:23:34,745 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:23:34,821 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:23:34,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 276 places, 274 transitions, 552 flow [2025-02-06 09:23:34,932 INFO L124 PetriNetUnfolderBase]: 2/273 cut-off events. [2025-02-06 09:23:34,934 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:23:34,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 273 events. 2/273 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 275 event pairs, 0 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 203. Up to 2 conditions per place. [2025-02-06 09:23:34,940 INFO L82 GeneralOperation]: Start removeDead. Operand has 276 places, 274 transitions, 552 flow [2025-02-06 09:23:34,946 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 275 places, 273 transitions, 549 flow [2025-02-06 09:23:34,952 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:23:34,963 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;@99c92b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:23:34,965 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-02-06 09:23:34,971 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:23:34,972 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-02-06 09:23:34,972 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:23:34,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:34,972 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] [2025-02-06 09:23:34,973 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-06 09:23:34,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:34,977 INFO L85 PathProgramCache]: Analyzing trace with hash -858809879, now seen corresponding path program 1 times [2025-02-06 09:23:34,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:34,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248619286] [2025-02-06 09:23:34,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:34,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:35,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 09:23:35,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 09:23:35,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:35,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:35,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:23:35,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:35,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248619286] [2025-02-06 09:23:35,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248619286] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:35,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:35,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:23:35,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425432581] [2025-02-06 09:23:35,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:35,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:23:35,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:35,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:23:35,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:23:35,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 274 [2025-02-06 09:23:35,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 273 transitions, 549 flow. Second operand has 6 states, 6 states have (on average 176.33333333333334) internal successors, (1058), 6 states have internal predecessors, (1058), 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-02-06 09:23:35,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:35,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 274 [2025-02-06 09:23:35,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:36,640 INFO L124 PetriNetUnfolderBase]: 1377/5040 cut-off events. [2025-02-06 09:23:36,640 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:23:36,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7834 conditions, 5040 events. 1377/5040 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 37831 event pairs, 1344 based on Foata normal form. 36/4711 useless extension candidates. Maximal degree in co-relation 7737. Up to 2785 conditions per place. [2025-02-06 09:23:36,672 INFO L140 encePairwiseOnDemand]: 267/274 looper letters, 92 selfloop transitions, 5 changer transitions 0/271 dead transitions. [2025-02-06 09:23:36,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 271 transitions, 739 flow [2025-02-06 09:23:36,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:23:36,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:23:36,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1149 transitions. [2025-02-06 09:23:36,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.698905109489051 [2025-02-06 09:23:36,692 INFO L175 Difference]: Start difference. First operand has 275 places, 273 transitions, 549 flow. Second operand 6 states and 1149 transitions. [2025-02-06 09:23:36,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 271 transitions, 739 flow [2025-02-06 09:23:36,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 271 transitions, 738 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:23:36,741 INFO L231 Difference]: Finished difference. Result has 278 places, 271 transitions, 554 flow [2025-02-06 09:23:36,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=554, PETRI_PLACES=278, PETRI_TRANSITIONS=271} [2025-02-06 09:23:36,746 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, 3 predicate places. [2025-02-06 09:23:36,747 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 271 transitions, 554 flow [2025-02-06 09:23:36,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 176.33333333333334) internal successors, (1058), 6 states have internal predecessors, (1058), 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-02-06 09:23:36,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:36,748 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] [2025-02-06 09:23:36,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:23:36,748 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-06 09:23:36,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:36,749 INFO L85 PathProgramCache]: Analyzing trace with hash -590599792, now seen corresponding path program 1 times [2025-02-06 09:23:36,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:36,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312758307] [2025-02-06 09:23:36,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:36,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:36,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 09:23:36,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 09:23:36,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:36,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:37,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:23:37,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:37,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312758307] [2025-02-06 09:23:37,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312758307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:37,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:37,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:23:37,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877038015] [2025-02-06 09:23:37,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:37,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:23:37,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:37,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:23:37,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:23:37,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 274 [2025-02-06 09:23:37,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 271 transitions, 554 flow. Second operand has 6 states, 6 states have (on average 203.83333333333334) internal successors, (1223), 6 states have internal predecessors, (1223), 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-02-06 09:23:37,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:37,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 274 [2025-02-06 09:23:37,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:38,164 INFO L124 PetriNetUnfolderBase]: 762/4119 cut-off events. [2025-02-06 09:23:38,165 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:23:38,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5703 conditions, 4119 events. 762/4119 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 31782 event pairs, 460 based on Foata normal form. 0/3759 useless extension candidates. Maximal degree in co-relation 5656. Up to 1372 conditions per place. [2025-02-06 09:23:38,181 INFO L140 encePairwiseOnDemand]: 242/274 looper letters, 81 selfloop transitions, 90 changer transitions 0/371 dead transitions. [2025-02-06 09:23:38,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 371 transitions, 1096 flow [2025-02-06 09:23:38,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:23:38,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:23:38,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1385 transitions. [2025-02-06 09:23:38,184 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8424574209245742 [2025-02-06 09:23:38,184 INFO L175 Difference]: Start difference. First operand has 278 places, 271 transitions, 554 flow. Second operand 6 states and 1385 transitions. [2025-02-06 09:23:38,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 371 transitions, 1096 flow [2025-02-06 09:23:38,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 371 transitions, 1086 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:23:38,191 INFO L231 Difference]: Finished difference. Result has 282 places, 354 transitions, 1120 flow [2025-02-06 09:23:38,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1120, PETRI_PLACES=282, PETRI_TRANSITIONS=354} [2025-02-06 09:23:38,192 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, 7 predicate places. [2025-02-06 09:23:38,192 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 354 transitions, 1120 flow [2025-02-06 09:23:38,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 203.83333333333334) internal successors, (1223), 6 states have internal predecessors, (1223), 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-02-06 09:23:38,193 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:38,193 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] [2025-02-06 09:23:38,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:23:38,193 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-06 09:23:38,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:38,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1091257787, now seen corresponding path program 1 times [2025-02-06 09:23:38,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:38,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697742648] [2025-02-06 09:23:38,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:38,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:38,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 09:23:38,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 09:23:38,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:38,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:38,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:23:38,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:38,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697742648] [2025-02-06 09:23:38,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697742648] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:38,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:38,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:23:38,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431426747] [2025-02-06 09:23:38,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:38,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:23:38,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:38,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:23:38,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:23:38,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 274 [2025-02-06 09:23:38,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 354 transitions, 1120 flow. Second operand has 6 states, 6 states have (on average 180.66666666666666) internal successors, (1084), 6 states have internal predecessors, (1084), 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-02-06 09:23:38,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:38,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 274 [2025-02-06 09:23:38,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:39,763 INFO L124 PetriNetUnfolderBase]: 2110/7468 cut-off events. [2025-02-06 09:23:39,763 INFO L125 PetriNetUnfolderBase]: For 1549/1553 co-relation queries the response was YES. [2025-02-06 09:23:39,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13898 conditions, 7468 events. 2110/7468 cut-off events. For 1549/1553 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 60633 event pairs, 1264 based on Foata normal form. 0/6849 useless extension candidates. Maximal degree in co-relation 13793. Up to 4041 conditions per place. [2025-02-06 09:23:39,799 INFO L140 encePairwiseOnDemand]: 233/274 looper letters, 187 selfloop transitions, 123 changer transitions 0/486 dead transitions. [2025-02-06 09:23:39,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 486 transitions, 2164 flow [2025-02-06 09:23:39,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:23:39,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:23:39,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1297 transitions. [2025-02-06 09:23:39,802 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7889294403892944 [2025-02-06 09:23:39,802 INFO L175 Difference]: Start difference. First operand has 282 places, 354 transitions, 1120 flow. Second operand 6 states and 1297 transitions. [2025-02-06 09:23:39,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 486 transitions, 2164 flow [2025-02-06 09:23:39,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 486 transitions, 2164 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:23:39,813 INFO L231 Difference]: Finished difference. Result has 291 places, 470 transitions, 2072 flow [2025-02-06 09:23:39,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=1118, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2072, PETRI_PLACES=291, PETRI_TRANSITIONS=470} [2025-02-06 09:23:39,814 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, 16 predicate places. [2025-02-06 09:23:39,814 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 470 transitions, 2072 flow [2025-02-06 09:23:39,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 180.66666666666666) internal successors, (1084), 6 states have internal predecessors, (1084), 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-02-06 09:23:39,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:39,815 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] [2025-02-06 09:23:39,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:23:39,815 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-06 09:23:39,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:39,816 INFO L85 PathProgramCache]: Analyzing trace with hash 206953608, now seen corresponding path program 1 times [2025-02-06 09:23:39,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:39,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792343949] [2025-02-06 09:23:39,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:39,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:39,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 09:23:39,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 09:23:39,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:39,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:40,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:23:40,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:40,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792343949] [2025-02-06 09:23:40,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792343949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:40,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:40,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:23:40,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930717783] [2025-02-06 09:23:40,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:40,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:23:40,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:40,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:23:40,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:23:40,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 274 [2025-02-06 09:23:40,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 470 transitions, 2072 flow. Second operand has 6 states, 6 states have (on average 180.66666666666666) internal successors, (1084), 6 states have internal predecessors, (1084), 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-02-06 09:23:40,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:40,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 274 [2025-02-06 09:23:40,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:41,340 INFO L124 PetriNetUnfolderBase]: 2410/8411 cut-off events. [2025-02-06 09:23:41,340 INFO L125 PetriNetUnfolderBase]: For 3681/3691 co-relation queries the response was YES. [2025-02-06 09:23:41,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17859 conditions, 8411 events. 2410/8411 cut-off events. For 3681/3691 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 68867 event pairs, 1292 based on Foata normal form. 0/7766 useless extension candidates. Maximal degree in co-relation 17740. Up to 4365 conditions per place. [2025-02-06 09:23:41,378 INFO L140 encePairwiseOnDemand]: 233/274 looper letters, 299 selfloop transitions, 123 changer transitions 0/602 dead transitions. [2025-02-06 09:23:41,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 602 transitions, 3564 flow [2025-02-06 09:23:41,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:23:41,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:23:41,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1297 transitions. [2025-02-06 09:23:41,381 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7889294403892944 [2025-02-06 09:23:41,381 INFO L175 Difference]: Start difference. First operand has 291 places, 470 transitions, 2072 flow. Second operand 6 states and 1297 transitions. [2025-02-06 09:23:41,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 602 transitions, 3564 flow [2025-02-06 09:23:41,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 602 transitions, 3404 flow, removed 80 selfloop flow, removed 0 redundant places. [2025-02-06 09:23:41,397 INFO L231 Difference]: Finished difference. Result has 300 places, 586 transitions, 3088 flow [2025-02-06 09:23:41,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=1910, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3088, PETRI_PLACES=300, PETRI_TRANSITIONS=586} [2025-02-06 09:23:41,398 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, 25 predicate places. [2025-02-06 09:23:41,398 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 586 transitions, 3088 flow [2025-02-06 09:23:41,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 180.66666666666666) internal successors, (1084), 6 states have internal predecessors, (1084), 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-02-06 09:23:41,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:41,399 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] [2025-02-06 09:23:41,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:23:41,400 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-06 09:23:41,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:41,400 INFO L85 PathProgramCache]: Analyzing trace with hash -63678775, now seen corresponding path program 1 times [2025-02-06 09:23:41,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:41,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023350698] [2025-02-06 09:23:41,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:41,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:41,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-06 09:23:41,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-06 09:23:41,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:41,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:41,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-02-06 09:23:41,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:41,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023350698] [2025-02-06 09:23:41,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023350698] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:41,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:41,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:23:41,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489279364] [2025-02-06 09:23:41,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:41,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:23:41,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:41,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:23:41,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:23:42,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 274 [2025-02-06 09:23:42,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 586 transitions, 3088 flow. Second operand has 6 states, 6 states have (on average 185.16666666666666) internal successors, (1111), 6 states have internal predecessors, (1111), 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-02-06 09:23:42,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:42,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 274 [2025-02-06 09:23:42,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:43,335 INFO L124 PetriNetUnfolderBase]: 2735/9234 cut-off events. [2025-02-06 09:23:43,336 INFO L125 PetriNetUnfolderBase]: For 5327/5391 co-relation queries the response was YES. [2025-02-06 09:23:43,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21733 conditions, 9234 events. 2735/9234 cut-off events. For 5327/5391 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 76037 event pairs, 1246 based on Foata normal form. 0/8561 useless extension candidates. Maximal degree in co-relation 21601. Up to 4881 conditions per place. [2025-02-06 09:23:43,385 INFO L140 encePairwiseOnDemand]: 231/274 looper letters, 360 selfloop transitions, 180 changer transitions 0/769 dead transitions. [2025-02-06 09:23:43,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 769 transitions, 4756 flow [2025-02-06 09:23:43,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:23:43,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:23:43,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1344 transitions. [2025-02-06 09:23:43,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8175182481751825 [2025-02-06 09:23:43,389 INFO L175 Difference]: Start difference. First operand has 300 places, 586 transitions, 3088 flow. Second operand 6 states and 1344 transitions. [2025-02-06 09:23:43,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 769 transitions, 4756 flow [2025-02-06 09:23:43,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 769 transitions, 4360 flow, removed 198 selfloop flow, removed 0 redundant places. [2025-02-06 09:23:43,412 INFO L231 Difference]: Finished difference. Result has 310 places, 753 transitions, 4088 flow [2025-02-06 09:23:43,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=2704, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4088, PETRI_PLACES=310, PETRI_TRANSITIONS=753} [2025-02-06 09:23:43,414 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, 35 predicate places. [2025-02-06 09:23:43,414 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 753 transitions, 4088 flow [2025-02-06 09:23:43,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 185.16666666666666) internal successors, (1111), 6 states have internal predecessors, (1111), 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-02-06 09:23:43,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:43,415 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:23:43,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:23:43,415 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-06 09:23:43,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:43,415 INFO L85 PathProgramCache]: Analyzing trace with hash 269729869, now seen corresponding path program 1 times [2025-02-06 09:23:43,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:43,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849055410] [2025-02-06 09:23:43,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:43,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:43,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 09:23:43,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 09:23:43,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:43,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:43,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-02-06 09:23:43,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:43,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849055410] [2025-02-06 09:23:43,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849055410] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:43,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:43,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:23:43,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010773516] [2025-02-06 09:23:43,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:43,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:23:43,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:43,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:23:43,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:23:44,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 274 [2025-02-06 09:23:44,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 753 transitions, 4088 flow. Second operand has 6 states, 6 states have (on average 185.16666666666666) internal successors, (1111), 6 states have internal predecessors, (1111), 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-02-06 09:23:44,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:44,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 274 [2025-02-06 09:23:44,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:45,434 INFO L124 PetriNetUnfolderBase]: 3188/10579 cut-off events. [2025-02-06 09:23:45,434 INFO L125 PetriNetUnfolderBase]: For 8592/8683 co-relation queries the response was YES. [2025-02-06 09:23:45,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28025 conditions, 10579 events. 3188/10579 cut-off events. For 8592/8683 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 88683 event pairs, 1284 based on Foata normal form. 0/9884 useless extension candidates. Maximal degree in co-relation 27888. Up to 5368 conditions per place. [2025-02-06 09:23:45,477 INFO L140 encePairwiseOnDemand]: 231/274 looper letters, 513 selfloop transitions, 180 changer transitions 0/936 dead transitions. [2025-02-06 09:23:45,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 936 transitions, 6356 flow [2025-02-06 09:23:45,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:23:45,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:23:45,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1344 transitions. [2025-02-06 09:23:45,479 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8175182481751825 [2025-02-06 09:23:45,479 INFO L175 Difference]: Start difference. First operand has 310 places, 753 transitions, 4088 flow. Second operand 6 states and 1344 transitions. [2025-02-06 09:23:45,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 936 transitions, 6356 flow [2025-02-06 09:23:45,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 936 transitions, 6302 flow, removed 27 selfloop flow, removed 0 redundant places. [2025-02-06 09:23:45,515 INFO L231 Difference]: Finished difference. Result has 320 places, 920 transitions, 5724 flow [2025-02-06 09:23:45,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=4034, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=753, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5724, PETRI_PLACES=320, PETRI_TRANSITIONS=920} [2025-02-06 09:23:45,516 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, 45 predicate places. [2025-02-06 09:23:45,516 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 920 transitions, 5724 flow [2025-02-06 09:23:45,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 185.16666666666666) internal successors, (1111), 6 states have internal predecessors, (1111), 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-02-06 09:23:45,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:45,517 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] [2025-02-06 09:23:45,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:23:45,517 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-06 09:23:45,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:45,518 INFO L85 PathProgramCache]: Analyzing trace with hash -359681833, now seen corresponding path program 1 times [2025-02-06 09:23:45,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:45,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908403314] [2025-02-06 09:23:45,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:45,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:45,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-06 09:23:45,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 09:23:45,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:45,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:45,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:23:45,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:45,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908403314] [2025-02-06 09:23:45,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908403314] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:45,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:45,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 09:23:45,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606219260] [2025-02-06 09:23:45,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:45,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 09:23:45,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:45,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 09:23:45,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-02-06 09:23:47,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 274 [2025-02-06 09:23:47,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 920 transitions, 5724 flow. Second operand has 15 states, 15 states have (on average 160.86666666666667) internal successors, (2413), 15 states have internal predecessors, (2413), 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-02-06 09:23:47,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:47,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 274 [2025-02-06 09:23:47,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:50,745 INFO L124 PetriNetUnfolderBase]: 4094/12842 cut-off events. [2025-02-06 09:23:50,745 INFO L125 PetriNetUnfolderBase]: For 16038/16357 co-relation queries the response was YES. [2025-02-06 09:23:50,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38420 conditions, 12842 events. 4094/12842 cut-off events. For 16038/16357 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 106700 event pairs, 1266 based on Foata normal form. 147/12287 useless extension candidates. Maximal degree in co-relation 38271. Up to 4180 conditions per place. [2025-02-06 09:23:50,922 INFO L140 encePairwiseOnDemand]: 217/274 looper letters, 921 selfloop transitions, 276 changer transitions 0/1417 dead transitions. [2025-02-06 09:23:50,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 1417 transitions, 11034 flow [2025-02-06 09:23:50,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-06 09:23:50,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-02-06 09:23:50,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 5573 transitions. [2025-02-06 09:23:50,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6561101954320697 [2025-02-06 09:23:50,934 INFO L175 Difference]: Start difference. First operand has 320 places, 920 transitions, 5724 flow. Second operand 31 states and 5573 transitions. [2025-02-06 09:23:50,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 1417 transitions, 11034 flow [2025-02-06 09:23:51,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 1417 transitions, 10674 flow, removed 180 selfloop flow, removed 0 redundant places. [2025-02-06 09:23:51,022 INFO L231 Difference]: Finished difference. Result has 375 places, 1027 transitions, 7336 flow [2025-02-06 09:23:51,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=5364, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=920, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=697, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=7336, PETRI_PLACES=375, PETRI_TRANSITIONS=1027} [2025-02-06 09:23:51,025 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, 100 predicate places. [2025-02-06 09:23:51,025 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 1027 transitions, 7336 flow [2025-02-06 09:23:51,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 160.86666666666667) internal successors, (2413), 15 states have internal predecessors, (2413), 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-02-06 09:23:51,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:51,027 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] [2025-02-06 09:23:51,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:23:51,027 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-06 09:23:51,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:51,028 INFO L85 PathProgramCache]: Analyzing trace with hash 20226151, now seen corresponding path program 2 times [2025-02-06 09:23:51,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:51,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909303190] [2025-02-06 09:23:51,029 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:23:51,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:51,049 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 93 statements into 1 equivalence classes. [2025-02-06 09:23:51,060 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 09:23:51,060 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:23:51,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:51,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:23:51,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:51,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909303190] [2025-02-06 09:23:51,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909303190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:51,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:51,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 09:23:51,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383188914] [2025-02-06 09:23:51,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:51,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 09:23:51,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:51,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 09:23:51,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-02-06 09:23:53,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 274 [2025-02-06 09:23:53,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 1027 transitions, 7336 flow. Second operand has 15 states, 15 states have (on average 160.86666666666667) internal successors, (2413), 15 states have internal predecessors, (2413), 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-02-06 09:23:53,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:53,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 274 [2025-02-06 09:23:53,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:56,313 INFO L124 PetriNetUnfolderBase]: 5087/15795 cut-off events. [2025-02-06 09:23:56,313 INFO L125 PetriNetUnfolderBase]: For 28888/29218 co-relation queries the response was YES. [2025-02-06 09:23:56,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52619 conditions, 15795 events. 5087/15795 cut-off events. For 28888/29218 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 136861 event pairs, 1290 based on Foata normal form. 37/15050 useless extension candidates. Maximal degree in co-relation 52444. Up to 2883 conditions per place. [2025-02-06 09:23:56,437 INFO L140 encePairwiseOnDemand]: 216/274 looper letters, 1340 selfloop transitions, 200 changer transitions 0/1760 dead transitions. [2025-02-06 09:23:56,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 1760 transitions, 16170 flow [2025-02-06 09:23:56,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 09:23:56,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-06 09:23:56,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3968 transitions. [2025-02-06 09:23:56,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6582614465826144 [2025-02-06 09:23:56,443 INFO L175 Difference]: Start difference. First operand has 375 places, 1027 transitions, 7336 flow. Second operand 22 states and 3968 transitions. [2025-02-06 09:23:56,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 1760 transitions, 16170 flow [2025-02-06 09:23:56,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 1760 transitions, 15960 flow, removed 64 selfloop flow, removed 5 redundant places. [2025-02-06 09:23:56,592 INFO L231 Difference]: Finished difference. Result has 405 places, 1171 transitions, 9473 flow [2025-02-06 09:23:56,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=7196, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1027, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=868, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=9473, PETRI_PLACES=405, PETRI_TRANSITIONS=1171} [2025-02-06 09:23:56,593 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, 130 predicate places. [2025-02-06 09:23:56,594 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 1171 transitions, 9473 flow [2025-02-06 09:23:56,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 160.86666666666667) internal successors, (2413), 15 states have internal predecessors, (2413), 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-02-06 09:23:56,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:56,595 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] [2025-02-06 09:23:56,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:23:56,595 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-06 09:23:56,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:56,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1979998150, now seen corresponding path program 1 times [2025-02-06 09:23:56,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:56,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288880539] [2025-02-06 09:23:56,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:56,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:56,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-06 09:23:56,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 09:23:56,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:56,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:57,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:23:57,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:57,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288880539] [2025-02-06 09:23:57,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288880539] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:57,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:57,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 09:23:57,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146977548] [2025-02-06 09:23:57,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:57,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 09:23:57,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:57,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 09:23:57,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-02-06 09:23:58,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 274 [2025-02-06 09:23:58,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 1171 transitions, 9473 flow. Second operand has 15 states, 15 states have (on average 160.8) internal successors, (2412), 15 states have internal predecessors, (2412), 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-02-06 09:23:58,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:58,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 274 [2025-02-06 09:23:58,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:24:02,925 INFO L124 PetriNetUnfolderBase]: 6141/18344 cut-off events. [2025-02-06 09:24:02,926 INFO L125 PetriNetUnfolderBase]: For 47839/48188 co-relation queries the response was YES. [2025-02-06 09:24:03,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67178 conditions, 18344 events. 6141/18344 cut-off events. For 47839/48188 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 162012 event pairs, 854 based on Foata normal form. 93/17679 useless extension candidates. Maximal degree in co-relation 66990. Up to 5066 conditions per place. [2025-02-06 09:24:03,194 INFO L140 encePairwiseOnDemand]: 222/274 looper letters, 1517 selfloop transitions, 209 changer transitions 0/1976 dead transitions. [2025-02-06 09:24:03,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 1976 transitions, 20179 flow [2025-02-06 09:24:03,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 09:24:03,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-06 09:24:03,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 4005 transitions. [2025-02-06 09:24:03,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6643994691439947 [2025-02-06 09:24:03,199 INFO L175 Difference]: Start difference. First operand has 405 places, 1171 transitions, 9473 flow. Second operand 22 states and 4005 transitions. [2025-02-06 09:24:03,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 1976 transitions, 20179 flow [2025-02-06 09:24:03,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 1976 transitions, 19908 flow, removed 109 selfloop flow, removed 2 redundant places. [2025-02-06 09:24:03,701 INFO L231 Difference]: Finished difference. Result has 439 places, 1316 transitions, 11528 flow [2025-02-06 09:24:03,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=9270, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=999, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=11528, PETRI_PLACES=439, PETRI_TRANSITIONS=1316} [2025-02-06 09:24:03,702 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, 164 predicate places. [2025-02-06 09:24:03,703 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 1316 transitions, 11528 flow [2025-02-06 09:24:03,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 160.8) internal successors, (2412), 15 states have internal predecessors, (2412), 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-02-06 09:24:03,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:24:03,703 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] [2025-02-06 09:24:03,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:24:03,704 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-06 09:24:03,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:24:03,704 INFO L85 PathProgramCache]: Analyzing trace with hash -469317783, now seen corresponding path program 3 times [2025-02-06 09:24:03,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:24:03,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742636401] [2025-02-06 09:24:03,704 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 09:24:03,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:24:03,716 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 93 statements into 2 equivalence classes. [2025-02-06 09:24:03,730 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 09:24:03,730 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 09:24:03,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:24:04,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:24:04,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:24:04,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742636401] [2025-02-06 09:24:04,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742636401] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:24:04,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135420414] [2025-02-06 09:24:04,066 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 09:24:04,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:24:04,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:24:04,068 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:24:04,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 09:24:04,146 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 93 statements into 2 equivalence classes. [2025-02-06 09:24:04,739 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 09:24:04,739 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 09:24:04,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:24:04,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-06 09:24:04,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:24:04,790 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-02-06 09:24:04,815 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 09:24:04,816 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-02-06 09:24:04,932 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-02-06 09:24:04,957 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 19 treesize of output 18 [2025-02-06 09:24:04,987 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-02-06 09:24:05,025 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-02-06 09:24:05,073 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-02-06 09:24:05,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:24:05,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:24:05,130 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_677 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_677) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3)) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_677 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_677) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|))) (forall ((v_ArrVal_677 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_677) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2)) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_677 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_677) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1))))) is different from false [2025-02-06 09:24:05,155 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3))) (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~nondet30#1|)))) (and (forall ((v_ArrVal_677 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_677) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|))) (forall ((v_ArrVal_677 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_677) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2)))) (forall ((v_ArrVal_677 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_677) |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1))) (forall ((v_ArrVal_677 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_677) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1))))))) is different from false [2025-02-06 09:24:09,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:24:09,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135420414] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:24:09,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:24:09,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 30 [2025-02-06 09:24:09,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190995904] [2025-02-06 09:24:09,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:24:09,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-06 09:24:09,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:24:09,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-06 09:24:09,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=690, Unknown=19, NotChecked=110, Total=930 [2025-02-06 09:24:09,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 274 [2025-02-06 09:24:09,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 1316 transitions, 11528 flow. Second operand has 31 states, 31 states have (on average 100.64516129032258) internal successors, (3120), 31 states have internal predecessors, (3120), 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-02-06 09:24:09,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:24:09,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 274 [2025-02-06 09:24:09,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:24:18,755 INFO L124 PetriNetUnfolderBase]: 12329/31155 cut-off events. [2025-02-06 09:24:18,756 INFO L125 PetriNetUnfolderBase]: For 98771/98820 co-relation queries the response was YES. [2025-02-06 09:24:19,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120719 conditions, 31155 events. 12329/31155 cut-off events. For 98771/98820 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 273339 event pairs, 4033 based on Foata normal form. 47/29469 useless extension candidates. Maximal degree in co-relation 120501. Up to 7837 conditions per place. [2025-02-06 09:24:19,137 INFO L140 encePairwiseOnDemand]: 216/274 looper letters, 1916 selfloop transitions, 252 changer transitions 0/2277 dead transitions. [2025-02-06 09:24:19,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 2277 transitions, 23645 flow [2025-02-06 09:24:19,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 09:24:19,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-02-06 09:24:19,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2963 transitions. [2025-02-06 09:24:19,140 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4701682005712472 [2025-02-06 09:24:19,140 INFO L175 Difference]: Start difference. First operand has 439 places, 1316 transitions, 11528 flow. Second operand 23 states and 2963 transitions. [2025-02-06 09:24:19,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 2277 transitions, 23645 flow [2025-02-06 09:24:19,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 2277 transitions, 23539 flow, removed 32 selfloop flow, removed 2 redundant places. [2025-02-06 09:24:19,772 INFO L231 Difference]: Finished difference. Result has 474 places, 1434 transitions, 14111 flow [2025-02-06 09:24:19,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=11473, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1085, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=14111, PETRI_PLACES=474, PETRI_TRANSITIONS=1434} [2025-02-06 09:24:19,775 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, 199 predicate places. [2025-02-06 09:24:19,775 INFO L471 AbstractCegarLoop]: Abstraction has has 474 places, 1434 transitions, 14111 flow [2025-02-06 09:24:19,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 100.64516129032258) internal successors, (3120), 31 states have internal predecessors, (3120), 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-02-06 09:24:19,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:24:19,776 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] [2025-02-06 09:24:19,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 09:24:19,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 09:24:19,978 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-06 09:24:19,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:24:19,978 INFO L85 PathProgramCache]: Analyzing trace with hash 333749182, now seen corresponding path program 2 times [2025-02-06 09:24:19,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:24:19,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278097851] [2025-02-06 09:24:19,979 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:24:19,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:24:19,995 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes. [2025-02-06 09:24:20,007 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 09:24:20,008 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 09:24:20,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:24:20,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:24:20,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:24:20,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278097851] [2025-02-06 09:24:20,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278097851] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:24:20,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472019293] [2025-02-06 09:24:20,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:24:20,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:24:20,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:24:20,406 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:24:20,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 09:24:20,515 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes. [2025-02-06 09:24:20,879 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 09:24:20,880 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 09:24:20,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:24:20,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-06 09:24:20,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:24:20,891 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-02-06 09:24:20,963 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 09:24:20,964 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-02-06 09:24:21,098 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-02-06 09:24:21,130 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-02-06 09:24:21,180 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-02-06 09:24:21,228 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-02-06 09:24:21,279 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 50 treesize of output 47 [2025-02-06 09:24:21,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:24:21,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:24:22,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:24:22,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472019293] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:24:22,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:24:22,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2025-02-06 09:24:22,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077339252] [2025-02-06 09:24:22,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:24:22,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-02-06 09:24:22,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:24:22,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-02-06 09:24:22,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1382, Unknown=0, NotChecked=0, Total=1560 [2025-02-06 09:24:28,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 274 [2025-02-06 09:24:28,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 1434 transitions, 14111 flow. Second operand has 40 states, 40 states have (on average 159.975) internal successors, (6399), 40 states have internal predecessors, (6399), 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-02-06 09:24:28,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:24:28,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 274 [2025-02-06 09:24:28,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:24:35,602 INFO L124 PetriNetUnfolderBase]: 8193/23937 cut-off events. [2025-02-06 09:24:35,602 INFO L125 PetriNetUnfolderBase]: For 96954/97564 co-relation queries the response was YES. [2025-02-06 09:24:35,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100444 conditions, 23937 events. 8193/23937 cut-off events. For 96954/97564 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 222859 event pairs, 1062 based on Foata normal form. 161/23206 useless extension candidates. Maximal degree in co-relation 100222. Up to 5999 conditions per place. [2025-02-06 09:24:36,070 INFO L140 encePairwiseOnDemand]: 222/274 looper letters, 1671 selfloop transitions, 223 changer transitions 0/2167 dead transitions. [2025-02-06 09:24:36,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 2167 transitions, 25452 flow [2025-02-06 09:24:36,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 09:24:36,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-02-06 09:24:36,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4131 transitions. [2025-02-06 09:24:36,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6555061885115836 [2025-02-06 09:24:36,074 INFO L175 Difference]: Start difference. First operand has 474 places, 1434 transitions, 14111 flow. Second operand 23 states and 4131 transitions. [2025-02-06 09:24:36,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 2167 transitions, 25452 flow [2025-02-06 09:24:37,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 490 places, 2167 transitions, 25012 flow, removed 158 selfloop flow, removed 6 redundant places. [2025-02-06 09:24:37,046 INFO L231 Difference]: Finished difference. Result has 505 places, 1559 transitions, 16305 flow [2025-02-06 09:24:37,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=13724, PETRI_DIFFERENCE_MINUEND_PLACES=468, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=16305, PETRI_PLACES=505, PETRI_TRANSITIONS=1559} [2025-02-06 09:24:37,048 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, 230 predicate places. [2025-02-06 09:24:37,048 INFO L471 AbstractCegarLoop]: Abstraction has has 505 places, 1559 transitions, 16305 flow [2025-02-06 09:24:37,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 159.975) internal successors, (6399), 40 states have internal predecessors, (6399), 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-02-06 09:24:37,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:24:37,051 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] [2025-02-06 09:24:37,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 09:24:37,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:24:37,251 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-06 09:24:37,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:24:37,252 INFO L85 PathProgramCache]: Analyzing trace with hash 14454633, now seen corresponding path program 4 times [2025-02-06 09:24:37,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:24:37,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441198648] [2025-02-06 09:24:37,252 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 09:24:37,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:24:37,266 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 93 statements into 2 equivalence classes. [2025-02-06 09:24:37,272 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 87 of 93 statements. [2025-02-06 09:24:37,273 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 09:24:37,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:24:37,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:24:37,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:24:37,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441198648] [2025-02-06 09:24:37,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441198648] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:24:37,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598803377] [2025-02-06 09:24:37,698 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 09:24:37,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:24:37,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:24:37,700 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:24:37,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 09:24:37,807 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 93 statements into 2 equivalence classes. [2025-02-06 09:24:37,842 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 87 of 93 statements. [2025-02-06 09:24:37,842 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 09:24:37,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:24:37,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 09:24:37,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:24:37,856 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-02-06 09:24:37,870 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 09:24:37,870 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-02-06 09:24:37,892 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-02-06 09:24:37,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-02-06 09:24:37,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:24:37,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-02-06 09:24:37,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:24:37,926 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-02-06 09:24:37,946 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-02-06 09:24:37,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:24:37,954 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:24:37,971 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1006 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_1006) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1)) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_1006 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_1006) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2)))) (forall ((v_ArrVal_1006 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_1006) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_1006 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_1006) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3))))) is different from false [2025-02-06 09:24:37,988 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3))) (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~nondet30#1|)))) (and (forall ((v_ArrVal_1006 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_1006) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2)) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_1006 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_1006) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1)))) (forall ((v_ArrVal_1006 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_1006) |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_1006 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_1006) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|)))))) is different from false [2025-02-06 09:24:38,006 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2)) (.cse1 (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse2 |c_t_funThread1of1ForFork0_init_#t~nondet30#1|) .cse1 |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)))) (and (forall ((v_ArrVal_1006 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_1006) |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_1006 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_1006) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1)))) (forall ((v_ArrVal_1006 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_1006) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|))) (forall ((v_ArrVal_1006 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_1006) |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse2)))))) is different from false [2025-02-06 09:24:40,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:24:40,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598803377] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:24:40,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:24:40,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 19 [2025-02-06 09:24:40,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799894538] [2025-02-06 09:24:40,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:24:40,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 09:24:40,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:24:40,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 09:24:40,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=231, Unknown=3, NotChecked=96, Total=380 [2025-02-06 09:24:40,441 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 274 [2025-02-06 09:24:40,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 505 places, 1559 transitions, 16305 flow. Second operand has 20 states, 20 states have (on average 101.2) internal successors, (2024), 20 states have internal predecessors, (2024), 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-02-06 09:24:40,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:24:40,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 274 [2025-02-06 09:24:40,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:24:53,067 INFO L124 PetriNetUnfolderBase]: 15526/38909 cut-off events. [2025-02-06 09:24:53,067 INFO L125 PetriNetUnfolderBase]: For 187067/187139 co-relation queries the response was YES. [2025-02-06 09:24:53,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168608 conditions, 38909 events. 15526/38909 cut-off events. For 187067/187139 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 356163 event pairs, 3767 based on Foata normal form. 63/37032 useless extension candidates. Maximal degree in co-relation 168357. Up to 19960 conditions per place. [2025-02-06 09:24:53,984 INFO L140 encePairwiseOnDemand]: 216/274 looper letters, 2080 selfloop transitions, 280 changer transitions 0/2476 dead transitions. [2025-02-06 09:24:53,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 2476 transitions, 29347 flow [2025-02-06 09:24:53,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 09:24:53,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-06 09:24:53,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2734 transitions. [2025-02-06 09:24:53,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4751477233229058 [2025-02-06 09:24:53,986 INFO L175 Difference]: Start difference. First operand has 505 places, 1559 transitions, 16305 flow. Second operand 21 states and 2734 transitions. [2025-02-06 09:24:53,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 2476 transitions, 29347 flow [2025-02-06 09:24:55,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 2476 transitions, 29082 flow, removed 89 selfloop flow, removed 6 redundant places. [2025-02-06 09:24:55,909 INFO L231 Difference]: Finished difference. Result has 532 places, 1670 transitions, 19135 flow [2025-02-06 09:24:55,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=16092, PETRI_DIFFERENCE_MINUEND_PLACES=499, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=19135, PETRI_PLACES=532, PETRI_TRANSITIONS=1670} [2025-02-06 09:24:55,910 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, 257 predicate places. [2025-02-06 09:24:55,910 INFO L471 AbstractCegarLoop]: Abstraction has has 532 places, 1670 transitions, 19135 flow [2025-02-06 09:24:55,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 101.2) internal successors, (2024), 20 states have internal predecessors, (2024), 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-02-06 09:24:55,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:24:55,911 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] [2025-02-06 09:24:55,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 09:24:56,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:24:56,112 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-06 09:24:56,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:24:56,113 INFO L85 PathProgramCache]: Analyzing trace with hash 402911392, now seen corresponding path program 3 times [2025-02-06 09:24:56,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:24:56,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660930369] [2025-02-06 09:24:56,113 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 09:24:56,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:24:56,125 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 93 statements into 2 equivalence classes. [2025-02-06 09:24:56,139 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 09:24:56,139 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 09:24:56,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:24:56,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:24:56,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:24:56,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660930369] [2025-02-06 09:24:56,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660930369] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:24:56,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926502856] [2025-02-06 09:24:56,556 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 09:24:56,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:24:56,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:24:56,558 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:24:56,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 09:24:56,652 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 93 statements into 2 equivalence classes. [2025-02-06 09:24:57,250 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 09:24:57,250 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 09:24:57,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:24:57,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-06 09:24:57,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:24:57,263 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-02-06 09:24:57,319 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 09:24:57,319 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-02-06 09:24:57,462 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-02-06 09:24:57,487 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-02-06 09:24:57,523 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-02-06 09:24:57,561 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-02-06 09:24:57,613 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 50 treesize of output 47 [2025-02-06 09:24:57,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:24:57,640 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:24:58,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:24:58,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926502856] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:24:58,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:24:58,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2025-02-06 09:24:58,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071274655] [2025-02-06 09:24:58,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:24:58,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-02-06 09:24:58,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:24:58,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-02-06 09:24:58,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1382, Unknown=0, NotChecked=0, Total=1560