/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.positions.where.we.compute.the.hoare.annotation All --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows ASSERTandASSUME -i ../../../trunk/examples/svcomp/pthread/stack_longer-1.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:24:49,215 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:24:49,302 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-15 01:24:49,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:24:49,330 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:24:49,330 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:24:49,331 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:24:49,331 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:24:49,331 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:24:49,331 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:24:49,332 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:24:49,332 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:24:49,332 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:24:49,332 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:24:49,332 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:24:49,332 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:24:49,332 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:24:49,332 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:24:49,333 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:24:49,333 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:24:49,333 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:24:49,333 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:24:49,333 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:24:49,333 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:24:49,333 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:24:49,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:24:49,333 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:24:49,333 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:24:49,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:24:49,333 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:24:49,333 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:24:49,333 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:24:49,334 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> ASSERTandASSUME [2025-03-15 01:24:49,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:24:49,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:24:49,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:24:49,614 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:24:49,614 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:24:49,615 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longer-1.i [2025-03-15 01:24:50,822 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2408cc2d7/d34825cb298c46c5b2b13000907f4c22/FLAGf1a8a453f [2025-03-15 01:24:51,062 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:24:51,063 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-1.i [2025-03-15 01:24:51,075 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2408cc2d7/d34825cb298c46c5b2b13000907f4c22/FLAGf1a8a453f [2025-03-15 01:24:51,091 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2408cc2d7/d34825cb298c46c5b2b13000907f4c22 [2025-03-15 01:24:51,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:24:51,096 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:24:51,097 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:24:51,097 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:24:51,100 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:24:51,100 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:24:51" (1/1) ... [2025-03-15 01:24:51,101 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36b3c043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:51, skipping insertion in model container [2025-03-15 01:24:51,101 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:24:51" (1/1) ... [2025-03-15 01:24:51,134 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:24:51,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:24:51,446 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:24:51,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:24:51,571 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:24:51,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:51 WrapperNode [2025-03-15 01:24:51,571 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:24:51,572 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:24:51,572 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:24:51,572 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:24:51,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:51" (1/1) ... [2025-03-15 01:24:51,604 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:51" (1/1) ... [2025-03-15 01:24:51,640 INFO L138 Inliner]: procedures = 277, calls = 432, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 558 [2025-03-15 01:24:51,641 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:24:51,641 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:24:51,641 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:24:51,642 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:24:51,650 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:51" (1/1) ... [2025-03-15 01:24:51,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:51" (1/1) ... [2025-03-15 01:24:51,657 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:51" (1/1) ... [2025-03-15 01:24:51,657 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:51" (1/1) ... [2025-03-15 01:24:51,687 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:51" (1/1) ... [2025-03-15 01:24:51,689 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:51" (1/1) ... [2025-03-15 01:24:51,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:51" (1/1) ... [2025-03-15 01:24:51,693 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:51" (1/1) ... [2025-03-15 01:24:51,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:51" (1/1) ... [2025-03-15 01:24:51,700 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:24:51,700 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:24:51,700 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:24:51,700 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:24:51,701 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:51" (1/1) ... [2025-03-15 01:24:51,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:24:51,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:24:51,727 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-15 01:24:51,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-15 01:24:51,747 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-15 01:24:51,747 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-15 01:24:51,747 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-15 01:24:51,747 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-15 01:24:51,747 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 01:24:51,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 01:24:51,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 01:24:51,747 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 01:24:51,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:24:51,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:24:51,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:24:51,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:24:51,748 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-15 01:24:51,876 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:24:51,878 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:24:52,504 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:24:52,504 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:24:52,530 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:24:52,531 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 01:24:52,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:24:52 BoogieIcfgContainer [2025-03-15 01:24:52,532 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:24:52,534 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:24:52,534 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:24:52,539 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:24:52,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:24:51" (1/3) ... [2025-03-15 01:24:52,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@503384ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:24:52, skipping insertion in model container [2025-03-15 01:24:52,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:51" (2/3) ... [2025-03-15 01:24:52,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@503384ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:24:52, skipping insertion in model container [2025-03-15 01:24:52,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:24:52" (3/3) ... [2025-03-15 01:24:52,541 INFO L128 eAbstractionObserver]: Analyzing ICFG stack_longer-1.i [2025-03-15 01:24:52,554 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:24:52,557 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG stack_longer-1.i that has 3 procedures, 572 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-03-15 01:24:52,557 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:24:52,674 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 01:24:52,714 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:24:52,726 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=All, 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;@125bfbf3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:24:52,727 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-15 01:24:52,873 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:24:52,873 INFO L124 PetriNetUnfolderBase]: 1/473 cut-off events. [2025-03-15 01:24:52,875 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-15 01:24:52,876 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:52,877 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:52,877 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:24:52,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:52,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1302603348, now seen corresponding path program 1 times [2025-03-15 01:24:52,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:52,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118986742] [2025-03-15 01:24:52,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:52,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:53,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:53,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:53,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118986742] [2025-03-15 01:24:53,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118986742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:53,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:53,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:24:53,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946838523] [2025-03-15 01:24:53,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:53,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:24:53,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:53,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:24:53,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:24:53,715 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 555 out of 581 [2025-03-15 01:24:53,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 578 places, 581 transitions, 1176 flow. Second operand has 4 states, 4 states have (on average 557.25) internal successors, (2229), 4 states have internal predecessors, (2229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:53,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:53,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 555 of 581 [2025-03-15 01:24:53,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:54,050 INFO L124 PetriNetUnfolderBase]: 122/1099 cut-off events. [2025-03-15 01:24:54,050 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-03-15 01:24:54,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1344 conditions, 1099 events. 122/1099 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4250 event pairs, 32 based on Foata normal form. 55/1060 useless extension candidates. Maximal degree in co-relation 648. Up to 121 conditions per place. [2025-03-15 01:24:54,064 INFO L140 encePairwiseOnDemand]: 569/581 looper letters, 31 selfloop transitions, 4 changer transitions 5/585 dead transitions. [2025-03-15 01:24:54,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 585 transitions, 1263 flow [2025-03-15 01:24:54,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:24:54,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:24:54,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2830 transitions. [2025-03-15 01:24:54,086 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9741824440619621 [2025-03-15 01:24:54,089 INFO L298 CegarLoopForPetriNet]: 578 programPoint places, -4 predicate places. [2025-03-15 01:24:54,089 INFO L471 AbstractCegarLoop]: Abstraction has has 574 places, 585 transitions, 1263 flow [2025-03-15 01:24:54,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 557.25) internal successors, (2229), 4 states have internal predecessors, (2229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:54,091 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:54,091 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:54,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:24:54,092 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:24:54,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:54,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1976173218, now seen corresponding path program 1 times [2025-03-15 01:24:54,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:54,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049162097] [2025-03-15 01:24:54,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:54,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:54,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:54,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:54,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049162097] [2025-03-15 01:24:54,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049162097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:54,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:54,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:24:54,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538675401] [2025-03-15 01:24:54,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:54,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:24:54,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:54,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:24:54,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-15 01:24:54,680 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 545 out of 581 [2025-03-15 01:24:54,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 585 transitions, 1263 flow. Second operand has 5 states, 5 states have (on average 547.4) internal successors, (2737), 5 states have internal predecessors, (2737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:54,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:54,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 545 of 581 [2025-03-15 01:24:54,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:55,543 INFO L124 PetriNetUnfolderBase]: 787/4254 cut-off events. [2025-03-15 01:24:55,543 INFO L125 PetriNetUnfolderBase]: For 1125/1159 co-relation queries the response was YES. [2025-03-15 01:24:55,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6488 conditions, 4254 events. 787/4254 cut-off events. For 1125/1159 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 35795 event pairs, 270 based on Foata normal form. 8/3725 useless extension candidates. Maximal degree in co-relation 5090. Up to 627 conditions per place. [2025-03-15 01:24:55,564 INFO L140 encePairwiseOnDemand]: 572/581 looper letters, 125 selfloop transitions, 13 changer transitions 8/687 dead transitions. [2025-03-15 01:24:55,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 581 places, 687 transitions, 1933 flow [2025-03-15 01:24:55,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 01:24:55,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 01:24:55,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 4463 transitions. [2025-03-15 01:24:55,573 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9601979345955249 [2025-03-15 01:24:55,574 INFO L298 CegarLoopForPetriNet]: 578 programPoint places, 3 predicate places. [2025-03-15 01:24:55,574 INFO L471 AbstractCegarLoop]: Abstraction has has 581 places, 687 transitions, 1933 flow [2025-03-15 01:24:55,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 547.4) internal successors, (2737), 5 states have internal predecessors, (2737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:55,575 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:55,576 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:55,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:24:55,576 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:24:55,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:55,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1167821244, now seen corresponding path program 1 times [2025-03-15 01:24:55,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:55,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899059639] [2025-03-15 01:24:55,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:55,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:55,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:55,959 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:55,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:55,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899059639] [2025-03-15 01:24:55,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899059639] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:24:55,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857987311] [2025-03-15 01:24:55,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:55,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:24:55,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:24:55,963 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:24:55,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-15 01:24:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:56,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 942 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-15 01:24:56,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:24:56,247 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:56,247 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:24:56,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857987311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:56,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:24:56,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-15 01:24:56,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312228380] [2025-03-15 01:24:56,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:56,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:24:56,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:56,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:24:56,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-15 01:24:56,252 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 555 out of 581 [2025-03-15 01:24:56,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 687 transitions, 1933 flow. Second operand has 5 states, 5 states have (on average 558.4) internal successors, (2792), 5 states have internal predecessors, (2792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:56,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:56,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 555 of 581 [2025-03-15 01:24:56,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:57,043 INFO L124 PetriNetUnfolderBase]: 772/4162 cut-off events. [2025-03-15 01:24:57,043 INFO L125 PetriNetUnfolderBase]: For 2214/2990 co-relation queries the response was YES. [2025-03-15 01:24:57,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7075 conditions, 4162 events. 772/4162 cut-off events. For 2214/2990 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 34817 event pairs, 202 based on Foata normal form. 58/3725 useless extension candidates. Maximal degree in co-relation 5491. Up to 615 conditions per place. [2025-03-15 01:24:57,061 INFO L140 encePairwiseOnDemand]: 577/581 looper letters, 99 selfloop transitions, 5 changer transitions 8/701 dead transitions. [2025-03-15 01:24:57,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 583 places, 701 transitions, 2253 flow [2025-03-15 01:24:57,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:24:57,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:24:57,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2245 transitions. [2025-03-15 01:24:57,065 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9660068846815835 [2025-03-15 01:24:57,065 INFO L298 CegarLoopForPetriNet]: 578 programPoint places, 5 predicate places. [2025-03-15 01:24:57,065 INFO L471 AbstractCegarLoop]: Abstraction has has 583 places, 701 transitions, 2253 flow [2025-03-15 01:24:57,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 558.4) internal successors, (2792), 5 states have internal predecessors, (2792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:57,067 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:57,067 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:57,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-15 01:24:57,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:24:57,268 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:24:57,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:57,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1842718847, now seen corresponding path program 1 times [2025-03-15 01:24:57,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:57,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449180005] [2025-03-15 01:24:57,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:57,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:57,449 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 01:24:57,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:57,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449180005] [2025-03-15 01:24:57,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449180005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:57,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:57,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:24:57,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461095549] [2025-03-15 01:24:57,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:57,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:24:57,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:57,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:24:57,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:24:57,454 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 555 out of 581 [2025-03-15 01:24:57,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 583 places, 701 transitions, 2253 flow. Second operand has 4 states, 4 states have (on average 559.5) internal successors, (2238), 4 states have internal predecessors, (2238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:57,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:57,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 555 of 581 [2025-03-15 01:24:57,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:58,066 INFO L124 PetriNetUnfolderBase]: 762/4134 cut-off events. [2025-03-15 01:24:58,067 INFO L125 PetriNetUnfolderBase]: For 3580/5314 co-relation queries the response was YES. [2025-03-15 01:24:58,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7683 conditions, 4134 events. 762/4134 cut-off events. For 3580/5314 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 34495 event pairs, 201 based on Foata normal form. 174/3847 useless extension candidates. Maximal degree in co-relation 5929. Up to 612 conditions per place. [2025-03-15 01:24:58,093 INFO L140 encePairwiseOnDemand]: 575/581 looper letters, 99 selfloop transitions, 8 changer transitions 24/720 dead transitions. [2025-03-15 01:24:58,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 720 transitions, 2685 flow [2025-03-15 01:24:58,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:24:58,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:24:58,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2803 transitions. [2025-03-15 01:24:58,097 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9648881239242685 [2025-03-15 01:24:58,097 INFO L298 CegarLoopForPetriNet]: 578 programPoint places, 8 predicate places. [2025-03-15 01:24:58,097 INFO L471 AbstractCegarLoop]: Abstraction has has 586 places, 720 transitions, 2685 flow [2025-03-15 01:24:58,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 559.5) internal successors, (2238), 4 states have internal predecessors, (2238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:58,099 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:58,099 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:58,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:24:58,099 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:24:58,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:58,101 INFO L85 PathProgramCache]: Analyzing trace with hash -405245077, now seen corresponding path program 1 times [2025-03-15 01:24:58,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:58,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451231377] [2025-03-15 01:24:58,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:58,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:58,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:58,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:58,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451231377] [2025-03-15 01:24:58,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451231377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:58,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:58,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:24:58,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419052753] [2025-03-15 01:24:58,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:58,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:24:58,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:58,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:24:58,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:24:58,576 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 549 out of 581 [2025-03-15 01:24:58,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 586 places, 720 transitions, 2685 flow. Second operand has 4 states, 4 states have (on average 551.0) internal successors, (2204), 4 states have internal predecessors, (2204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:58,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:58,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 549 of 581 [2025-03-15 01:24:58,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:59,318 INFO L124 PetriNetUnfolderBase]: 963/4830 cut-off events. [2025-03-15 01:24:59,318 INFO L125 PetriNetUnfolderBase]: For 7022/8179 co-relation queries the response was YES. [2025-03-15 01:24:59,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10338 conditions, 4830 events. 963/4830 cut-off events. For 7022/8179 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 40880 event pairs, 172 based on Foata normal form. 51/4329 useless extension candidates. Maximal degree in co-relation 8437. Up to 1034 conditions per place. [2025-03-15 01:24:59,346 INFO L140 encePairwiseOnDemand]: 575/581 looper letters, 154 selfloop transitions, 8 changer transitions 24/745 dead transitions. [2025-03-15 01:24:59,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 745 transitions, 3243 flow [2025-03-15 01:24:59,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:24:59,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:24:59,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2798 transitions. [2025-03-15 01:24:59,351 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9631669535283993 [2025-03-15 01:24:59,352 INFO L298 CegarLoopForPetriNet]: 578 programPoint places, 12 predicate places. [2025-03-15 01:24:59,352 INFO L471 AbstractCegarLoop]: Abstraction has has 590 places, 745 transitions, 3243 flow [2025-03-15 01:24:59,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 551.0) internal successors, (2204), 4 states have internal predecessors, (2204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:59,353 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:59,353 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:59,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:24:59,354 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:24:59,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:59,355 INFO L85 PathProgramCache]: Analyzing trace with hash 493352738, now seen corresponding path program 1 times [2025-03-15 01:24:59,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:59,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633649450] [2025-03-15 01:24:59,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:59,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:59,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:59,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:59,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633649450] [2025-03-15 01:24:59,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633649450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:59,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:59,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:24:59,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851399236] [2025-03-15 01:24:59,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:59,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:24:59,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:59,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:24:59,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:24:59,612 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 555 out of 581 [2025-03-15 01:24:59,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 590 places, 745 transitions, 3243 flow. Second operand has 4 states, 4 states have (on average 557.0) internal successors, (2228), 4 states have internal predecessors, (2228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:59,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:59,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 555 of 581 [2025-03-15 01:24:59,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:00,486 INFO L124 PetriNetUnfolderBase]: 1191/5871 cut-off events. [2025-03-15 01:25:00,487 INFO L125 PetriNetUnfolderBase]: For 14788/16568 co-relation queries the response was YES. [2025-03-15 01:25:00,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13859 conditions, 5871 events. 1191/5871 cut-off events. For 14788/16568 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 51967 event pairs, 271 based on Foata normal form. 73/5247 useless extension candidates. Maximal degree in co-relation 12482. Up to 1335 conditions per place. [2025-03-15 01:25:00,525 INFO L140 encePairwiseOnDemand]: 574/581 looper letters, 171 selfloop transitions, 4 changer transitions 6/783 dead transitions. [2025-03-15 01:25:00,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 594 places, 783 transitions, 3948 flow [2025-03-15 01:25:00,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:25:00,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:25:00,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2814 transitions. [2025-03-15 01:25:00,529 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9686746987951808 [2025-03-15 01:25:00,531 INFO L298 CegarLoopForPetriNet]: 578 programPoint places, 16 predicate places. [2025-03-15 01:25:00,532 INFO L471 AbstractCegarLoop]: Abstraction has has 594 places, 783 transitions, 3948 flow [2025-03-15 01:25:00,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 557.0) internal successors, (2228), 4 states have internal predecessors, (2228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:00,533 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:00,533 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:00,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:25:00,534 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:25:00,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:00,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1456502582, now seen corresponding path program 1 times [2025-03-15 01:25:00,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:00,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214004728] [2025-03-15 01:25:00,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:00,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:00,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:00,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:00,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214004728] [2025-03-15 01:25:00,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214004728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:00,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:00,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:25:00,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507608512] [2025-03-15 01:25:00,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:00,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:25:00,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:00,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:25:00,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:25:00,930 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 581 [2025-03-15 01:25:00,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 594 places, 783 transitions, 3948 flow. Second operand has 3 states, 3 states have (on average 562.6666666666666) internal successors, (1688), 3 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:00,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:00,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 581 [2025-03-15 01:25:00,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:01,232 INFO L124 PetriNetUnfolderBase]: 374/2300 cut-off events. [2025-03-15 01:25:01,232 INFO L125 PetriNetUnfolderBase]: For 19428/21485 co-relation queries the response was YES. [2025-03-15 01:25:01,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6225 conditions, 2300 events. 374/2300 cut-off events. For 19428/21485 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 13378 event pairs, 73 based on Foata normal form. 199/2268 useless extension candidates. Maximal degree in co-relation 5129. Up to 416 conditions per place. [2025-03-15 01:25:01,246 INFO L140 encePairwiseOnDemand]: 577/581 looper letters, 39 selfloop transitions, 98 changer transitions 6/731 dead transitions. [2025-03-15 01:25:01,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 595 places, 731 transitions, 3712 flow [2025-03-15 01:25:01,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:25:01,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:25:01,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1696 transitions. [2025-03-15 01:25:01,249 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9730349971313826 [2025-03-15 01:25:01,250 INFO L298 CegarLoopForPetriNet]: 578 programPoint places, 17 predicate places. [2025-03-15 01:25:01,250 INFO L471 AbstractCegarLoop]: Abstraction has has 595 places, 731 transitions, 3712 flow [2025-03-15 01:25:01,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 562.6666666666666) internal successors, (1688), 3 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:01,251 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:01,251 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:01,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:25:01,251 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:25:01,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:01,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1627102641, now seen corresponding path program 1 times [2025-03-15 01:25:01,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:01,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167070754] [2025-03-15 01:25:01,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:01,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:01,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:01,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:01,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167070754] [2025-03-15 01:25:01,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167070754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:01,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:01,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:25:01,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367521979] [2025-03-15 01:25:01,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:01,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:25:01,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:01,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:25:01,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:25:01,564 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 581 [2025-03-15 01:25:01,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 595 places, 731 transitions, 3712 flow. Second operand has 6 states, 6 states have (on average 545.1666666666666) internal successors, (3271), 6 states have internal predecessors, (3271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:01,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:01,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 581 [2025-03-15 01:25:01,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:02,356 INFO L124 PetriNetUnfolderBase]: 717/4470 cut-off events. [2025-03-15 01:25:02,356 INFO L125 PetriNetUnfolderBase]: For 35385/37100 co-relation queries the response was YES. [2025-03-15 01:25:02,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13094 conditions, 4470 events. 717/4470 cut-off events. For 35385/37100 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 33066 event pairs, 151 based on Foata normal form. 42/3997 useless extension candidates. Maximal degree in co-relation 11215. Up to 956 conditions per place. [2025-03-15 01:25:02,378 INFO L140 encePairwiseOnDemand]: 571/581 looper letters, 253 selfloop transitions, 14 changer transitions 8/828 dead transitions. [2025-03-15 01:25:02,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 828 transitions, 5618 flow [2025-03-15 01:25:02,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 01:25:02,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 01:25:02,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 4412 transitions. [2025-03-15 01:25:02,386 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9492254733218589 [2025-03-15 01:25:02,389 INFO L298 CegarLoopForPetriNet]: 578 programPoint places, 24 predicate places. [2025-03-15 01:25:02,389 INFO L471 AbstractCegarLoop]: Abstraction has has 602 places, 828 transitions, 5618 flow [2025-03-15 01:25:02,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 545.1666666666666) internal successors, (3271), 6 states have internal predecessors, (3271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:02,391 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:02,391 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:02,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:25:02,391 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:25:02,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:02,392 INFO L85 PathProgramCache]: Analyzing trace with hash 603806535, now seen corresponding path program 1 times [2025-03-15 01:25:02,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:02,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791114851] [2025-03-15 01:25:02,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:02,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:02,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:02,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:02,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791114851] [2025-03-15 01:25:02,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791114851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:02,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:02,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:25:02,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542928668] [2025-03-15 01:25:02,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:02,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:25:02,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:02,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:25:02,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:25:02,679 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 581 [2025-03-15 01:25:02,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 602 places, 828 transitions, 5618 flow. Second operand has 6 states, 6 states have (on average 545.3333333333334) internal successors, (3272), 6 states have internal predecessors, (3272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:02,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:02,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 581 [2025-03-15 01:25:02,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:03,579 INFO L124 PetriNetUnfolderBase]: 911/5405 cut-off events. [2025-03-15 01:25:03,580 INFO L125 PetriNetUnfolderBase]: For 71628/74471 co-relation queries the response was YES. [2025-03-15 01:25:03,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18069 conditions, 5405 events. 911/5405 cut-off events. For 71628/74471 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 42004 event pairs, 170 based on Foata normal form. 65/4839 useless extension candidates. Maximal degree in co-relation 15803. Up to 1278 conditions per place. [2025-03-15 01:25:03,613 INFO L140 encePairwiseOnDemand]: 572/581 looper letters, 362 selfloop transitions, 14 changer transitions 11/940 dead transitions. [2025-03-15 01:25:03,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 940 transitions, 8076 flow [2025-03-15 01:25:03,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 01:25:03,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 01:25:03,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 4414 transitions. [2025-03-15 01:25:03,679 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9496557659208261 [2025-03-15 01:25:03,680 INFO L298 CegarLoopForPetriNet]: 578 programPoint places, 31 predicate places. [2025-03-15 01:25:03,680 INFO L471 AbstractCegarLoop]: Abstraction has has 609 places, 940 transitions, 8076 flow [2025-03-15 01:25:03,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 545.3333333333334) internal successors, (3272), 6 states have internal predecessors, (3272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:03,681 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:03,682 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:03,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:25:03,682 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:25:03,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:03,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1466650583, now seen corresponding path program 1 times [2025-03-15 01:25:03,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:03,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372908395] [2025-03-15 01:25:03,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:03,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:03,928 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:03,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:03,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372908395] [2025-03-15 01:25:03,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372908395] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:25:03,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643330311] [2025-03-15 01:25:03,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:03,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:03,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:25:03,933 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:25:03,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-15 01:25:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:04,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 1014 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 01:25:04,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:25:04,610 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:04,610 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:25:04,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643330311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:04,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:25:04,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-15 01:25:04,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115176126] [2025-03-15 01:25:04,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:04,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:25:04,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:04,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:25:04,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-15 01:25:04,614 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 549 out of 581 [2025-03-15 01:25:04,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 609 places, 940 transitions, 8076 flow. Second operand has 6 states, 6 states have (on average 552.1666666666666) internal successors, (3313), 6 states have internal predecessors, (3313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:04,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:04,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 549 of 581 [2025-03-15 01:25:04,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:05,695 INFO L124 PetriNetUnfolderBase]: 992/5957 cut-off events. [2025-03-15 01:25:05,696 INFO L125 PetriNetUnfolderBase]: For 98800/102143 co-relation queries the response was YES. [2025-03-15 01:25:05,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21269 conditions, 5957 events. 992/5957 cut-off events. For 98800/102143 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 48895 event pairs, 203 based on Foata normal form. 71/5328 useless extension candidates. Maximal degree in co-relation 18895. Up to 1389 conditions per place. [2025-03-15 01:25:05,730 INFO L140 encePairwiseOnDemand]: 573/581 looper letters, 380 selfloop transitions, 19 changer transitions 12/986 dead transitions. [2025-03-15 01:25:05,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 986 transitions, 9733 flow [2025-03-15 01:25:05,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 01:25:05,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 01:25:05,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 4454 transitions. [2025-03-15 01:25:05,736 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9582616179001722 [2025-03-15 01:25:05,736 INFO L298 CegarLoopForPetriNet]: 578 programPoint places, 38 predicate places. [2025-03-15 01:25:05,737 INFO L471 AbstractCegarLoop]: Abstraction has has 616 places, 986 transitions, 9733 flow [2025-03-15 01:25:05,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 552.1666666666666) internal successors, (3313), 6 states have internal predecessors, (3313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:05,738 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:05,738 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:05,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-15 01:25:05,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-15 01:25:05,939 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:25:05,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:05,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1778470876, now seen corresponding path program 1 times [2025-03-15 01:25:05,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:05,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832760481] [2025-03-15 01:25:05,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:05,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:06,226 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:06,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:06,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832760481] [2025-03-15 01:25:06,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832760481] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:25:06,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467008073] [2025-03-15 01:25:06,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:06,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:06,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:25:06,229 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:25:06,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-15 01:25:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:06,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 01:25:06,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:25:06,816 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:06,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:25:07,292 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:07,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467008073] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:25:07,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:25:07,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-15 01:25:07,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084732622] [2025-03-15 01:25:07,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:25:07,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-15 01:25:07,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:07,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-15 01:25:07,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-15 01:25:07,298 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 549 out of 581 [2025-03-15 01:25:07,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 616 places, 986 transitions, 9733 flow. Second operand has 12 states, 12 states have (on average 553.1666666666666) internal successors, (6638), 12 states have internal predecessors, (6638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:07,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:07,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 549 of 581 [2025-03-15 01:25:07,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:09,299 INFO L124 PetriNetUnfolderBase]: 1510/8690 cut-off events. [2025-03-15 01:25:09,299 INFO L125 PetriNetUnfolderBase]: For 180677/185921 co-relation queries the response was YES. [2025-03-15 01:25:09,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33907 conditions, 8690 events. 1510/8690 cut-off events. For 180677/185921 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 75948 event pairs, 315 based on Foata normal form. 109/7725 useless extension candidates. Maximal degree in co-relation 30518. Up to 2149 conditions per place. [2025-03-15 01:25:09,336 INFO L140 encePairwiseOnDemand]: 572/581 looper letters, 522 selfloop transitions, 40 changer transitions 16/1153 dead transitions. [2025-03-15 01:25:09,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 1153 transitions, 14382 flow [2025-03-15 01:25:09,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-15 01:25:09,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-15 01:25:09,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 8342 transitions. [2025-03-15 01:25:09,347 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9572002294893861 [2025-03-15 01:25:09,347 INFO L298 CegarLoopForPetriNet]: 578 programPoint places, 52 predicate places. [2025-03-15 01:25:09,347 INFO L471 AbstractCegarLoop]: Abstraction has has 630 places, 1153 transitions, 14382 flow [2025-03-15 01:25:09,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 553.1666666666666) internal successors, (6638), 12 states have internal predecessors, (6638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:09,352 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:09,352 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:09,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-15 01:25:09,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:09,553 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:25:09,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:09,554 INFO L85 PathProgramCache]: Analyzing trace with hash 728529806, now seen corresponding path program 1 times [2025-03-15 01:25:09,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:09,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822702469] [2025-03-15 01:25:09,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:09,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:09,751 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:09,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:09,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822702469] [2025-03-15 01:25:09,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822702469] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:25:09,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685327293] [2025-03-15 01:25:09,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:09,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:09,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:25:09,753 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:25:09,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-15 01:25:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:09,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 01:25:09,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:25:09,996 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:09,996 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:25:09,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685327293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:09,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:25:09,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-15 01:25:09,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905216516] [2025-03-15 01:25:09,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:09,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:25:09,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:09,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:25:09,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-15 01:25:09,999 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 555 out of 581 [2025-03-15 01:25:10,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 630 places, 1153 transitions, 14382 flow. Second operand has 6 states, 6 states have (on average 557.6666666666666) internal successors, (3346), 6 states have internal predecessors, (3346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:10,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:10,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 555 of 581 [2025-03-15 01:25:10,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:11,561 INFO L124 PetriNetUnfolderBase]: 1397/8049 cut-off events. [2025-03-15 01:25:11,561 INFO L125 PetriNetUnfolderBase]: For 149645/158172 co-relation queries the response was YES. [2025-03-15 01:25:11,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33260 conditions, 8049 events. 1397/8049 cut-off events. For 149645/158172 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 67669 event pairs, 274 based on Foata normal form. 291/7485 useless extension candidates. Maximal degree in co-relation 30180. Up to 1910 conditions per place. [2025-03-15 01:25:11,608 INFO L140 encePairwiseOnDemand]: 576/581 looper letters, 474 selfloop transitions, 6 changer transitions 16/1183 dead transitions. [2025-03-15 01:25:11,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 635 places, 1183 transitions, 16118 flow [2025-03-15 01:25:11,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:25:11,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:25:11,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3927 transitions. [2025-03-15 01:25:11,612 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9655765920826161 [2025-03-15 01:25:11,613 INFO L298 CegarLoopForPetriNet]: 578 programPoint places, 57 predicate places. [2025-03-15 01:25:11,613 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 1183 transitions, 16118 flow [2025-03-15 01:25:11,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 557.6666666666666) internal successors, (3346), 6 states have internal predecessors, (3346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:11,614 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:11,614 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:11,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-15 01:25:11,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:11,814 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:25:11,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:11,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1109588830, now seen corresponding path program 1 times [2025-03-15 01:25:11,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:11,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407542621] [2025-03-15 01:25:11,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:11,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:11,923 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 01:25:11,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:11,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407542621] [2025-03-15 01:25:11,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407542621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:11,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:11,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:25:11,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844295718] [2025-03-15 01:25:11,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:11,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:25:11,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:11,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:25:11,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:25:11,925 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 555 out of 581 [2025-03-15 01:25:11,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 1183 transitions, 16118 flow. Second operand has 4 states, 4 states have (on average 559.25) internal successors, (2237), 4 states have internal predecessors, (2237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:11,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:11,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 555 of 581 [2025-03-15 01:25:11,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:13,349 INFO L124 PetriNetUnfolderBase]: 1369/7640 cut-off events. [2025-03-15 01:25:13,349 INFO L125 PetriNetUnfolderBase]: For 160743/171501 co-relation queries the response was YES. [2025-03-15 01:25:13,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34171 conditions, 7640 events. 1369/7640 cut-off events. For 160743/171501 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 63343 event pairs, 195 based on Foata normal form. 663/7528 useless extension candidates. Maximal degree in co-relation 31000. Up to 1912 conditions per place. [2025-03-15 01:25:13,392 INFO L140 encePairwiseOnDemand]: 575/581 looper letters, 543 selfloop transitions, 8 changer transitions 16/1254 dead transitions. [2025-03-15 01:25:13,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 1254 transitions, 19137 flow [2025-03-15 01:25:13,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:25:13,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:25:13,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2803 transitions. [2025-03-15 01:25:13,396 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9648881239242685 [2025-03-15 01:25:13,396 INFO L298 CegarLoopForPetriNet]: 578 programPoint places, 60 predicate places. [2025-03-15 01:25:13,396 INFO L471 AbstractCegarLoop]: Abstraction has has 638 places, 1254 transitions, 19137 flow [2025-03-15 01:25:13,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 559.25) internal successors, (2237), 4 states have internal predecessors, (2237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:13,396 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:13,397 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:13,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 01:25:13,397 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:25:13,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:13,398 INFO L85 PathProgramCache]: Analyzing trace with hash -787437143, now seen corresponding path program 1 times [2025-03-15 01:25:13,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:13,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815293650] [2025-03-15 01:25:13,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:13,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:13,640 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:13,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:13,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815293650] [2025-03-15 01:25:13,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815293650] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:25:13,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677576679] [2025-03-15 01:25:13,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:13,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:13,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:25:13,642 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:25:13,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-15 01:25:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:13,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 1086 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-15 01:25:13,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:25:14,226 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:14,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:25:14,655 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:14,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677576679] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:25:14,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:25:14,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-03-15 01:25:14,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676149857] [2025-03-15 01:25:14,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:25:14,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-15 01:25:14,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:14,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-15 01:25:14,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-15 01:25:14,659 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 581 [2025-03-15 01:25:14,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 638 places, 1254 transitions, 19137 flow. Second operand has 14 states, 14 states have (on average 547.0714285714286) internal successors, (7659), 14 states have internal predecessors, (7659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:14,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:14,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 581 [2025-03-15 01:25:14,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:17,551 INFO L124 PetriNetUnfolderBase]: 1796/10406 cut-off events. [2025-03-15 01:25:17,551 INFO L125 PetriNetUnfolderBase]: For 217210/225979 co-relation queries the response was YES. [2025-03-15 01:25:17,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48593 conditions, 10406 events. 1796/10406 cut-off events. For 217210/225979 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 94511 event pairs, 231 based on Foata normal form. 97/9449 useless extension candidates. Maximal degree in co-relation 45101. Up to 2580 conditions per place. [2025-03-15 01:25:17,605 INFO L140 encePairwiseOnDemand]: 568/581 looper letters, 898 selfloop transitions, 81 changer transitions 23/1553 dead transitions. [2025-03-15 01:25:17,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 664 places, 1553 transitions, 27588 flow [2025-03-15 01:25:17,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-15 01:25:17,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-15 01:25:17,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 14800 transitions. [2025-03-15 01:25:17,615 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9434563651431122 [2025-03-15 01:25:17,616 INFO L298 CegarLoopForPetriNet]: 578 programPoint places, 86 predicate places. [2025-03-15 01:25:17,616 INFO L471 AbstractCegarLoop]: Abstraction has has 664 places, 1553 transitions, 27588 flow [2025-03-15 01:25:17,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 547.0714285714286) internal successors, (7659), 14 states have internal predecessors, (7659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:17,617 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:17,617 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:17,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-15 01:25:17,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-15 01:25:17,818 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:25:17,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:17,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1751021261, now seen corresponding path program 1 times [2025-03-15 01:25:17,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:17,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735134246] [2025-03-15 01:25:17,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:17,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:18,064 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:18,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:18,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735134246] [2025-03-15 01:25:18,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735134246] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:25:18,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821329775] [2025-03-15 01:25:18,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:18,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:18,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:25:18,067 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:25:18,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-15 01:25:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:18,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 1097 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-15 01:25:18,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:25:18,621 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:18,622 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:25:18,998 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:18,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821329775] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:25:18,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:25:18,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-15 01:25:18,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450896369] [2025-03-15 01:25:18,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:25:18,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-15 01:25:19,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:19,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-15 01:25:19,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-03-15 01:25:19,003 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 581 [2025-03-15 01:25:19,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 664 places, 1553 transitions, 27588 flow. Second operand has 16 states, 16 states have (on average 546.5625) internal successors, (8745), 16 states have internal predecessors, (8745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:19,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:19,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 581 [2025-03-15 01:25:19,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:22,898 INFO L124 PetriNetUnfolderBase]: 2297/13455 cut-off events. [2025-03-15 01:25:22,898 INFO L125 PetriNetUnfolderBase]: For 321457/332192 co-relation queries the response was YES. [2025-03-15 01:25:22,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66324 conditions, 13455 events. 2297/13455 cut-off events. For 321457/332192 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 126790 event pairs, 304 based on Foata normal form. 108/12296 useless extension candidates. Maximal degree in co-relation 62506. Up to 3485 conditions per place. [2025-03-15 01:25:22,985 INFO L140 encePairwiseOnDemand]: 568/581 looper letters, 1127 selfloop transitions, 118 changer transitions 30/1826 dead transitions. [2025-03-15 01:25:22,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 682 places, 1826 transitions, 36845 flow [2025-03-15 01:25:22,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-15 01:25:22,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-15 01:25:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 12602 transitions. [2025-03-15 01:25:22,990 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9430517099453716 [2025-03-15 01:25:22,990 INFO L298 CegarLoopForPetriNet]: 578 programPoint places, 104 predicate places. [2025-03-15 01:25:22,990 INFO L471 AbstractCegarLoop]: Abstraction has has 682 places, 1826 transitions, 36845 flow [2025-03-15 01:25:22,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 546.5625) internal successors, (8745), 16 states have internal predecessors, (8745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:22,992 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:22,992 INFO L221 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:22,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-15 01:25:23,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-15 01:25:23,193 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:25:23,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:23,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1291277153, now seen corresponding path program 1 times [2025-03-15 01:25:23,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:23,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373614682] [2025-03-15 01:25:23,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:23,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:23,671 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:23,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:23,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373614682] [2025-03-15 01:25:23,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373614682] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:25:23,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597601234] [2025-03-15 01:25:23,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:23,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:23,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:25:23,673 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:25:23,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-15 01:25:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:23,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 1274 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-15 01:25:23,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:25:24,261 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:24,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:25:24,707 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:24,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597601234] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:25:24,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:25:24,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-15 01:25:24,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724760870] [2025-03-15 01:25:24,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:25:24,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-15 01:25:24,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:24,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-15 01:25:24,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-15 01:25:24,713 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 581 [2025-03-15 01:25:24,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 682 places, 1826 transitions, 36845 flow. Second operand has 20 states, 20 states have (on average 547.35) internal successors, (10947), 20 states have internal predecessors, (10947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:24,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:24,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 581 [2025-03-15 01:25:24,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:32,552 INFO L124 PetriNetUnfolderBase]: 3889/23223 cut-off events. [2025-03-15 01:25:32,552 INFO L125 PetriNetUnfolderBase]: For 600311/618054 co-relation queries the response was YES. [2025-03-15 01:25:32,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120463 conditions, 23223 events. 3889/23223 cut-off events. For 600311/618054 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 245332 event pairs, 613 based on Foata normal form. 134/21116 useless extension candidates. Maximal degree in co-relation 114438. Up to 6023 conditions per place. [2025-03-15 01:25:32,732 INFO L140 encePairwiseOnDemand]: 569/581 looper letters, 1883 selfloop transitions, 213 changer transitions 49/2696 dead transitions. [2025-03-15 01:25:32,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 718 places, 2696 transitions, 65338 flow [2025-03-15 01:25:32,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-15 01:25:32,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-03-15 01:25:32,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 20812 transitions. [2025-03-15 01:25:32,738 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9426578494428843 [2025-03-15 01:25:32,738 INFO L298 CegarLoopForPetriNet]: 578 programPoint places, 140 predicate places. [2025-03-15 01:25:32,739 INFO L471 AbstractCegarLoop]: Abstraction has has 718 places, 2696 transitions, 65338 flow [2025-03-15 01:25:32,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 547.35) internal successors, (10947), 20 states have internal predecessors, (10947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:32,741 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:32,741 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:32,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-15 01:25:32,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:32,941 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:25:32,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:32,943 INFO L85 PathProgramCache]: Analyzing trace with hash 606013841, now seen corresponding path program 2 times [2025-03-15 01:25:32,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:32,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012563044] [2025-03-15 01:25:32,943 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:25:32,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:33,002 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:25:33,002 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:25:34,044 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:34,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:34,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012563044] [2025-03-15 01:25:34,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012563044] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:25:34,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203375680] [2025-03-15 01:25:34,044 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:25:34,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:34,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:25:34,051 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:25:34,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-15 01:25:34,303 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:25:34,304 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:25:34,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 1308 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-15 01:25:34,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:25:34,877 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:34,877 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:25:35,468 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:35,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203375680] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:25:35,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:25:35,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 27 [2025-03-15 01:25:35,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688954257] [2025-03-15 01:25:35,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:25:35,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-15 01:25:35,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:35,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-15 01:25:35,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=589, Unknown=0, NotChecked=0, Total=756 [2025-03-15 01:25:35,475 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 531 out of 581 [2025-03-15 01:25:35,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 718 places, 2696 transitions, 65338 flow. Second operand has 28 states, 28 states have (on average 539.0357142857143) internal successors, (15093), 28 states have internal predecessors, (15093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:35,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:35,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 531 of 581 [2025-03-15 01:25:35,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:48,088 INFO L124 PetriNetUnfolderBase]: 4531/27556 cut-off events. [2025-03-15 01:25:48,089 INFO L125 PetriNetUnfolderBase]: For 770844/791201 co-relation queries the response was YES. [2025-03-15 01:25:48,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153520 conditions, 27556 events. 4531/27556 cut-off events. For 770844/791201 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 302523 event pairs, 591 based on Foata normal form. 108/25153 useless extension candidates. Maximal degree in co-relation 146200. Up to 7262 conditions per place. [2025-03-15 01:25:48,308 INFO L140 encePairwiseOnDemand]: 563/581 looper letters, 1800 selfloop transitions, 313 changer transitions 705/3347 dead transitions. [2025-03-15 01:25:48,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 720 places, 3347 transitions, 91278 flow [2025-03-15 01:25:48,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-15 01:25:48,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-15 01:25:48,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 10214 transitions. [2025-03-15 01:25:48,312 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9252649696530483 [2025-03-15 01:25:48,313 INFO L298 CegarLoopForPetriNet]: 578 programPoint places, 142 predicate places. [2025-03-15 01:25:48,313 INFO L471 AbstractCegarLoop]: Abstraction has has 720 places, 3347 transitions, 91278 flow [2025-03-15 01:25:48,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 539.0357142857143) internal successors, (15093), 28 states have internal predecessors, (15093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:48,315 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:48,315 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:48,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-15 01:25:48,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-15 01:25:48,516 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:25:48,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:48,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1306193377, now seen corresponding path program 1 times [2025-03-15 01:25:48,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:48,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125413785] [2025-03-15 01:25:48,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:48,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:48,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:49,199 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:49,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:49,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125413785] [2025-03-15 01:25:49,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125413785] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:25:49,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127812148] [2025-03-15 01:25:49,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:49,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:49,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:25:49,201 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:25:49,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-15 01:25:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:49,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 1432 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-15 01:25:49,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:25:49,864 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:49,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:25:50,355 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:50,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127812148] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:25:50,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:25:50,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 19 [2025-03-15 01:25:50,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389171693] [2025-03-15 01:25:50,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:25:50,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-15 01:25:50,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:50,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-15 01:25:50,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2025-03-15 01:25:50,362 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 581 [2025-03-15 01:25:50,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 720 places, 3347 transitions, 91278 flow. Second operand has 20 states, 20 states have (on average 547.95) internal successors, (10959), 20 states have internal predecessors, (10959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:50,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:50,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 581 [2025-03-15 01:25:50,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:11,991 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1280] L998-->L998-3: Formula: (and (= |v_#pthreadsMutex_15| (store |v_#pthreadsMutex_16| |v_~#m~0.base_14| (store (select |v_#pthreadsMutex_16| |v_~#m~0.base_14|) |v_~#m~0.offset_14| 0))) (= |v_t1Thread1of1ForFork1_#t~ret42#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#m~0.base=|v_~#m~0.base_14|, ~#m~0.offset=|v_~#m~0.offset_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_15|, ~#m~0.base=|v_~#m~0.base_14|, t1Thread1of1ForFork1_#t~ret42#1=|v_t1Thread1of1ForFork1_#t~ret42#1_1|, ~#m~0.offset=|v_~#m~0.offset_14|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_#t~ret42#1][1852], [1995#(<= 1 ~top~0), t2Thread1of1ForFork0InUse, 2019#(<= 1 ~top~0), t1Thread1of1ForFork1InUse, 1976#true, 18#L1007true, 587#true, 18644#(<= 1 ~top~0), 1988#true, 1982#true, 2003#true, 6583#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 17203#(< ~top~0 2147483645), 8149#(<= |t1Thread1of1ForFork1_~i~0#1| 399), 25425#(< ~top~0 2147483645), 15#L1022-4true, 8158#(<= 1 ~top~0), 1940#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 13311#(< ~top~0 2147483647), 581#true, 5202#(< ~top~0 2147483646), 1971#(<= |t2Thread1of1ForFork0_~i~1#1| 399), 23#L998-3true]) [2025-03-15 01:26:11,992 INFO L294 olderBase$Statistics]: this new event has 833 ancestors and is cut-off event [2025-03-15 01:26:11,992 INFO L297 olderBase$Statistics]: existing Event has 664 ancestors and is cut-off event [2025-03-15 01:26:11,992 INFO L297 olderBase$Statistics]: existing Event has 695 ancestors and is cut-off event [2025-03-15 01:26:11,992 INFO L297 olderBase$Statistics]: existing Event has 737 ancestors and is cut-off event [2025-03-15 01:26:15,166 INFO L124 PetriNetUnfolderBase]: 7540/45845 cut-off events. [2025-03-15 01:26:15,166 INFO L125 PetriNetUnfolderBase]: For 1454301/1489035 co-relation queries the response was YES. [2025-03-15 01:26:15,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267680 conditions, 45845 events. 7540/45845 cut-off events. For 1454301/1489035 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 533994 event pairs, 1012 based on Foata normal form. 197/41835 useless extension candidates. Maximal degree in co-relation 258799. Up to 12926 conditions per place. [2025-03-15 01:26:15,599 INFO L140 encePairwiseOnDemand]: 571/581 looper letters, 3129 selfloop transitions, 442 changer transitions 1223/5358 dead transitions. [2025-03-15 01:26:15,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 750 places, 5358 transitions, 163328 flow [2025-03-15 01:26:15,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-15 01:26:15,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-15 01:26:15,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 17015 transitions. [2025-03-15 01:26:15,605 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9447004608294931 [2025-03-15 01:26:15,606 INFO L298 CegarLoopForPetriNet]: 578 programPoint places, 172 predicate places. [2025-03-15 01:26:15,606 INFO L471 AbstractCegarLoop]: Abstraction has has 750 places, 5358 transitions, 163328 flow [2025-03-15 01:26:15,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 547.95) internal successors, (10959), 20 states have internal predecessors, (10959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:26:15,607 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:15,607 INFO L221 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:26:15,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-15 01:26:15,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-15 01:26:15,808 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:26:15,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:15,809 INFO L85 PathProgramCache]: Analyzing trace with hash 2100934792, now seen corresponding path program 2 times [2025-03-15 01:26:15,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:15,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064012366] [2025-03-15 01:26:15,809 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:26:15,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:15,858 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:26:15,858 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:26:16,532 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 0 proven. 858 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:16,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:16,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064012366] [2025-03-15 01:26:16,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064012366] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:26:16,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830658780] [2025-03-15 01:26:16,532 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:26:16,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:26:16,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:26:16,534 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:26:16,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-15 01:26:16,718 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:26:16,718 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:26:16,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 1435 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-15 01:26:16,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:26:17,187 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 0 proven. 858 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:17,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:26:17,766 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 0 proven. 858 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:17,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830658780] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:26:17,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:26:17,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 31 [2025-03-15 01:26:17,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269135357] [2025-03-15 01:26:17,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:26:17,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-15 01:26:17,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:17,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-15 01:26:17,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2025-03-15 01:26:17,773 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 549 out of 581 [2025-03-15 01:26:17,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 750 places, 5358 transitions, 163328 flow. Second operand has 32 states, 32 states have (on average 554.0) internal successors, (17728), 32 states have internal predecessors, (17728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:26:17,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:17,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 549 of 581 [2025-03-15 01:26:17,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:42,783 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1280] L998-->L998-3: Formula: (and (= |v_#pthreadsMutex_15| (store |v_#pthreadsMutex_16| |v_~#m~0.base_14| (store (select |v_#pthreadsMutex_16| |v_~#m~0.base_14|) |v_~#m~0.offset_14| 0))) (= |v_t1Thread1of1ForFork1_#t~ret42#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#m~0.base=|v_~#m~0.base_14|, ~#m~0.offset=|v_~#m~0.offset_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_15|, ~#m~0.base=|v_~#m~0.base_14|, t1Thread1of1ForFork1_#t~ret42#1=|v_t1Thread1of1ForFork1_#t~ret42#1_1|, ~#m~0.offset=|v_~#m~0.offset_14|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_#t~ret42#1][2500], [1995#(<= 1 ~top~0), t2Thread1of1ForFork0InUse, 2019#(<= 1 ~top~0), t1Thread1of1ForFork1InUse, 1976#true, 587#true, 18644#(<= 1 ~top~0), 1988#true, 30171#(< ~top~0 2147483641), 1982#true, 6583#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 2003#true, 17203#(< ~top~0 2147483645), 8149#(<= |t1Thread1of1ForFork1_~i~0#1| 399), 1967#(and (<= 0 (+ |t2Thread1of1ForFork0_#t~post47#1| 2147483648)) (<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|))), 25425#(< ~top~0 2147483645), 15#L1022-4true, 1972#(<= |t2Thread1of1ForFork0_#t~post47#1| 399), 8158#(<= 1 ~top~0), 13311#(< ~top~0 2147483647), 581#true, 5202#(< ~top~0 2147483646), 531#L1005-6true, 23#L998-3true]) [2025-03-15 01:26:42,784 INFO L294 olderBase$Statistics]: this new event has 781 ancestors and is cut-off event [2025-03-15 01:26:42,784 INFO L297 olderBase$Statistics]: existing Event has 704 ancestors and is cut-off event [2025-03-15 01:26:42,784 INFO L297 olderBase$Statistics]: existing Event has 735 ancestors and is cut-off event [2025-03-15 01:26:42,784 INFO L297 olderBase$Statistics]: existing Event has 781 ancestors and is cut-off event [2025-03-15 01:27:02,046 INFO L124 PetriNetUnfolderBase]: 9356/57307 cut-off events. [2025-03-15 01:27:02,047 INFO L125 PetriNetUnfolderBase]: For 1986420/2029033 co-relation queries the response was YES. [2025-03-15 01:27:02,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351764 conditions, 57307 events. 9356/57307 cut-off events. For 1986420/2029033 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 664617 event pairs, 1277 based on Foata normal form. 220/52282 useless extension candidates. Maximal degree in co-relation 337047. Up to 15465 conditions per place. [2025-03-15 01:27:02,661 INFO L140 encePairwiseOnDemand]: 573/581 looper letters, 3700 selfloop transitions, 313 changer transitions 1458/6306 dead transitions. [2025-03-15 01:27:02,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 793 places, 6306 transitions, 208930 flow [2025-03-15 01:27:02,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-15 01:27:02,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-03-15 01:27:02,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 24485 transitions. [2025-03-15 01:27:02,672 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9577922077922078 [2025-03-15 01:27:02,673 INFO L298 CegarLoopForPetriNet]: 578 programPoint places, 215 predicate places. [2025-03-15 01:27:02,673 INFO L471 AbstractCegarLoop]: Abstraction has has 793 places, 6306 transitions, 208930 flow [2025-03-15 01:27:02,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 554.0) internal successors, (17728), 32 states have internal predecessors, (17728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:27:02,674 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:27:02,675 INFO L221 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:27:02,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-15 01:27:02,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:27:02,875 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:27:02,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:27:02,877 INFO L85 PathProgramCache]: Analyzing trace with hash -240542295, now seen corresponding path program 2 times [2025-03-15 01:27:02,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:27:02,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504448520] [2025-03-15 01:27:02,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:27:02,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:27:02,988 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:27:02,988 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:27:03,847 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 0 proven. 692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:27:03,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:27:03,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504448520] [2025-03-15 01:27:03,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504448520] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:27:03,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347744259] [2025-03-15 01:27:03,847 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:27:03,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:27:03,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:27:03,849 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:27:03,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-15 01:27:04,045 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:27:04,046 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:27:04,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 1610 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-15 01:27:04,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:27:04,548 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 0 proven. 692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:27:04,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:27:05,166 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 0 proven. 692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:27:05,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347744259] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:27:05,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:27:05,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 33 [2025-03-15 01:27:05,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033051130] [2025-03-15 01:27:05,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:27:05,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-15 01:27:05,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:27:05,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-15 01:27:05,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=846, Unknown=0, NotChecked=0, Total=1122 [2025-03-15 01:27:05,173 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 581 [2025-03-15 01:27:05,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 793 places, 6306 transitions, 208930 flow. Second operand has 34 states, 34 states have (on average 547.4411764705883) internal successors, (18613), 34 states have internal predecessors, (18613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:27:05,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:27:05,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 581 [2025-03-15 01:27:05,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:28:40,233 INFO L124 PetriNetUnfolderBase]: 15041/92810 cut-off events. [2025-03-15 01:28:40,234 INFO L125 PetriNetUnfolderBase]: For 3526543/3598547 co-relation queries the response was YES. [2025-03-15 01:28:41,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 595439 conditions, 92810 events. 15041/92810 cut-off events. For 3526543/3598547 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 1196197 event pairs, 2163 based on Foata normal form. 213/84557 useless extension candidates. Maximal degree in co-relation 577647. Up to 25777 conditions per place. [2025-03-15 01:28:41,551 INFO L140 encePairwiseOnDemand]: 571/581 looper letters, 6207 selfloop transitions, 888 changer transitions 2431/10090 dead transitions. [2025-03-15 01:28:41,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 849 places, 10090 transitions, 359946 flow [2025-03-15 01:28:41,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-15 01:28:41,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2025-03-15 01:28:41,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 31285 transitions. [2025-03-15 01:28:41,562 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9446809795573271 [2025-03-15 01:28:41,563 INFO L298 CegarLoopForPetriNet]: 578 programPoint places, 271 predicate places. [2025-03-15 01:28:41,563 INFO L471 AbstractCegarLoop]: Abstraction has has 849 places, 10090 transitions, 359946 flow [2025-03-15 01:28:41,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 547.4411764705883) internal successors, (18613), 34 states have internal predecessors, (18613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:28:41,565 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:28:41,569 INFO L221 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:28:41,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-15 01:28:41,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:28:41,770 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:28:41,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:28:41,772 INFO L85 PathProgramCache]: Analyzing trace with hash -587423969, now seen corresponding path program 2 times [2025-03-15 01:28:41,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:28:41,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294170072] [2025-03-15 01:28:41,772 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:28:41,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:28:41,949 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:28:41,949 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:28:43,624 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:28:43,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:28:43,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294170072] [2025-03-15 01:28:43,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294170072] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:28:43,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684652644] [2025-03-15 01:28:43,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:28:43,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:28:43,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:28:43,627 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:28:43,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-15 01:28:43,950 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:28:43,950 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:28:43,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 1684 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-15 01:28:43,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:28:44,764 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:28:44,764 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:28:45,414 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:28:45,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684652644] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:28:45,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:28:45,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 33 [2025-03-15 01:28:45,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638642816] [2025-03-15 01:28:45,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:28:45,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-15 01:28:45,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:28:45,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-15 01:28:45,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=879, Unknown=0, NotChecked=0, Total=1122 [2025-03-15 01:28:45,421 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 531 out of 581 [2025-03-15 01:28:45,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 849 places, 10090 transitions, 359946 flow. Second operand has 34 states, 34 states have (on average 537.6176470588235) internal successors, (18279), 34 states have internal predecessors, (18279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:28:45,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:28:45,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 531 of 581 [2025-03-15 01:28:45,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:33:52,707 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1280] L998-->L998-3: Formula: (and (= |v_#pthreadsMutex_15| (store |v_#pthreadsMutex_16| |v_~#m~0.base_14| (store (select |v_#pthreadsMutex_16| |v_~#m~0.base_14|) |v_~#m~0.offset_14| 0))) (= |v_t1Thread1of1ForFork1_#t~ret42#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#m~0.base=|v_~#m~0.base_14|, ~#m~0.offset=|v_~#m~0.offset_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_15|, ~#m~0.base=|v_~#m~0.base_14|, t1Thread1of1ForFork1_#t~ret42#1=|v_t1Thread1of1ForFork1_#t~ret42#1_1|, ~#m~0.offset=|v_~#m~0.offset_14|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_#t~ret42#1][3764], [2019#(<= 1 ~top~0), t2Thread1of1ForFork0InUse, t1Thread1of1ForFork1InUse, 1976#true, 40495#(< ~top~0 2147483642), 1988#true, 6583#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 1982#true, 30171#(< ~top~0 2147483641), 1967#(and (<= 0 (+ |t2Thread1of1ForFork0_#t~post47#1| 2147483648)) (<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|))), 15#L1022-4true, 1972#(<= |t2Thread1of1ForFork0_#t~post47#1| 399), 8158#(<= 1 ~top~0), 13311#(< ~top~0 2147483647), 23#L998-3true, 1995#(<= 1 ~top~0), 587#true, 2003#true, 35182#(< ~top~0 2147483641), 17203#(< ~top~0 2147483645), 8149#(<= |t1Thread1of1ForFork1_~i~0#1| 399), 25425#(< ~top~0 2147483645), 581#true, 22655#(and (<= 1 ~top~0) (= |t2Thread1of1ForFork0_get_top_#res#1| ~top~0)), 5202#(< ~top~0 2147483646), 531#L1005-6true]) [2025-03-15 01:33:52,707 INFO L294 olderBase$Statistics]: this new event has 915 ancestors and is cut-off event [2025-03-15 01:33:52,707 INFO L297 olderBase$Statistics]: existing Event has 770 ancestors and is cut-off event [2025-03-15 01:33:52,707 INFO L297 olderBase$Statistics]: existing Event has 827 ancestors and is cut-off event [2025-03-15 01:33:52,707 INFO L297 olderBase$Statistics]: existing Event has 735 ancestors and is cut-off event [2025-03-15 01:33:52,708 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1280] L998-->L998-3: Formula: (and (= |v_#pthreadsMutex_15| (store |v_#pthreadsMutex_16| |v_~#m~0.base_14| (store (select |v_#pthreadsMutex_16| |v_~#m~0.base_14|) |v_~#m~0.offset_14| 0))) (= |v_t1Thread1of1ForFork1_#t~ret42#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#m~0.base=|v_~#m~0.base_14|, ~#m~0.offset=|v_~#m~0.offset_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_15|, ~#m~0.base=|v_~#m~0.base_14|, t1Thread1of1ForFork1_#t~ret42#1=|v_t1Thread1of1ForFork1_#t~ret42#1_1|, ~#m~0.offset=|v_~#m~0.offset_14|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_#t~ret42#1][3765], [t2Thread1of1ForFork0InUse, 2019#(<= 1 ~top~0), t1Thread1of1ForFork1InUse, 1976#true, 18#L1007true, 40495#(< ~top~0 2147483642), 1988#true, 1982#true, 30171#(< ~top~0 2147483641), 6583#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 15#L1022-4true, 1940#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 8158#(<= 1 ~top~0), 13311#(< ~top~0 2147483647), 1971#(<= |t2Thread1of1ForFork0_~i~1#1| 399), 23#L998-3true, 1995#(<= 1 ~top~0), 587#true, 2003#true, 35182#(< ~top~0 2147483641), 17203#(< ~top~0 2147483645), 8149#(<= |t1Thread1of1ForFork1_~i~0#1| 399), 25425#(< ~top~0 2147483645), 581#true, 22655#(and (<= 1 ~top~0) (= |t2Thread1of1ForFork0_get_top_#res#1| ~top~0)), 5202#(< ~top~0 2147483646)]) [2025-03-15 01:33:52,708 INFO L294 olderBase$Statistics]: this new event has 917 ancestors and is cut-off event [2025-03-15 01:33:52,708 INFO L297 olderBase$Statistics]: existing Event has 737 ancestors and is cut-off event [2025-03-15 01:33:52,708 INFO L297 olderBase$Statistics]: existing Event has 772 ancestors and is cut-off event [2025-03-15 01:33:52,708 INFO L297 olderBase$Statistics]: existing Event has 829 ancestors and is cut-off event [2025-03-15 01:33:52,708 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1280] L998-->L998-3: Formula: (and (= |v_#pthreadsMutex_15| (store |v_#pthreadsMutex_16| |v_~#m~0.base_14| (store (select |v_#pthreadsMutex_16| |v_~#m~0.base_14|) |v_~#m~0.offset_14| 0))) (= |v_t1Thread1of1ForFork1_#t~ret42#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#m~0.base=|v_~#m~0.base_14|, ~#m~0.offset=|v_~#m~0.offset_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_15|, ~#m~0.base=|v_~#m~0.base_14|, t1Thread1of1ForFork1_#t~ret42#1=|v_t1Thread1of1ForFork1_#t~ret42#1_1|, ~#m~0.offset=|v_~#m~0.offset_14|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_#t~ret42#1][3766], [2019#(<= 1 ~top~0), t2Thread1of1ForFork0InUse, t1Thread1of1ForFork1InUse, 1976#true, 40495#(< ~top~0 2147483642), 1988#true, 30171#(< ~top~0 2147483641), 6583#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 1982#true, 1969#true, 15#L1022-4true, 8158#(<= 1 ~top~0), 1940#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 13311#(< ~top~0 2147483647), 23#L998-3true, 1995#(<= 1 ~top~0), 587#true, 35182#(< ~top~0 2147483641), 2003#true, 17203#(< ~top~0 2147483645), 8149#(<= |t1Thread1of1ForFork1_~i~0#1| 399), 25425#(< ~top~0 2147483645), 347#L1005-7true, 22655#(and (<= 1 ~top~0) (= |t2Thread1of1ForFork0_get_top_#res#1| ~top~0)), 581#true, 5202#(< ~top~0 2147483646)]) [2025-03-15 01:33:52,708 INFO L294 olderBase$Statistics]: this new event has 916 ancestors and is cut-off event [2025-03-15 01:33:52,708 INFO L297 olderBase$Statistics]: existing Event has 736 ancestors and is cut-off event [2025-03-15 01:33:52,708 INFO L297 olderBase$Statistics]: existing Event has 771 ancestors and is cut-off event [2025-03-15 01:33:52,708 INFO L297 olderBase$Statistics]: existing Event has 828 ancestors and is cut-off event [2025-03-15 01:33:52,708 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1280] L998-->L998-3: Formula: (and (= |v_#pthreadsMutex_15| (store |v_#pthreadsMutex_16| |v_~#m~0.base_14| (store (select |v_#pthreadsMutex_16| |v_~#m~0.base_14|) |v_~#m~0.offset_14| 0))) (= |v_t1Thread1of1ForFork1_#t~ret42#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#m~0.base=|v_~#m~0.base_14|, ~#m~0.offset=|v_~#m~0.offset_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_15|, ~#m~0.base=|v_~#m~0.base_14|, t1Thread1of1ForFork1_#t~ret42#1=|v_t1Thread1of1ForFork1_#t~ret42#1_1|, ~#m~0.offset=|v_~#m~0.offset_14|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_#t~ret42#1][3766], [2019#(<= 1 ~top~0), t2Thread1of1ForFork0InUse, t1Thread1of1ForFork1InUse, 1976#true, 1988#true, 40495#(< ~top~0 2147483642), 30171#(< ~top~0 2147483641), 6583#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 1982#true, 1969#true, 15#L1022-4true, 8158#(<= 1 ~top~0), 1940#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 13311#(< ~top~0 2147483647), 196#L1015true, 23#L998-3true, 1995#(<= 1 ~top~0), 587#true, 35182#(< ~top~0 2147483641), 2003#true, 17203#(< ~top~0 2147483645), 8149#(<= |t1Thread1of1ForFork1_~i~0#1| 399), 25425#(< ~top~0 2147483645), 22655#(and (<= 1 ~top~0) (= |t2Thread1of1ForFork0_get_top_#res#1| ~top~0)), 581#true, 5202#(< ~top~0 2147483646)]) [2025-03-15 01:33:52,708 INFO L294 olderBase$Statistics]: this new event has 917 ancestors and is cut-off event [2025-03-15 01:33:52,708 INFO L297 olderBase$Statistics]: existing Event has 737 ancestors and is cut-off event [2025-03-15 01:33:52,708 INFO L297 olderBase$Statistics]: existing Event has 772 ancestors and is cut-off event [2025-03-15 01:33:52,708 INFO L297 olderBase$Statistics]: existing Event has 829 ancestors and is cut-off event [2025-03-15 01:36:48,032 INFO L124 PetriNetUnfolderBase]: 33973/209807 cut-off events. [2025-03-15 01:36:48,033 INFO L125 PetriNetUnfolderBase]: For 8699194/8894950 co-relation queries the response was YES. [2025-03-15 01:36:50,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1440579 conditions, 209807 events. 33973/209807 cut-off events. For 8699194/8894950 co-relation queries the response was YES. Maximal size of possible extension queue 1181. Compared 3150273 event pairs, 5351 based on Foata normal form. 1163/192096 useless extension candidates. Maximal degree in co-relation 1410517. Up to 61324 conditions per place. [2025-03-15 01:36:51,534 INFO L140 encePairwiseOnDemand]: 564/581 looper letters, 14215 selfloop transitions, 2820 changer transitions 5684/23248 dead transitions. [2025-03-15 01:36:51,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 912 places, 23248 transitions, 883911 flow [2025-03-15 01:36:51,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-03-15 01:36:51,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2025-03-15 01:36:51,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 34492 transitions. [2025-03-15 01:36:51,547 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9276032702237521 [2025-03-15 01:36:51,547 INFO L298 CegarLoopForPetriNet]: 578 programPoint places, 334 predicate places. [2025-03-15 01:36:51,548 INFO L471 AbstractCegarLoop]: Abstraction has has 912 places, 23248 transitions, 883911 flow [2025-03-15 01:36:51,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 537.6176470588235) internal successors, (18279), 34 states have internal predecessors, (18279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:36:51,549 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:36:51,550 INFO L221 CegarLoopForPetriNet]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:36:51,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-15 01:36:51,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-15 01:36:51,751 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:36:51,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:36:51,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1040952189, now seen corresponding path program 3 times [2025-03-15 01:36:51,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:36:51,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673638842] [2025-03-15 01:36:51,753 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 01:36:51,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:36:52,061 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-15 01:36:52,061 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:36:55,428 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 0 proven. 662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:36:55,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:36:55,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673638842] [2025-03-15 01:36:55,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673638842] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:36:55,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304306466] [2025-03-15 01:36:55,429 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 01:36:55,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:36:55,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:36:55,431 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:36:55,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-15 01:36:56,970 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-15 01:36:56,970 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:36:56,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 1768 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-15 01:36:57,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:36:57,776 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 0 proven. 662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:36:57,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:36:58,774 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 0 proven. 662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:36:58,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304306466] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:36:58,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:36:58,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 17, 17] total 45 [2025-03-15 01:36:58,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194904839] [2025-03-15 01:36:58,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:36:58,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-15 01:36:58,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:36:58,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-15 01:36:58,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=429, Invalid=1641, Unknown=0, NotChecked=0, Total=2070 [2025-03-15 01:36:58,795 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 535 out of 581 [2025-03-15 01:36:58,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 912 places, 23248 transitions, 883911 flow. Second operand has 46 states, 46 states have (on average 542.1521739130435) internal successors, (24939), 46 states have internal predecessors, (24939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:36:58,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:36:58,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 535 of 581 [2025-03-15 01:36:58,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2025-03-15 01:37:16,616 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-03-15 01:37:16,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-15 01:37:16,618 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2025-03-15 01:37:16,621 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-03-15 01:37:16,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-15 01:37:16,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-15 01:37:16,819 WARN L596 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (46states, 535/581 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 22330 conditions, 3200 events (517/3199 cut-off events. For 164703/167190 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 23066 event pairs, 65 based on Foata normal form. 37/3053 useless extension candidates. Maximal degree in co-relation 19273. Up to 672 conditions per place.). [2025-03-15 01:37:16,822 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 18 remaining) [2025-03-15 01:37:16,822 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 18 remaining) [2025-03-15 01:37:16,822 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2025-03-15 01:37:16,822 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2025-03-15 01:37:16,822 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2025-03-15 01:37:16,822 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2025-03-15 01:37:16,822 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2025-03-15 01:37:16,822 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2025-03-15 01:37:16,822 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2025-03-15 01:37:16,822 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2025-03-15 01:37:16,822 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2025-03-15 01:37:16,822 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2025-03-15 01:37:16,823 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2025-03-15 01:37:16,823 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2025-03-15 01:37:16,823 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2025-03-15 01:37:16,823 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2025-03-15 01:37:16,823 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2025-03-15 01:37:16,823 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:37:16,835 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:37:16,835 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:37:16,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:37:16 BasicIcfg [2025-03-15 01:37:16,851 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:37:16,852 INFO L158 Benchmark]: Toolchain (without parser) took 745756.34ms. Allocated memory was 71.3MB in the beginning and 7.5GB in the end (delta: 7.4GB). Free memory was 43.2MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 6.1GB. Max. memory is 8.0GB. [2025-03-15 01:37:16,852 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 71.3MB. Free memory is still 32.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:37:16,852 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.05ms. Allocated memory is still 71.3MB. Free memory was 43.0MB in the beginning and 32.7MB in the end (delta: 10.3MB). Peak memory consumption was 26.8MB. Max. memory is 8.0GB. [2025-03-15 01:37:16,852 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.77ms. Allocated memory is still 71.3MB. Free memory was 32.7MB in the beginning and 27.1MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:37:16,853 INFO L158 Benchmark]: Boogie Preprocessor took 58.40ms. Allocated memory is still 71.3MB. Free memory was 27.1MB in the beginning and 23.2MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:37:16,853 INFO L158 Benchmark]: RCFGBuilder took 831.63ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 23.2MB in the beginning and 41.6MB in the end (delta: -18.4MB). Peak memory consumption was 15.5MB. Max. memory is 8.0GB. [2025-03-15 01:37:16,853 INFO L158 Benchmark]: TraceAbstraction took 744316.95ms. Allocated memory was 88.1MB in the beginning and 7.5GB in the end (delta: 7.4GB). Free memory was 40.4MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 6.1GB. Max. memory is 8.0GB. [2025-03-15 01:37:16,854 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 71.3MB. Free memory is still 32.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 475.05ms. Allocated memory is still 71.3MB. Free memory was 43.0MB in the beginning and 32.7MB in the end (delta: 10.3MB). Peak memory consumption was 26.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 68.77ms. Allocated memory is still 71.3MB. Free memory was 32.7MB in the beginning and 27.1MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.40ms. Allocated memory is still 71.3MB. Free memory was 27.1MB in the beginning and 23.2MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 831.63ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 23.2MB in the beginning and 41.6MB in the end (delta: -18.4MB). Peak memory consumption was 15.5MB. Max. memory is 8.0GB. * TraceAbstraction took 744316.95ms. Allocated memory was 88.1MB in the beginning and 7.5GB in the end (delta: 7.4GB). Free memory was 40.4MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 6.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 944]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (46states, 535/581 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 22330 conditions, 3200 events (517/3199 cut-off events. For 164703/167190 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 23066 event pairs, 65 based on Foata normal form. 37/3053 useless extension candidates. Maximal degree in co-relation 19273. Up to 672 conditions per place.). - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (46states, 535/581 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 22330 conditions, 3200 events (517/3199 cut-off events. For 164703/167190 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 23066 event pairs, 65 based on Foata normal form. 37/3053 useless extension candidates. Maximal degree in co-relation 19273. Up to 672 conditions per place.). - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (46states, 535/581 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 22330 conditions, 3200 events (517/3199 cut-off events. For 164703/167190 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 23066 event pairs, 65 based on Foata normal form. 37/3053 useless extension candidates. Maximal degree in co-relation 19273. Up to 672 conditions per place.). - TimeoutResultAtElement [Line: 944]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (46states, 535/581 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 22330 conditions, 3200 events (517/3199 cut-off events. For 164703/167190 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 23066 event pairs, 65 based on Foata normal form. 37/3053 useless extension candidates. Maximal degree in co-relation 19273. Up to 672 conditions per place.). - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (46states, 535/581 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 22330 conditions, 3200 events (517/3199 cut-off events. For 164703/167190 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 23066 event pairs, 65 based on Foata normal form. 37/3053 useless extension candidates. Maximal degree in co-relation 19273. Up to 672 conditions per place.). - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (46states, 535/581 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 22330 conditions, 3200 events (517/3199 cut-off events. For 164703/167190 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 23066 event pairs, 65 based on Foata normal form. 37/3053 useless extension candidates. Maximal degree in co-relation 19273. Up to 672 conditions per place.). - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (46states, 535/581 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 22330 conditions, 3200 events (517/3199 cut-off events. For 164703/167190 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 23066 event pairs, 65 based on Foata normal form. 37/3053 useless extension candidates. Maximal degree in co-relation 19273. Up to 672 conditions per place.). - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (46states, 535/581 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 22330 conditions, 3200 events (517/3199 cut-off events. For 164703/167190 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 23066 event pairs, 65 based on Foata normal form. 37/3053 useless extension candidates. Maximal degree in co-relation 19273. Up to 672 conditions per place.). - TimeoutResultAtElement [Line: 948]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (46states, 535/581 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 22330 conditions, 3200 events (517/3199 cut-off events. For 164703/167190 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 23066 event pairs, 65 based on Foata normal form. 37/3053 useless extension candidates. Maximal degree in co-relation 19273. Up to 672 conditions per place.). - TimeoutResultAtElement [Line: 948]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (46states, 535/581 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 22330 conditions, 3200 events (517/3199 cut-off events. For 164703/167190 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 23066 event pairs, 65 based on Foata normal form. 37/3053 useless extension candidates. Maximal degree in co-relation 19273. Up to 672 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 705 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 744.1s, OverallIterations: 22, TraceHistogramMax: 9, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 711.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2782 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2782 mSDsluCounter, 1338 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1129 mSDsCounter, 140 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5014 IncrementalHoareTripleChecker+Invalid, 5154 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 140 mSolverCounterUnsat, 209 mSDtfsCounter, 5014 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15832 GetRequests, 15298 SyntacticMatches, 1 SemanticMatches, 533 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6928 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=883911occurred in iteration=21, InterpolantAutomatonStates: 389, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 24.6s InterpolantComputationTime, 21146 NumberOfCodeBlocks, 21146 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 28059 ConstructedInterpolants, 0 QuantifiedInterpolants, 78877 SizeOfPredicates, 124 NumberOfNonLiveVariables, 16706 ConjunctsInSsa, 150 ConjunctsInUnsatCore, 45 InterpolantComputations, 12 PerfectInterpolantSequences, 131/9593 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown