/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-2.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:24:57,793 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:24:57,852 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:57,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:24:57,901 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:24:57,901 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:24:57,901 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:24:57,906 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:24:57,907 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:24:57,907 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:24:57,908 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:24:57,908 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:24:57,908 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:24:57,908 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:24:57,908 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:24:57,909 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:24:57,909 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:24:57,909 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:24:57,909 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:24:57,909 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:24:57,909 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:24:57,909 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:24:57,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:24:57,909 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:24:57,916 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:24:57,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:24:57,917 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:24:57,917 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:24:57,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:24:57,917 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:24:57,917 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:24:57,917 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:24:57,917 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:58,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:24:58,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:24:58,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:24:58,222 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:24:58,222 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:24:58,223 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longer-2.i [2025-03-15 01:24:59,440 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae96cd220/7459062836cf4024a6e0fa12c176bcc8/FLAGfb0512640 [2025-03-15 01:24:59,694 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:24:59,696 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-2.i [2025-03-15 01:24:59,711 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae96cd220/7459062836cf4024a6e0fa12c176bcc8/FLAGfb0512640 [2025-03-15 01:24:59,726 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae96cd220/7459062836cf4024a6e0fa12c176bcc8 [2025-03-15 01:24:59,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:24:59,729 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:24:59,731 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:24:59,731 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:24:59,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:24:59,734 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:24:59" (1/1) ... [2025-03-15 01:24:59,735 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@704e5fed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:59, skipping insertion in model container [2025-03-15 01:24:59,735 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:24:59" (1/1) ... [2025-03-15 01:24:59,762 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:25:00,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:25:00,149 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:25:00,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:25:00,284 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:25:00,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:25:00 WrapperNode [2025-03-15 01:25:00,286 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:25:00,287 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:25:00,287 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:25:00,287 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:25:00,292 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:25:00" (1/1) ... [2025-03-15 01:25:00,317 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:25:00" (1/1) ... [2025-03-15 01:25:00,359 INFO L138 Inliner]: procedures = 277, calls = 431, calls flagged for inlining = 12, calls inlined = 13, statements flattened = 551 [2025-03-15 01:25:00,359 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:25:00,360 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:25:00,360 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:25:00,360 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:25:00,365 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:25:00" (1/1) ... [2025-03-15 01:25:00,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:25:00" (1/1) ... [2025-03-15 01:25:00,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:25:00" (1/1) ... [2025-03-15 01:25:00,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:25:00" (1/1) ... [2025-03-15 01:25:00,386 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:25:00" (1/1) ... [2025-03-15 01:25:00,389 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:25:00" (1/1) ... [2025-03-15 01:25:00,393 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:25:00" (1/1) ... [2025-03-15 01:25:00,395 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:25:00" (1/1) ... [2025-03-15 01:25:00,401 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:25:00" (1/1) ... [2025-03-15 01:25:00,404 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:25:00,409 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:25:00,409 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:25:00,409 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:25:00,411 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:25:00" (1/1) ... [2025-03-15 01:25:00,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:25:00,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:25:00,442 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:25:00,445 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:25:00,487 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-15 01:25:00,488 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-15 01:25:00,488 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-15 01:25:00,488 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-15 01:25:00,488 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 01:25:00,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 01:25:00,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 01:25:00,488 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 01:25:00,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:25:00,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:25:00,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:25:00,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:25:00,489 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:25:00,595 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:25:00,597 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:25:01,205 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:25:01,205 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:25:01,243 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:25:01,243 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 01:25:01,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:25:01 BoogieIcfgContainer [2025-03-15 01:25:01,246 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:25:01,248 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:25:01,249 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:25:01,253 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:25:01,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:24:59" (1/3) ... [2025-03-15 01:25:01,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38730e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:25:01, skipping insertion in model container [2025-03-15 01:25:01,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:25:00" (2/3) ... [2025-03-15 01:25:01,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38730e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:25:01, skipping insertion in model container [2025-03-15 01:25:01,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:25:01" (3/3) ... [2025-03-15 01:25:01,254 INFO L128 eAbstractionObserver]: Analyzing ICFG stack_longer-2.i [2025-03-15 01:25:01,269 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:25:01,271 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG stack_longer-2.i that has 3 procedures, 565 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-03-15 01:25:01,271 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:25:01,390 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 01:25:01,440 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:25:01,453 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;@170547f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:25:01,453 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-15 01:25:01,607 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:25:01,607 INFO L124 PetriNetUnfolderBase]: 1/473 cut-off events. [2025-03-15 01:25:01,609 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-15 01:25:01,610 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:01,611 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:25:01,612 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:25:01,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:01,619 INFO L85 PathProgramCache]: Analyzing trace with hash -294179811, now seen corresponding path program 1 times [2025-03-15 01:25:01,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:01,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284184840] [2025-03-15 01:25:01,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:01,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:02,394 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,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:02,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284184840] [2025-03-15 01:25:02,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284184840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:02,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:02,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:25:02,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720070974] [2025-03-15 01:25:02,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:02,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:25:02,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:02,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:25:02,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:25:02,433 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 574 [2025-03-15 01:25:02,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 574 transitions, 1162 flow. Second operand has 4 states, 4 states have (on average 550.25) internal successors, (2201), 4 states have internal predecessors, (2201), 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,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:02,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 574 [2025-03-15 01:25:02,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:02,796 INFO L124 PetriNetUnfolderBase]: 114/1030 cut-off events. [2025-03-15 01:25:02,796 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2025-03-15 01:25:02,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1263 conditions, 1030 events. 114/1030 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3893 event pairs, 29 based on Foata normal form. 55/1000 useless extension candidates. Maximal degree in co-relation 591. Up to 121 conditions per place. [2025-03-15 01:25:02,810 INFO L140 encePairwiseOnDemand]: 562/574 looper letters, 31 selfloop transitions, 4 changer transitions 5/578 dead transitions. [2025-03-15 01:25:02,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 578 transitions, 1249 flow [2025-03-15 01:25:02,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:25:02,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:25:02,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2795 transitions. [2025-03-15 01:25:02,828 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9738675958188153 [2025-03-15 01:25:02,833 INFO L298 CegarLoopForPetriNet]: 571 programPoint places, -4 predicate places. [2025-03-15 01:25:02,833 INFO L471 AbstractCegarLoop]: Abstraction has has 567 places, 578 transitions, 1249 flow [2025-03-15 01:25:02,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 550.25) internal successors, (2201), 4 states have internal predecessors, (2201), 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,835 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:02,835 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] [2025-03-15 01:25:02,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:25:02,835 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:25:02,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:02,837 INFO L85 PathProgramCache]: Analyzing trace with hash 405713859, now seen corresponding path program 1 times [2025-03-15 01:25:02,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:02,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68676276] [2025-03-15 01:25:02,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:02,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:03,270 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:03,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:03,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68676276] [2025-03-15 01:25:03,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68676276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:03,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:03,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:25:03,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562845697] [2025-03-15 01:25:03,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:03,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:25:03,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:03,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:25:03,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:25:03,282 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 546 out of 574 [2025-03-15 01:25:03,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 567 places, 578 transitions, 1249 flow. Second operand has 3 states, 3 states have (on average 548.3333333333334) internal successors, (1645), 3 states have internal predecessors, (1645), 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,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:03,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 546 of 574 [2025-03-15 01:25:03,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:03,821 INFO L124 PetriNetUnfolderBase]: 391/2501 cut-off events. [2025-03-15 01:25:03,821 INFO L125 PetriNetUnfolderBase]: For 647/673 co-relation queries the response was YES. [2025-03-15 01:25:03,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3714 conditions, 2501 events. 391/2501 cut-off events. For 647/673 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 15364 event pairs, 146 based on Foata normal form. 4/2207 useless extension candidates. Maximal degree in co-relation 2758. Up to 379 conditions per place. [2025-03-15 01:25:03,842 INFO L140 encePairwiseOnDemand]: 569/574 looper letters, 50 selfloop transitions, 3 changer transitions 6/601 dead transitions. [2025-03-15 01:25:03,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 601 transitions, 1459 flow [2025-03-15 01:25:03,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:25:03,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:25:03,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1673 transitions. [2025-03-15 01:25:03,846 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9715447154471545 [2025-03-15 01:25:03,847 INFO L298 CegarLoopForPetriNet]: 571 programPoint places, -2 predicate places. [2025-03-15 01:25:03,847 INFO L471 AbstractCegarLoop]: Abstraction has has 569 places, 601 transitions, 1459 flow [2025-03-15 01:25:03,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 548.3333333333334) internal successors, (1645), 3 states have internal predecessors, (1645), 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,848 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:03,849 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:25:03,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:25:03,849 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:25:03,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:03,851 INFO L85 PathProgramCache]: Analyzing trace with hash 909807397, now seen corresponding path program 1 times [2025-03-15 01:25:03,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:03,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556808290] [2025-03-15 01:25:03,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:03,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:04,252 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:25:04,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:04,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556808290] [2025-03-15 01:25:04,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556808290] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:25:04,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401801722] [2025-03-15 01:25:04,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:04,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:04,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:25:04,258 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:25:04,259 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:25:04,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:04,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 940 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-15 01:25:04,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:25:04,548 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:25:04,548 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:25:04,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401801722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:04,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:25:04,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-15 01:25:04,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983905755] [2025-03-15 01:25:04,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:04,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:25:04,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:04,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:25:04,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-15 01:25:04,554 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 574 [2025-03-15 01:25:04,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 569 places, 601 transitions, 1459 flow. Second operand has 5 states, 5 states have (on average 551.4) internal successors, (2757), 5 states have internal predecessors, (2757), 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,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:04,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 574 [2025-03-15 01:25:04,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:05,060 INFO L124 PetriNetUnfolderBase]: 367/2407 cut-off events. [2025-03-15 01:25:05,060 INFO L125 PetriNetUnfolderBase]: For 1167/1623 co-relation queries the response was YES. [2025-03-15 01:25:05,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4034 conditions, 2407 events. 367/2407 cut-off events. For 1167/1623 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 14500 event pairs, 98 based on Foata normal form. 42/2182 useless extension candidates. Maximal degree in co-relation 2976. Up to 359 conditions per place. [2025-03-15 01:25:05,074 INFO L140 encePairwiseOnDemand]: 570/574 looper letters, 57 selfloop transitions, 5 changer transitions 6/611 dead transitions. [2025-03-15 01:25:05,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 611 transitions, 1661 flow [2025-03-15 01:25:05,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:25:05,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:25:05,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2217 transitions. [2025-03-15 01:25:05,081 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9655923344947736 [2025-03-15 01:25:05,081 INFO L298 CegarLoopForPetriNet]: 571 programPoint places, 0 predicate places. [2025-03-15 01:25:05,082 INFO L471 AbstractCegarLoop]: Abstraction has has 571 places, 611 transitions, 1661 flow [2025-03-15 01:25:05,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 551.4) internal successors, (2757), 5 states have internal predecessors, (2757), 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,084 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:05,084 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:25:05,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-15 01:25:05,285 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:25:05,285 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:25:05,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:05,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1860740431, now seen corresponding path program 1 times [2025-03-15 01:25:05,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:05,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011712828] [2025-03-15 01:25:05,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:05,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:05,525 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:25:05,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:05,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011712828] [2025-03-15 01:25:05,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011712828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:05,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:05,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:25:05,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457302534] [2025-03-15 01:25:05,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:05,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:25:05,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:05,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:25:05,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:25:05,529 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 574 [2025-03-15 01:25:05,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 611 transitions, 1661 flow. Second operand has 4 states, 4 states have (on average 552.5) internal successors, (2210), 4 states have internal predecessors, (2210), 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,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:05,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 574 [2025-03-15 01:25:05,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:05,986 INFO L124 PetriNetUnfolderBase]: 359/2387 cut-off events. [2025-03-15 01:25:05,986 INFO L125 PetriNetUnfolderBase]: For 1848/2862 co-relation queries the response was YES. [2025-03-15 01:25:05,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4422 conditions, 2387 events. 359/2387 cut-off events. For 1848/2862 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 14295 event pairs, 99 based on Foata normal form. 107/2247 useless extension candidates. Maximal degree in co-relation 3270. Up to 356 conditions per place. [2025-03-15 01:25:05,997 INFO L140 encePairwiseOnDemand]: 568/574 looper letters, 58 selfloop transitions, 8 changer transitions 13/622 dead transitions. [2025-03-15 01:25:05,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 622 transitions, 1913 flow [2025-03-15 01:25:05,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:25:05,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:25:06,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2768 transitions. [2025-03-15 01:25:06,001 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9644599303135889 [2025-03-15 01:25:06,002 INFO L298 CegarLoopForPetriNet]: 571 programPoint places, 3 predicate places. [2025-03-15 01:25:06,002 INFO L471 AbstractCegarLoop]: Abstraction has has 574 places, 622 transitions, 1913 flow [2025-03-15 01:25:06,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 552.5) internal successors, (2210), 4 states have internal predecessors, (2210), 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:06,003 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:06,004 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:25:06,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:25:06,004 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:25:06,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:06,005 INFO L85 PathProgramCache]: Analyzing trace with hash -570576008, now seen corresponding path program 1 times [2025-03-15 01:25:06,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:06,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255912335] [2025-03-15 01:25:06,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:06,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:06,354 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:06,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:06,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255912335] [2025-03-15 01:25:06,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255912335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:06,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:06,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:25:06,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263820348] [2025-03-15 01:25:06,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:06,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:25:06,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:06,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:25:06,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:25:06,359 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 539 out of 574 [2025-03-15 01:25:06,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 622 transitions, 1913 flow. Second operand has 4 states, 4 states have (on average 541.0) internal successors, (2164), 4 states have internal predecessors, (2164), 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:06,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:06,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 539 of 574 [2025-03-15 01:25:06,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:06,983 INFO L124 PetriNetUnfolderBase]: 587/3224 cut-off events. [2025-03-15 01:25:06,983 INFO L125 PetriNetUnfolderBase]: For 4071/4792 co-relation queries the response was YES. [2025-03-15 01:25:06,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7069 conditions, 3224 events. 587/3224 cut-off events. For 4071/4792 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 22012 event pairs, 142 based on Foata normal form. 54/2946 useless extension candidates. Maximal degree in co-relation 5871. Up to 638 conditions per place. [2025-03-15 01:25:07,003 INFO L140 encePairwiseOnDemand]: 567/574 looper letters, 98 selfloop transitions, 8 changer transitions 13/652 dead transitions. [2025-03-15 01:25:07,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 652 transitions, 2307 flow [2025-03-15 01:25:07,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:25:07,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:25:07,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2763 transitions. [2025-03-15 01:25:07,008 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9627177700348432 [2025-03-15 01:25:07,009 INFO L298 CegarLoopForPetriNet]: 571 programPoint places, 7 predicate places. [2025-03-15 01:25:07,009 INFO L471 AbstractCegarLoop]: Abstraction has has 578 places, 652 transitions, 2307 flow [2025-03-15 01:25:07,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 541.0) internal successors, (2164), 4 states have internal predecessors, (2164), 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,010 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:07,011 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] [2025-03-15 01:25:07,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:25:07,011 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:25:07,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:07,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1043191916, now seen corresponding path program 1 times [2025-03-15 01:25:07,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:07,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571279194] [2025-03-15 01:25:07,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:07,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:07,248 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:07,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:07,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571279194] [2025-03-15 01:25:07,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571279194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:07,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:07,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:25:07,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71724134] [2025-03-15 01:25:07,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:07,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:25:07,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:07,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:25:07,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:25:07,253 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 574 [2025-03-15 01:25:07,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 578 places, 652 transitions, 2307 flow. Second operand has 4 states, 4 states have (on average 550.0) internal successors, (2200), 4 states have internal predecessors, (2200), 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,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:07,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 574 [2025-03-15 01:25:07,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:08,113 INFO L124 PetriNetUnfolderBase]: 846/4340 cut-off events. [2025-03-15 01:25:08,114 INFO L125 PetriNetUnfolderBase]: For 10590/11885 co-relation queries the response was YES. [2025-03-15 01:25:08,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10605 conditions, 4340 events. 846/4340 cut-off events. For 10590/11885 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 33957 event pairs, 177 based on Foata normal form. 71/3912 useless extension candidates. Maximal degree in co-relation 9448. Up to 828 conditions per place. [2025-03-15 01:25:08,149 INFO L140 encePairwiseOnDemand]: 567/574 looper letters, 128 selfloop transitions, 4 changer transitions 12/711 dead transitions. [2025-03-15 01:25:08,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 711 transitions, 3244 flow [2025-03-15 01:25:08,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:25:08,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:25:08,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2779 transitions. [2025-03-15 01:25:08,155 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9682926829268292 [2025-03-15 01:25:08,158 INFO L298 CegarLoopForPetriNet]: 571 programPoint places, 11 predicate places. [2025-03-15 01:25:08,158 INFO L471 AbstractCegarLoop]: Abstraction has has 582 places, 711 transitions, 3244 flow [2025-03-15 01:25:08,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 550.0) internal successors, (2200), 4 states have internal predecessors, (2200), 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:08,159 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:08,159 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] [2025-03-15 01:25:08,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:25:08,161 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:08,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:08,163 INFO L85 PathProgramCache]: Analyzing trace with hash -213079662, now seen corresponding path program 1 times [2025-03-15 01:25:08,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:08,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241688216] [2025-03-15 01:25:08,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:08,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:08,454 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:08,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:08,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241688216] [2025-03-15 01:25:08,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241688216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:08,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:08,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:25:08,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112346697] [2025-03-15 01:25:08,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:08,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:25:08,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:08,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:25:08,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:25:08,456 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 574 [2025-03-15 01:25:08,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 582 places, 711 transitions, 3244 flow. Second operand has 3 states, 3 states have (on average 555.6666666666666) internal successors, (1667), 3 states have internal predecessors, (1667), 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:08,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:08,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 574 [2025-03-15 01:25:08,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:08,711 INFO L124 PetriNetUnfolderBase]: 313/1908 cut-off events. [2025-03-15 01:25:08,711 INFO L125 PetriNetUnfolderBase]: For 14674/16367 co-relation queries the response was YES. [2025-03-15 01:25:08,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5224 conditions, 1908 events. 313/1908 cut-off events. For 14674/16367 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 9923 event pairs, 69 based on Foata normal form. 144/1858 useless extension candidates. Maximal degree in co-relation 3998. Up to 322 conditions per place. [2025-03-15 01:25:08,720 INFO L140 encePairwiseOnDemand]: 570/574 looper letters, 29 selfloop transitions, 69 changer transitions 15/674 dead transitions. [2025-03-15 01:25:08,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 584 places, 674 transitions, 3107 flow [2025-03-15 01:25:08,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:25:08,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:25:08,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1675 transitions. [2025-03-15 01:25:08,723 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9727061556329849 [2025-03-15 01:25:08,723 INFO L298 CegarLoopForPetriNet]: 571 programPoint places, 13 predicate places. [2025-03-15 01:25:08,723 INFO L471 AbstractCegarLoop]: Abstraction has has 584 places, 674 transitions, 3107 flow [2025-03-15 01:25:08,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 555.6666666666666) internal successors, (1667), 3 states have internal predecessors, (1667), 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:08,724 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:08,724 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] [2025-03-15 01:25:08,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:25:08,724 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:08,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:08,725 INFO L85 PathProgramCache]: Analyzing trace with hash 895913079, now seen corresponding path program 1 times [2025-03-15 01:25:08,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:08,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584792109] [2025-03-15 01:25:08,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:08,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:08,850 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:08,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:08,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584792109] [2025-03-15 01:25:08,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584792109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:08,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:08,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:25:08,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179206322] [2025-03-15 01:25:08,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:08,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:25:08,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:08,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:25:08,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:25:08,853 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 539 out of 574 [2025-03-15 01:25:08,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 674 transitions, 3107 flow. Second operand has 4 states, 4 states have (on average 542.75) internal successors, (2171), 4 states have internal predecessors, (2171), 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:08,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:08,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 539 of 574 [2025-03-15 01:25:08,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:09,136 INFO L124 PetriNetUnfolderBase]: 346/1963 cut-off events. [2025-03-15 01:25:09,136 INFO L125 PetriNetUnfolderBase]: For 21555/23105 co-relation queries the response was YES. [2025-03-15 01:25:09,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6101 conditions, 1963 events. 346/1963 cut-off events. For 21555/23105 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 10519 event pairs, 68 based on Foata normal form. 60/1808 useless extension candidates. Maximal degree in co-relation 4638. Up to 460 conditions per place. [2025-03-15 01:25:09,146 INFO L140 encePairwiseOnDemand]: 565/574 looper letters, 135 selfloop transitions, 6 changer transitions 6/687 dead transitions. [2025-03-15 01:25:09,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 584 places, 687 transitions, 3628 flow [2025-03-15 01:25:09,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:25:09,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:25:09,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2738 transitions. [2025-03-15 01:25:09,150 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.954006968641115 [2025-03-15 01:25:09,151 INFO L298 CegarLoopForPetriNet]: 571 programPoint places, 13 predicate places. [2025-03-15 01:25:09,151 INFO L471 AbstractCegarLoop]: Abstraction has has 584 places, 687 transitions, 3628 flow [2025-03-15 01:25:09,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 542.75) internal successors, (2171), 4 states have internal predecessors, (2171), 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,152 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:09,152 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] [2025-03-15 01:25:09,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:25:09,152 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:09,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:09,154 INFO L85 PathProgramCache]: Analyzing trace with hash 915844583, now seen corresponding path program 1 times [2025-03-15 01:25:09,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:09,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559511149] [2025-03-15 01:25:09,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:09,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:09,432 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:09,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:09,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559511149] [2025-03-15 01:25:09,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559511149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:09,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:09,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:25:09,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893061067] [2025-03-15 01:25:09,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:09,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:25:09,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:09,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:25:09,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:25:09,435 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 532 out of 574 [2025-03-15 01:25:09,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 687 transitions, 3628 flow. Second operand has 6 states, 6 states have (on average 535.5) internal successors, (3213), 6 states have internal predecessors, (3213), 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,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:09,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 532 of 574 [2025-03-15 01:25:09,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:09,883 INFO L124 PetriNetUnfolderBase]: 441/2413 cut-off events. [2025-03-15 01:25:09,883 INFO L125 PetriNetUnfolderBase]: For 30809/32927 co-relation queries the response was YES. [2025-03-15 01:25:09,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8529 conditions, 2413 events. 441/2413 cut-off events. For 30809/32927 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 13200 event pairs, 85 based on Foata normal form. 76/2208 useless extension candidates. Maximal degree in co-relation 6732. Up to 616 conditions per place. [2025-03-15 01:25:09,898 INFO L140 encePairwiseOnDemand]: 565/574 looper letters, 181 selfloop transitions, 8 changer transitions 21/739 dead transitions. [2025-03-15 01:25:09,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 739 transitions, 4779 flow [2025-03-15 01:25:09,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:25:09,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:25:09,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3803 transitions. [2025-03-15 01:25:09,903 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9464907914385267 [2025-03-15 01:25:09,904 INFO L298 CegarLoopForPetriNet]: 571 programPoint places, 19 predicate places. [2025-03-15 01:25:09,904 INFO L471 AbstractCegarLoop]: Abstraction has has 590 places, 739 transitions, 4779 flow [2025-03-15 01:25:09,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 535.5) internal successors, (3213), 6 states have internal predecessors, (3213), 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,906 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:09,906 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] [2025-03-15 01:25:09,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:25:09,906 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:09,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:09,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1899189149, now seen corresponding path program 1 times [2025-03-15 01:25:09,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:09,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135111141] [2025-03-15 01:25:09,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:09,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:10,133 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:10,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:10,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135111141] [2025-03-15 01:25:10,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135111141] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:25:10,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414773606] [2025-03-15 01:25:10,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:10,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:10,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:25:10,139 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:10,160 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:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:10,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 1012 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 01:25:10,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:25:10,823 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:10,823 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:25:10,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414773606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:10,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:25:10,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-15 01:25:10,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28630070] [2025-03-15 01:25:10,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:10,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:25:10,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:10,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:25:10,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-15 01:25:10,826 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 539 out of 574 [2025-03-15 01:25:10,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 590 places, 739 transitions, 4779 flow. Second operand has 6 states, 6 states have (on average 542.1666666666666) internal successors, (3253), 6 states have internal predecessors, (3253), 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,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:10,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 539 of 574 [2025-03-15 01:25:10,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:11,429 INFO L124 PetriNetUnfolderBase]: 528/3051 cut-off events. [2025-03-15 01:25:11,429 INFO L125 PetriNetUnfolderBase]: For 44246/46611 co-relation queries the response was YES. [2025-03-15 01:25:11,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11440 conditions, 3051 events. 528/3051 cut-off events. For 44246/46611 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 19036 event pairs, 105 based on Foata normal form. 81/2779 useless extension candidates. Maximal degree in co-relation 9341. Up to 783 conditions per place. [2025-03-15 01:25:11,458 INFO L140 encePairwiseOnDemand]: 564/574 looper letters, 220 selfloop transitions, 15 changer transitions 34/809 dead transitions. [2025-03-15 01:25:11,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 597 places, 809 transitions, 6528 flow [2025-03-15 01:25:11,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 01:25:11,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 01:25:11,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 4374 transitions. [2025-03-15 01:25:11,468 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9525261324041812 [2025-03-15 01:25:11,469 INFO L298 CegarLoopForPetriNet]: 571 programPoint places, 26 predicate places. [2025-03-15 01:25:11,469 INFO L471 AbstractCegarLoop]: Abstraction has has 597 places, 809 transitions, 6528 flow [2025-03-15 01:25:11,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 542.1666666666666) internal successors, (3253), 6 states have internal predecessors, (3253), 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,471 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:11,471 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] [2025-03-15 01:25:11,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-15 01:25:11,672 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:11,672 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:11,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:11,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1254679817, now seen corresponding path program 1 times [2025-03-15 01:25:11,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:11,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600764678] [2025-03-15 01:25:11,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:11,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:11,994 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:11,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:11,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600764678] [2025-03-15 01:25:11,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600764678] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:25:11,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594674064] [2025-03-15 01:25:11,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:11,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:11,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:25:11,996 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:11,998 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:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:12,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 01:25:12,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:25:12,601 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:12,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:25:13,060 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:13,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594674064] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:25:13,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:25:13,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-15 01:25:13,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911052690] [2025-03-15 01:25:13,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:25:13,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-15 01:25:13,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:13,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-15 01:25:13,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-15 01:25:13,067 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 539 out of 574 [2025-03-15 01:25:13,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 597 places, 809 transitions, 6528 flow. Second operand has 12 states, 12 states have (on average 543.1666666666666) internal successors, (6518), 12 states have internal predecessors, (6518), 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,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:13,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 539 of 574 [2025-03-15 01:25:13,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:14,162 INFO L124 PetriNetUnfolderBase]: 960/5431 cut-off events. [2025-03-15 01:25:14,163 INFO L125 PetriNetUnfolderBase]: For 98068/103047 co-relation queries the response was YES. [2025-03-15 01:25:14,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22613 conditions, 5431 events. 960/5431 cut-off events. For 98068/103047 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 39303 event pairs, 205 based on Foata normal form. 149/4902 useless extension candidates. Maximal degree in co-relation 19484. Up to 1569 conditions per place. [2025-03-15 01:25:14,199 INFO L140 encePairwiseOnDemand]: 563/574 looper letters, 396 selfloop transitions, 48 changer transitions 47/1031 dead transitions. [2025-03-15 01:25:14,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 1031 transitions, 11663 flow [2025-03-15 01:25:14,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-15 01:25:14,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-15 01:25:14,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 10913 transitions. [2025-03-15 01:25:14,210 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9506097560975609 [2025-03-15 01:25:14,211 INFO L298 CegarLoopForPetriNet]: 571 programPoint places, 45 predicate places. [2025-03-15 01:25:14,211 INFO L471 AbstractCegarLoop]: Abstraction has has 616 places, 1031 transitions, 11663 flow [2025-03-15 01:25:14,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 543.1666666666666) internal successors, (6518), 12 states have internal predecessors, (6518), 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,213 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:14,213 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,220 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:14,414 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:14,414 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:14,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:14,416 INFO L85 PathProgramCache]: Analyzing trace with hash 2004257825, now seen corresponding path program 1 times [2025-03-15 01:25:14,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:14,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658034176] [2025-03-15 01:25:14,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:14,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:14,617 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:14,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:14,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658034176] [2025-03-15 01:25:14,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658034176] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:25:14,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116937658] [2025-03-15 01:25:14,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:14,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:14,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:25:14,619 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:14,620 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:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:14,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 01:25:14,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:25:14,868 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:14,868 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:25:14,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116937658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:14,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:25:14,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-15 01:25:14,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347000981] [2025-03-15 01:25:14,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:14,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:25:14,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:14,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:25:14,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-15 01:25:14,873 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 574 [2025-03-15 01:25:14,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 616 places, 1031 transitions, 11663 flow. Second operand has 6 states, 6 states have (on average 550.6666666666666) internal successors, (3304), 6 states have internal predecessors, (3304), 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,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:14,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 574 [2025-03-15 01:25:14,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:15,908 INFO L124 PetriNetUnfolderBase]: 917/5410 cut-off events. [2025-03-15 01:25:15,908 INFO L125 PetriNetUnfolderBase]: For 108231/115434 co-relation queries the response was YES. [2025-03-15 01:25:15,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23456 conditions, 5410 events. 917/5410 cut-off events. For 108231/115434 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 38921 event pairs, 130 based on Foata normal form. 236/5035 useless extension candidates. Maximal degree in co-relation 20426. Up to 1533 conditions per place. [2025-03-15 01:25:15,936 INFO L140 encePairwiseOnDemand]: 569/574 looper letters, 323 selfloop transitions, 6 changer transitions 47/1050 dead transitions. [2025-03-15 01:25:15,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 621 places, 1050 transitions, 12895 flow [2025-03-15 01:25:15,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:25:15,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:25:15,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3878 transitions. [2025-03-15 01:25:15,941 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9651567944250871 [2025-03-15 01:25:15,943 INFO L298 CegarLoopForPetriNet]: 571 programPoint places, 50 predicate places. [2025-03-15 01:25:15,943 INFO L471 AbstractCegarLoop]: Abstraction has has 621 places, 1050 transitions, 12895 flow [2025-03-15 01:25:15,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 550.6666666666666) internal successors, (3304), 6 states have internal predecessors, (3304), 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:15,947 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:15,947 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] [2025-03-15 01:25:15,956 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:16,148 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:16,148 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:16,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:16,150 INFO L85 PathProgramCache]: Analyzing trace with hash 2002451738, now seen corresponding path program 1 times [2025-03-15 01:25:16,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:16,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235281419] [2025-03-15 01:25:16,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:16,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:16,309 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 01:25:16,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:16,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235281419] [2025-03-15 01:25:16,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235281419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:16,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:16,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:25:16,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653916864] [2025-03-15 01:25:16,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:16,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:25:16,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:16,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:25:16,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:25:16,313 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 574 [2025-03-15 01:25:16,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 1050 transitions, 12895 flow. Second operand has 4 states, 4 states have (on average 552.25) internal successors, (2209), 4 states have internal predecessors, (2209), 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:16,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:16,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 574 [2025-03-15 01:25:16,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:17,246 INFO L124 PetriNetUnfolderBase]: 896/5092 cut-off events. [2025-03-15 01:25:17,246 INFO L125 PetriNetUnfolderBase]: For 111154/119314 co-relation queries the response was YES. [2025-03-15 01:25:17,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23763 conditions, 5092 events. 896/5092 cut-off events. For 111154/119314 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 35921 event pairs, 75 based on Foata normal form. 432/4989 useless extension candidates. Maximal degree in co-relation 20643. Up to 1472 conditions per place. [2025-03-15 01:25:17,278 INFO L140 encePairwiseOnDemand]: 568/574 looper letters, 366 selfloop transitions, 8 changer transitions 47/1095 dead transitions. [2025-03-15 01:25:17,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 1095 transitions, 14946 flow [2025-03-15 01:25:17,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:25:17,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:25:17,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2768 transitions. [2025-03-15 01:25:17,281 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9644599303135889 [2025-03-15 01:25:17,281 INFO L298 CegarLoopForPetriNet]: 571 programPoint places, 53 predicate places. [2025-03-15 01:25:17,281 INFO L471 AbstractCegarLoop]: Abstraction has has 624 places, 1095 transitions, 14946 flow [2025-03-15 01:25:17,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 552.25) internal successors, (2209), 4 states have internal predecessors, (2209), 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,282 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:17,282 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 01:25:17,282 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:25:17,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:17,283 INFO L85 PathProgramCache]: Analyzing trace with hash -825917800, now seen corresponding path program 1 times [2025-03-15 01:25:17,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:17,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434479499] [2025-03-15 01:25:17,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:17,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:17,548 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:17,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:17,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434479499] [2025-03-15 01:25:17,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434479499] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:25:17,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545144466] [2025-03-15 01:25:17,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:17,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:17,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:25:17,551 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:17,552 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:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:17,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 1085 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-15 01:25:17,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:25:18,203 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:18,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:25:18,622 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:18,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545144466] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:25:18,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:25:18,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-15 01:25:18,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819435098] [2025-03-15 01:25:18,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:25:18,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-15 01:25:18,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:18,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-15 01:25:18,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-03-15 01:25:18,627 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 532 out of 574 [2025-03-15 01:25:18,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 624 places, 1095 transitions, 14946 flow. Second operand has 16 states, 16 states have (on average 536.6875) internal successors, (8587), 16 states have internal predecessors, (8587), 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:18,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:18,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 532 of 574 [2025-03-15 01:25:18,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:20,152 INFO L124 PetriNetUnfolderBase]: 1042/5725 cut-off events. [2025-03-15 01:25:20,152 INFO L125 PetriNetUnfolderBase]: For 134915/142094 co-relation queries the response was YES. [2025-03-15 01:25:20,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29268 conditions, 5725 events. 1042/5725 cut-off events. For 134915/142094 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 42874 event pairs, 105 based on Foata normal form. 146/5321 useless extension candidates. Maximal degree in co-relation 25936. Up to 1662 conditions per place. [2025-03-15 01:25:20,197 INFO L140 encePairwiseOnDemand]: 561/574 looper letters, 452 selfloop transitions, 71 changer transitions 154/1204 dead transitions. [2025-03-15 01:25:20,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 646 places, 1204 transitions, 18718 flow [2025-03-15 01:25:20,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-15 01:25:20,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-15 01:25:20,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 12920 transitions. [2025-03-15 01:25:20,209 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.937862950058072 [2025-03-15 01:25:20,210 INFO L298 CegarLoopForPetriNet]: 571 programPoint places, 75 predicate places. [2025-03-15 01:25:20,210 INFO L471 AbstractCegarLoop]: Abstraction has has 646 places, 1204 transitions, 18718 flow [2025-03-15 01:25:20,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 536.6875) internal successors, (8587), 16 states have internal predecessors, (8587), 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:20,211 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:20,212 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-15 01:25:20,412 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:20,412 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:25:20,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:20,414 INFO L85 PathProgramCache]: Analyzing trace with hash 718265791, now seen corresponding path program 1 times [2025-03-15 01:25:20,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:20,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083408965] [2025-03-15 01:25:20,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:20,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:20,565 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:20,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:20,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083408965] [2025-03-15 01:25:20,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083408965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:20,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:20,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:25:20,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706606004] [2025-03-15 01:25:20,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:20,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:25:20,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:20,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:25:20,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:25:20,567 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 532 out of 574 [2025-03-15 01:25:20,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 646 places, 1204 transitions, 18718 flow. Second operand has 6 states, 6 states have (on average 537.3333333333334) internal successors, (3224), 6 states have internal predecessors, (3224), 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:20,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:20,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 532 of 574 [2025-03-15 01:25:20,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:21,917 INFO L124 PetriNetUnfolderBase]: 1052/6190 cut-off events. [2025-03-15 01:25:21,917 INFO L125 PetriNetUnfolderBase]: For 153050/159392 co-relation queries the response was YES. [2025-03-15 01:25:21,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32725 conditions, 6190 events. 1052/6190 cut-off events. For 153050/159392 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 48200 event pairs, 110 based on Foata normal form. 151/5781 useless extension candidates. Maximal degree in co-relation 29191. Up to 1740 conditions per place. [2025-03-15 01:25:21,963 INFO L140 encePairwiseOnDemand]: 563/574 looper letters, 477 selfloop transitions, 55 changer transitions 163/1222 dead transitions. [2025-03-15 01:25:21,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 647 places, 1222 transitions, 20711 flow [2025-03-15 01:25:21,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 01:25:21,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 01:25:21,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 4309 transitions. [2025-03-15 01:25:21,966 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9383710801393729 [2025-03-15 01:25:21,966 INFO L298 CegarLoopForPetriNet]: 571 programPoint places, 76 predicate places. [2025-03-15 01:25:21,966 INFO L471 AbstractCegarLoop]: Abstraction has has 647 places, 1222 transitions, 20711 flow [2025-03-15 01:25:21,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 537.3333333333334) internal successors, (3224), 6 states have internal predecessors, (3224), 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:21,967 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:21,967 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 01:25:21,968 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:21,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:21,969 INFO L85 PathProgramCache]: Analyzing trace with hash -913689061, now seen corresponding path program 1 times [2025-03-15 01:25:21,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:21,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059391352] [2025-03-15 01:25:21,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:21,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:22,334 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:22,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:22,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059391352] [2025-03-15 01:25:22,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059391352] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:25:22,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935175392] [2025-03-15 01:25:22,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:22,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:22,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:25:22,336 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:22,338 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:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:22,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 1260 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-15 01:25:22,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:25:22,981 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:22,982 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:25:23,444 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:23,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935175392] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:25:23,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:25:23,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-15 01:25:23,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446943841] [2025-03-15 01:25:23,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:25:23,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-15 01:25:23,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:23,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-15 01:25:23,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-15 01:25:23,450 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 532 out of 574 [2025-03-15 01:25:23,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 647 places, 1222 transitions, 20711 flow. Second operand has 20 states, 20 states have (on average 537.45) internal successors, (10749), 20 states have internal predecessors, (10749), 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:23,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:23,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 532 of 574 [2025-03-15 01:25:23,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:26,191 INFO L124 PetriNetUnfolderBase]: 1634/9872 cut-off events. [2025-03-15 01:25:26,191 INFO L125 PetriNetUnfolderBase]: For 265470/276783 co-relation queries the response was YES. [2025-03-15 01:25:26,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54722 conditions, 9872 events. 1634/9872 cut-off events. For 265470/276783 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 85752 event pairs, 213 based on Foata normal form. 200/9161 useless extension candidates. Maximal degree in co-relation 49004. Up to 2851 conditions per place. [2025-03-15 01:25:26,254 INFO L140 encePairwiseOnDemand]: 563/574 looper letters, 714 selfloop transitions, 97 changer transitions 251/1589 dead transitions. [2025-03-15 01:25:26,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 679 places, 1589 transitions, 33055 flow [2025-03-15 01:25:26,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-15 01:25:26,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-15 01:25:26,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 17777 transitions. [2025-03-15 01:25:26,262 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9384964628867067 [2025-03-15 01:25:26,263 INFO L298 CegarLoopForPetriNet]: 571 programPoint places, 108 predicate places. [2025-03-15 01:25:26,263 INFO L471 AbstractCegarLoop]: Abstraction has has 679 places, 1589 transitions, 33055 flow [2025-03-15 01:25:26,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 537.45) internal successors, (10749), 20 states have internal predecessors, (10749), 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:26,265 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:26,265 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, 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:26,274 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:26,465 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,SelfDestructingSolverStorable15 [2025-03-15 01:25:26,466 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:25:26,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:26,468 INFO L85 PathProgramCache]: Analyzing trace with hash 929451982, now seen corresponding path program 1 times [2025-03-15 01:25:26,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:26,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913389385] [2025-03-15 01:25:26,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:26,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:27,038 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 01:25:27,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:27,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913389385] [2025-03-15 01:25:27,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913389385] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:25:27,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190101373] [2025-03-15 01:25:27,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:27,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:27,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:25:27,040 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:27,041 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:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:27,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 1408 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-15 01:25:27,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:25:27,743 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 01:25:27,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:25:28,260 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 01:25:28,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190101373] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:25:28,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:25:28,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 19 [2025-03-15 01:25:28,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291535025] [2025-03-15 01:25:28,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:25:28,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-15 01:25:28,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:28,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-15 01:25:28,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2025-03-15 01:25:28,265 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 532 out of 574 [2025-03-15 01:25:28,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 679 places, 1589 transitions, 33055 flow. Second operand has 20 states, 20 states have (on average 538.15) internal successors, (10763), 20 states have internal predecessors, (10763), 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:28,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:28,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 532 of 574 [2025-03-15 01:25:28,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:33,566 INFO L124 PetriNetUnfolderBase]: 2462/15667 cut-off events. [2025-03-15 01:25:33,567 INFO L125 PetriNetUnfolderBase]: For 442785/459018 co-relation queries the response was YES. [2025-03-15 01:25:33,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90029 conditions, 15667 events. 2462/15667 cut-off events. For 442785/459018 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 149821 event pairs, 350 based on Foata normal form. 261/14480 useless extension candidates. Maximal degree in co-relation 83632. Up to 4557 conditions per place. [2025-03-15 01:25:33,692 INFO L140 encePairwiseOnDemand]: 562/574 looper letters, 1161 selfloop transitions, 172 changer transitions 413/2273 dead transitions. [2025-03-15 01:25:33,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 709 places, 2273 transitions, 55921 flow [2025-03-15 01:25:33,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-15 01:25:33,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-15 01:25:33,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 16709 transitions. [2025-03-15 01:25:33,703 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9390243902439024 [2025-03-15 01:25:33,704 INFO L298 CegarLoopForPetriNet]: 571 programPoint places, 138 predicate places. [2025-03-15 01:25:33,704 INFO L471 AbstractCegarLoop]: Abstraction has has 709 places, 2273 transitions, 55921 flow [2025-03-15 01:25:33,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 538.15) internal successors, (10763), 20 states have internal predecessors, (10763), 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:33,710 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:33,710 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-15 01:25:33,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:33,911 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:33,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:33,912 INFO L85 PathProgramCache]: Analyzing trace with hash -855951628, now seen corresponding path program 2 times [2025-03-15 01:25:33,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:33,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390958568] [2025-03-15 01:25:33,913 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:25:33,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:33,980 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:25:33,980 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:25:34,674 INFO L134 CoverageAnalysis]: Checked inductivity of 843 backedges. 0 proven. 843 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:34,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:34,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390958568] [2025-03-15 01:25:34,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390958568] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:25:34,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448142831] [2025-03-15 01:25:34,675 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:25:34,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:34,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:25:34,677 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,678 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,854 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:25:34,854 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:25:34,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 1423 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-15 01:25:34,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:25:35,315 INFO L134 CoverageAnalysis]: Checked inductivity of 843 backedges. 0 proven. 843 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:35,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:25:36,025 INFO L134 CoverageAnalysis]: Checked inductivity of 843 backedges. 0 proven. 843 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:36,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448142831] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:25:36,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:25:36,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 31 [2025-03-15 01:25:36,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373867329] [2025-03-15 01:25:36,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:25:36,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-15 01:25:36,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:36,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-15 01:25:36,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2025-03-15 01:25:36,032 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 539 out of 574 [2025-03-15 01:25:36,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 709 places, 2273 transitions, 55921 flow. Second operand has 32 states, 32 states have (on average 544.0) internal successors, (17408), 32 states have internal predecessors, (17408), 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:36,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:36,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 539 of 574 [2025-03-15 01:25:36,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:40,567 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1260] L996-10-->L998-2: Formula: (and (= (store |v_#pthreadsMutex_24| |v_~#m~0.base_18| (store (select |v_#pthreadsMutex_24| |v_~#m~0.base_18|) |v_~#m~0.offset_18| 0)) |v_#pthreadsMutex_23|) (= |v_t1Thread1of1ForFork1_#t~ret41#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#m~0.base=|v_~#m~0.base_18|, ~#m~0.offset=|v_~#m~0.offset_18|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_23|, t1Thread1of1ForFork1_#t~ret41#1=|v_t1Thread1of1ForFork1_#t~ret41#1_1|, ~#m~0.base=|v_~#m~0.base_18|, ~#m~0.offset=|v_~#m~0.offset_18|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_#t~ret41#1][1525], [1998#(<= 1 ~top~0), 1973#true, 17923#(< ~top~0 2147483645), 8121#(<= |t1Thread1of1ForFork1_~i~0#1| 399), 16#L1022-4true, 13831#(< ~top~0 2147483645), 9971#(< ~top~0 2147483647), 6561#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 22633#(< ~top~0 2147483641), 1982#true, 1967#true, 1954#true, 1978#(<= 1 ~top~0), 208#L998-2true, 1925#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 1961#true, 574#true, 335#L1005-7true, t2Thread1of1ForFork0InUse, t1Thread1of1ForFork1InUse, 11386#(<= 1 ~top~0), 5172#(< ~top~0 2147483646), 580#true]) [2025-03-15 01:25:40,568 INFO L294 olderBase$Statistics]: this new event has 729 ancestors and is cut-off event [2025-03-15 01:25:40,568 INFO L297 olderBase$Statistics]: existing Event has 684 ancestors and is cut-off event [2025-03-15 01:25:40,568 INFO L297 olderBase$Statistics]: existing Event has 684 ancestors and is cut-off event [2025-03-15 01:25:40,568 INFO L297 olderBase$Statistics]: existing Event has 684 ancestors and is cut-off event [2025-03-15 01:25:40,568 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1260] L996-10-->L998-2: Formula: (and (= (store |v_#pthreadsMutex_24| |v_~#m~0.base_18| (store (select |v_#pthreadsMutex_24| |v_~#m~0.base_18|) |v_~#m~0.offset_18| 0)) |v_#pthreadsMutex_23|) (= |v_t1Thread1of1ForFork1_#t~ret41#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#m~0.base=|v_~#m~0.base_18|, ~#m~0.offset=|v_~#m~0.offset_18|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_23|, t1Thread1of1ForFork1_#t~ret41#1=|v_t1Thread1of1ForFork1_#t~ret41#1_1|, ~#m~0.base=|v_~#m~0.base_18|, ~#m~0.offset=|v_~#m~0.offset_18|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_#t~ret41#1][1525], [1973#true, 1998#(<= 1 ~top~0), 8121#(<= |t1Thread1of1ForFork1_~i~0#1| 399), 17923#(< ~top~0 2147483645), 16#L1022-4true, 13831#(< ~top~0 2147483645), 9971#(< ~top~0 2147483647), 1982#true, 22633#(< ~top~0 2147483641), 6561#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 1967#true, 1954#true, 1925#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 208#L998-2true, 1978#(<= 1 ~top~0), 1961#true, 574#true, t2Thread1of1ForFork0InUse, t1Thread1of1ForFork1InUse, 184#L1015true, 11386#(<= 1 ~top~0), 580#true, 5172#(< ~top~0 2147483646)]) [2025-03-15 01:25:40,568 INFO L294 olderBase$Statistics]: this new event has 730 ancestors and is cut-off event [2025-03-15 01:25:40,568 INFO L297 olderBase$Statistics]: existing Event has 685 ancestors and is cut-off event [2025-03-15 01:25:40,568 INFO L297 olderBase$Statistics]: existing Event has 685 ancestors and is cut-off event [2025-03-15 01:25:40,568 INFO L297 olderBase$Statistics]: existing Event has 685 ancestors and is cut-off event [2025-03-15 01:25:47,541 INFO L124 PetriNetUnfolderBase]: 3703/23762 cut-off events. [2025-03-15 01:25:47,541 INFO L125 PetriNetUnfolderBase]: For 727119/751168 co-relation queries the response was YES. [2025-03-15 01:25:47,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143467 conditions, 23762 events. 3703/23762 cut-off events. For 727119/751168 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 215075 event pairs, 556 based on Foata normal form. 265/21825 useless extension candidates. Maximal degree in co-relation 131092. Up to 7152 conditions per place. [2025-03-15 01:25:47,748 INFO L140 encePairwiseOnDemand]: 565/574 looper letters, 1647 selfloop transitions, 185 changer transitions 596/3048 dead transitions. [2025-03-15 01:25:47,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 755 places, 3048 transitions, 86182 flow [2025-03-15 01:25:47,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-15 01:25:47,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2025-03-15 01:25:47,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 25678 transitions. [2025-03-15 01:25:47,765 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9518125880346949 [2025-03-15 01:25:47,765 INFO L298 CegarLoopForPetriNet]: 571 programPoint places, 184 predicate places. [2025-03-15 01:25:47,765 INFO L471 AbstractCegarLoop]: Abstraction has has 755 places, 3048 transitions, 86182 flow [2025-03-15 01:25:47,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 544.0) internal successors, (17408), 32 states have internal predecessors, (17408), 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:47,767 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:47,768 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,775 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:47,968 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,SelfDestructingSolverStorable17 [2025-03-15 01:25:47,968 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:25:47,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:47,970 INFO L85 PathProgramCache]: Analyzing trace with hash -811909471, now seen corresponding path program 2 times [2025-03-15 01:25:47,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:47,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060111599] [2025-03-15 01:25:47,970 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:25:47,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:48,120 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:25:48,120 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:25:48,808 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 0 proven. 678 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:48,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:48,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060111599] [2025-03-15 01:25:48,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060111599] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:25:48,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568995590] [2025-03-15 01:25:48,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:25:48,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:48,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:25:48,810 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:48,811 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,083 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:25:49,083 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:25:49,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 1588 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-15 01:25:49,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:25:49,603 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 0 proven. 678 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:49,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:25:50,253 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 0 proven. 678 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:50,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568995590] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:25:50,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:25:50,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 33 [2025-03-15 01:25:50,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762247912] [2025-03-15 01:25:50,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:25:50,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-15 01:25:50,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:50,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-15 01:25:50,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=846, Unknown=0, NotChecked=0, Total=1122 [2025-03-15 01:25:50,261 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 532 out of 574 [2025-03-15 01:25:50,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 755 places, 3048 transitions, 86182 flow. Second operand has 34 states, 34 states have (on average 537.5) internal successors, (18275), 34 states have internal predecessors, (18275), 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,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:50,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 532 of 574 [2025-03-15 01:25:50,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:11,295 INFO L124 PetriNetUnfolderBase]: 5284/35188 cut-off events. [2025-03-15 01:26:11,295 INFO L125 PetriNetUnfolderBase]: For 1119089/1158481 co-relation queries the response was YES. [2025-03-15 01:26:11,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219977 conditions, 35188 events. 5284/35188 cut-off events. For 1119089/1158481 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 365764 event pairs, 814 based on Foata normal form. 413/32355 useless extension candidates. Maximal degree in co-relation 206363. Up to 10755 conditions per place. [2025-03-15 01:26:11,659 INFO L140 encePairwiseOnDemand]: 563/574 looper letters, 2443 selfloop transitions, 377 changer transitions 881/4228 dead transitions. [2025-03-15 01:26:11,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 814 places, 4228 transitions, 131245 flow [2025-03-15 01:26:11,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-03-15 01:26:11,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2025-03-15 01:26:11,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 32331 transitions. [2025-03-15 01:26:11,672 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9387630662020906 [2025-03-15 01:26:11,673 INFO L298 CegarLoopForPetriNet]: 571 programPoint places, 243 predicate places. [2025-03-15 01:26:11,673 INFO L471 AbstractCegarLoop]: Abstraction has has 814 places, 4228 transitions, 131245 flow [2025-03-15 01:26:11,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 537.5) internal successors, (18275), 34 states have internal predecessors, (18275), 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:11,675 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:11,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, 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:26:11,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-15 01:26:11,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:26:11,876 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:26:11,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:11,878 INFO L85 PathProgramCache]: Analyzing trace with hash -913876833, now seen corresponding path program 2 times [2025-03-15 01:26:11,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:11,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159821112] [2025-03-15 01:26:11,878 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:26:11,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:12,004 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:26:12,004 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:26:12,890 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 353 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 01:26:12,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:12,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159821112] [2025-03-15 01:26:12,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159821112] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:26:12,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51827546] [2025-03-15 01:26:12,890 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:26:12,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:26:12,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:26:12,892 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:12,893 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:13,116 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:26:13,116 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:26:13,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 1654 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-15 01:26:13,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:26:13,677 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 353 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 01:26:13,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:26:14,398 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 353 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 01:26:14,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51827546] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:26:14,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:26:14,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 31 [2025-03-15 01:26:14,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770089380] [2025-03-15 01:26:14,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:26:14,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-15 01:26:14,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:14,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-15 01:26:14,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=769, Unknown=0, NotChecked=0, Total=992 [2025-03-15 01:26:14,405 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 532 out of 574 [2025-03-15 01:26:14,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 814 places, 4228 transitions, 131245 flow. Second operand has 32 states, 32 states have (on average 537.90625) internal successors, (17213), 32 states have internal predecessors, (17213), 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:14,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:14,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 532 of 574 [2025-03-15 01:26:14,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:16,631 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1293] L1008-1-->L1013-2: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret45#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret45#1=|v_t2Thread1of1ForFork0_#t~ret45#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret45#1][671], [8155#(<= ~top~0 0), 1976#true, 19639#(<= ~top~0 0), 1967#true, 11388#(<= 0 ~top~0), 1925#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 574#true, 1994#true, 15262#(<= ~top~0 0), 8119#true, 1986#(<= ~top~0 1), 1956#(<= |t2Thread1of1ForFork0_~i~1#1| 399), 1973#true, 3538#(<= ~top~0 0), 16#L1022-4true, 11431#(<= ~top~0 0), 6561#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 171#L1013-2true, 1961#true, 29081#(<= ~top~0 0), 294#L1000true, t2Thread1of1ForFork0InUse, t1Thread1of1ForFork1InUse, 24092#(<= ~top~0 0), 580#true]) [2025-03-15 01:26:16,631 INFO L294 olderBase$Statistics]: this new event has 609 ancestors and is cut-off event [2025-03-15 01:26:16,631 INFO L297 olderBase$Statistics]: existing Event has 572 ancestors and is cut-off event [2025-03-15 01:26:16,631 INFO L297 olderBase$Statistics]: existing Event has 538 ancestors and is cut-off event [2025-03-15 01:26:16,631 INFO L297 olderBase$Statistics]: existing Event has 527 ancestors and is cut-off event [2025-03-15 01:26:16,631 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1293] L1008-1-->L1013-2: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret45#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret45#1=|v_t2Thread1of1ForFork0_#t~ret45#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret45#1][671], [8155#(<= ~top~0 0), 1976#true, 19639#(<= ~top~0 0), 1967#true, 11388#(<= 0 ~top~0), 1925#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 574#true, 1994#true, 15262#(<= ~top~0 0), 8119#true, 374#L991-7true, 1986#(<= ~top~0 1), 1956#(<= |t2Thread1of1ForFork0_~i~1#1| 399), 1973#true, 3538#(<= ~top~0 0), 16#L1022-4true, 11431#(<= ~top~0 0), 6561#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 171#L1013-2true, 1961#true, 29081#(<= ~top~0 0), t2Thread1of1ForFork0InUse, t1Thread1of1ForFork1InUse, 24092#(<= ~top~0 0), 580#true]) [2025-03-15 01:26:16,631 INFO L294 olderBase$Statistics]: this new event has 608 ancestors and is cut-off event [2025-03-15 01:26:16,631 INFO L297 olderBase$Statistics]: existing Event has 526 ancestors and is cut-off event [2025-03-15 01:26:16,631 INFO L297 olderBase$Statistics]: existing Event has 537 ancestors and is cut-off event [2025-03-15 01:26:16,631 INFO L297 olderBase$Statistics]: existing Event has 571 ancestors and is cut-off event [2025-03-15 01:26:16,658 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1346] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][678], [130#L1008-1true, 8155#(<= ~top~0 0), 19639#(<= ~top~0 0), 1976#true, 3538#(<= ~top~0 0), 145#L1023-1true, 11431#(<= ~top~0 0), 6561#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 1967#true, 11388#(<= 0 ~top~0), 1925#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 1961#true, 574#true, 1994#true, 29081#(<= ~top~0 0), 1975#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), t2Thread1of1ForFork0InUse, 8119#true, t1Thread1of1ForFork1NotInUse, 15262#(<= ~top~0 0), 1986#(<= ~top~0 1), 24092#(<= ~top~0 0), 1956#(<= |t2Thread1of1ForFork0_~i~1#1| 399), 580#true]) [2025-03-15 01:26:16,658 INFO L294 olderBase$Statistics]: this new event has 613 ancestors and is cut-off event [2025-03-15 01:26:16,658 INFO L297 olderBase$Statistics]: existing Event has 531 ancestors and is cut-off event [2025-03-15 01:26:16,658 INFO L297 olderBase$Statistics]: existing Event has 542 ancestors and is cut-off event [2025-03-15 01:26:16,658 INFO L297 olderBase$Statistics]: existing Event has 576 ancestors and is cut-off event [2025-03-15 01:26:55,873 INFO L124 PetriNetUnfolderBase]: 7959/54895 cut-off events. [2025-03-15 01:26:55,873 INFO L125 PetriNetUnfolderBase]: For 1843743/1904251 co-relation queries the response was YES. [2025-03-15 01:26:56,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 356636 conditions, 54895 events. 7959/54895 cut-off events. For 1843743/1904251 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 634248 event pairs, 1312 based on Foata normal form. 527/50362 useless extension candidates. Maximal degree in co-relation 339160. Up to 16985 conditions per place. [2025-03-15 01:26:56,500 INFO L140 encePairwiseOnDemand]: 563/574 looper letters, 3793 selfloop transitions, 654 changer transitions 1367/6341 dead transitions. [2025-03-15 01:26:56,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 866 places, 6341 transitions, 213913 flow [2025-03-15 01:26:56,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-15 01:26:56,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2025-03-15 01:26:56,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 28568 transitions. [2025-03-15 01:26:56,514 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9390572611925581 [2025-03-15 01:26:56,515 INFO L298 CegarLoopForPetriNet]: 571 programPoint places, 295 predicate places. [2025-03-15 01:26:56,515 INFO L471 AbstractCegarLoop]: Abstraction has has 866 places, 6341 transitions, 213913 flow [2025-03-15 01:26:56,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 537.90625) internal successors, (17213), 32 states have internal predecessors, (17213), 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:56,517 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:56,518 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, 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:26:56,529 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:26:56,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:26:56,718 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:26:56,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:56,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1278945434, now seen corresponding path program 3 times [2025-03-15 01:26:56,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:56,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081165296] [2025-03-15 01:26:56,720 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 01:26:56,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:57,054 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-15 01:26:57,055 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:27:00,447 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 0 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:27:00,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:27:00,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081165296] [2025-03-15 01:27:00,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081165296] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:27:00,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813400491] [2025-03-15 01:27:00,448 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 01:27:00,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:27:00,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:27:00,450 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:00,456 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:01,354 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-15 01:27:01,355 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:27:01,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 1736 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-15 01:27:01,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:27:01,926 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 0 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:27:01,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:27:02,650 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 0 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:27:02,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813400491] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:27:02,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:27:02,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 17, 17] total 45 [2025-03-15 01:27:02,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105780296] [2025-03-15 01:27:02,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:27:02,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-15 01:27:02,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:27:02,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-15 01:27:02,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=427, Invalid=1643, Unknown=0, NotChecked=0, Total=2070 [2025-03-15 01:27:02,660 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 525 out of 574 [2025-03-15 01:27:02,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 866 places, 6341 transitions, 213913 flow. Second operand has 46 states, 46 states have (on average 532.2391304347826) internal successors, (24483), 46 states have internal predecessors, (24483), 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,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:27:02,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 525 of 574 [2025-03-15 01:27:02,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:27:38,265 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1260] L996-10-->L998-2: Formula: (and (= (store |v_#pthreadsMutex_24| |v_~#m~0.base_18| (store (select |v_#pthreadsMutex_24| |v_~#m~0.base_18|) |v_~#m~0.offset_18| 0)) |v_#pthreadsMutex_23|) (= |v_t1Thread1of1ForFork1_#t~ret41#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#m~0.base=|v_~#m~0.base_18|, ~#m~0.offset=|v_~#m~0.offset_18|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_23|, t1Thread1of1ForFork1_#t~ret41#1=|v_t1Thread1of1ForFork1_#t~ret41#1_1|, ~#m~0.base=|v_~#m~0.base_18|, ~#m~0.offset=|v_~#m~0.offset_18|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_#t~ret41#1][2949], [1998#(<= 1 ~top~0), 32789#(< ~top~0 2147483642), 17923#(< ~top~0 2147483645), 8121#(<= |t1Thread1of1ForFork1_~i~0#1| 399), 13831#(< ~top~0 2147483645), 9971#(< ~top~0 2147483647), 22633#(< ~top~0 2147483641), 1982#true, 1967#true, 1978#(<= 1 ~top~0), 208#L998-2true, 1925#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 574#true, 19#L1007true, 5172#(< ~top~0 2147483646), 1956#(<= |t2Thread1of1ForFork0_~i~1#1| 399), 27579#(< ~top~0 2147483641), 1973#true, 16#L1022-4true, 6561#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 1961#true, 38035#(< ~top~0 2147483641), t2Thread1of1ForFork0InUse, t1Thread1of1ForFork1InUse, 11386#(<= 1 ~top~0), 580#true]) [2025-03-15 01:27:38,266 INFO L294 olderBase$Statistics]: this new event has 820 ancestors and is cut-off event [2025-03-15 01:27:38,266 INFO L297 olderBase$Statistics]: existing Event has 767 ancestors and is cut-off event [2025-03-15 01:27:38,266 INFO L297 olderBase$Statistics]: existing Event has 801 ancestors and is cut-off event [2025-03-15 01:27:38,266 INFO L297 olderBase$Statistics]: existing Event has 794 ancestors and is cut-off event [2025-03-15 01:27:38,266 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1260] L996-10-->L998-2: Formula: (and (= (store |v_#pthreadsMutex_24| |v_~#m~0.base_18| (store (select |v_#pthreadsMutex_24| |v_~#m~0.base_18|) |v_~#m~0.offset_18| 0)) |v_#pthreadsMutex_23|) (= |v_t1Thread1of1ForFork1_#t~ret41#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#m~0.base=|v_~#m~0.base_18|, ~#m~0.offset=|v_~#m~0.offset_18|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_23|, t1Thread1of1ForFork1_#t~ret41#1=|v_t1Thread1of1ForFork1_#t~ret41#1_1|, ~#m~0.base=|v_~#m~0.base_18|, ~#m~0.offset=|v_~#m~0.offset_18|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_#t~ret41#1][3030], [1998#(<= 1 ~top~0), 32789#(< ~top~0 2147483642), 8121#(<= |t1Thread1of1ForFork1_~i~0#1| 399), 17923#(< ~top~0 2147483645), 13831#(< ~top~0 2147483645), 9971#(< ~top~0 2147483647), 1982#true, 22633#(< ~top~0 2147483641), 1967#true, 1954#true, 1978#(<= 1 ~top~0), 1925#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 208#L998-2true, 574#true, 5172#(< ~top~0 2147483646), 27579#(< ~top~0 2147483641), 1973#true, 16#L1022-4true, 6561#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 1961#true, 38035#(< ~top~0 2147483641), t2Thread1of1ForFork0InUse, t1Thread1of1ForFork1InUse, 184#L1015true, 11386#(<= 1 ~top~0), 580#true]) [2025-03-15 01:27:38,266 INFO L294 olderBase$Statistics]: this new event has 820 ancestors and is cut-off event [2025-03-15 01:27:38,266 INFO L297 olderBase$Statistics]: existing Event has 794 ancestors and is cut-off event [2025-03-15 01:27:38,266 INFO L297 olderBase$Statistics]: existing Event has 767 ancestors and is cut-off event [2025-03-15 01:27:38,266 INFO L297 olderBase$Statistics]: existing Event has 812 ancestors and is cut-off event [2025-03-15 01:27:38,266 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1260] L996-10-->L998-2: Formula: (and (= (store |v_#pthreadsMutex_24| |v_~#m~0.base_18| (store (select |v_#pthreadsMutex_24| |v_~#m~0.base_18|) |v_~#m~0.offset_18| 0)) |v_#pthreadsMutex_23|) (= |v_t1Thread1of1ForFork1_#t~ret41#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#m~0.base=|v_~#m~0.base_18|, ~#m~0.offset=|v_~#m~0.offset_18|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_23|, t1Thread1of1ForFork1_#t~ret41#1=|v_t1Thread1of1ForFork1_#t~ret41#1_1|, ~#m~0.base=|v_~#m~0.base_18|, ~#m~0.offset=|v_~#m~0.offset_18|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_#t~ret41#1][3030], [1998#(<= 1 ~top~0), 32789#(< ~top~0 2147483642), 17923#(< ~top~0 2147483645), 8121#(<= |t1Thread1of1ForFork1_~i~0#1| 399), 13831#(< ~top~0 2147483645), 9971#(< ~top~0 2147483647), 1982#true, 22633#(< ~top~0 2147483641), 1967#true, 1954#true, 1978#(<= 1 ~top~0), 208#L998-2true, 1925#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 574#true, 5172#(< ~top~0 2147483646), 27579#(< ~top~0 2147483641), 1973#true, 16#L1022-4true, 6561#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 1961#true, 38035#(< ~top~0 2147483641), 335#L1005-7true, t2Thread1of1ForFork0InUse, t1Thread1of1ForFork1InUse, 11386#(<= 1 ~top~0), 580#true]) [2025-03-15 01:27:38,266 INFO L294 olderBase$Statistics]: this new event has 819 ancestors and is cut-off event [2025-03-15 01:27:38,266 INFO L297 olderBase$Statistics]: existing Event has 793 ancestors and is cut-off event [2025-03-15 01:27:38,266 INFO L297 olderBase$Statistics]: existing Event has 766 ancestors and is cut-off event [2025-03-15 01:27:38,266 INFO L297 olderBase$Statistics]: existing Event has 811 ancestors and is cut-off event [2025-03-15 01:27:47,907 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1260] L996-10-->L998-2: Formula: (and (= (store |v_#pthreadsMutex_24| |v_~#m~0.base_18| (store (select |v_#pthreadsMutex_24| |v_~#m~0.base_18|) |v_~#m~0.offset_18| 0)) |v_#pthreadsMutex_23|) (= |v_t1Thread1of1ForFork1_#t~ret41#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#m~0.base=|v_~#m~0.base_18|, ~#m~0.offset=|v_~#m~0.offset_18|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_23|, t1Thread1of1ForFork1_#t~ret41#1=|v_t1Thread1of1ForFork1_#t~ret41#1_1|, ~#m~0.base=|v_~#m~0.base_18|, ~#m~0.offset=|v_~#m~0.offset_18|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_#t~ret41#1][2949], [1998#(<= 1 ~top~0), 32789#(< ~top~0 2147483642), 17923#(< ~top~0 2147483645), 8121#(<= |t1Thread1of1ForFork1_~i~0#1| 399), 13831#(< ~top~0 2147483645), 9971#(< ~top~0 2147483647), 1982#true, 22633#(< ~top~0 2147483641), 1967#true, 1925#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 208#L998-2true, 1978#(<= 1 ~top~0), 574#true, 19#L1007true, 5172#(< ~top~0 2147483646), 1956#(<= |t2Thread1of1ForFork0_~i~1#1| 399), 27579#(< ~top~0 2147483641), 1973#true, 16#L1022-4true, 6561#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 1961#true, 38035#(< ~top~0 2147483641), t2Thread1of1ForFork0InUse, t1Thread1of1ForFork1InUse, 11386#(<= 1 ~top~0), 580#true]) [2025-03-15 01:27:47,908 INFO L294 olderBase$Statistics]: this new event has 849 ancestors and is cut-off event [2025-03-15 01:27:47,908 INFO L297 olderBase$Statistics]: existing Event has 767 ancestors and is cut-off event [2025-03-15 01:27:47,908 INFO L297 olderBase$Statistics]: existing Event has 820 ancestors and is cut-off event [2025-03-15 01:27:47,908 INFO L297 olderBase$Statistics]: existing Event has 801 ancestors and is cut-off event [2025-03-15 01:27:47,908 INFO L297 olderBase$Statistics]: existing Event has 794 ancestors and is cut-off event [2025-03-15 01:27:47,908 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1260] L996-10-->L998-2: Formula: (and (= (store |v_#pthreadsMutex_24| |v_~#m~0.base_18| (store (select |v_#pthreadsMutex_24| |v_~#m~0.base_18|) |v_~#m~0.offset_18| 0)) |v_#pthreadsMutex_23|) (= |v_t1Thread1of1ForFork1_#t~ret41#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#m~0.base=|v_~#m~0.base_18|, ~#m~0.offset=|v_~#m~0.offset_18|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_23|, t1Thread1of1ForFork1_#t~ret41#1=|v_t1Thread1of1ForFork1_#t~ret41#1_1|, ~#m~0.base=|v_~#m~0.base_18|, ~#m~0.offset=|v_~#m~0.offset_18|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_#t~ret41#1][3030], [1998#(<= 1 ~top~0), 32789#(< ~top~0 2147483642), 17923#(< ~top~0 2147483645), 8121#(<= |t1Thread1of1ForFork1_~i~0#1| 399), 13831#(< ~top~0 2147483645), 9971#(< ~top~0 2147483647), 22633#(< ~top~0 2147483641), 1982#true, 1967#true, 1954#true, 1978#(<= 1 ~top~0), 208#L998-2true, 1925#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 574#true, 5172#(< ~top~0 2147483646), 27579#(< ~top~0 2147483641), 1973#true, 16#L1022-4true, 6561#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 1961#true, 38035#(< ~top~0 2147483641), t2Thread1of1ForFork0InUse, 184#L1015true, t1Thread1of1ForFork1InUse, 11386#(<= 1 ~top~0), 580#true]) [2025-03-15 01:27:47,908 INFO L294 olderBase$Statistics]: this new event has 849 ancestors and is cut-off event [2025-03-15 01:27:47,908 INFO L297 olderBase$Statistics]: existing Event has 794 ancestors and is cut-off event [2025-03-15 01:27:47,908 INFO L297 olderBase$Statistics]: existing Event has 767 ancestors and is cut-off event [2025-03-15 01:27:47,908 INFO L297 olderBase$Statistics]: existing Event has 812 ancestors and is cut-off event [2025-03-15 01:27:47,908 INFO L297 olderBase$Statistics]: existing Event has 820 ancestors and is cut-off event [2025-03-15 01:27:47,908 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1260] L996-10-->L998-2: Formula: (and (= (store |v_#pthreadsMutex_24| |v_~#m~0.base_18| (store (select |v_#pthreadsMutex_24| |v_~#m~0.base_18|) |v_~#m~0.offset_18| 0)) |v_#pthreadsMutex_23|) (= |v_t1Thread1of1ForFork1_#t~ret41#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#m~0.base=|v_~#m~0.base_18|, ~#m~0.offset=|v_~#m~0.offset_18|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_23|, t1Thread1of1ForFork1_#t~ret41#1=|v_t1Thread1of1ForFork1_#t~ret41#1_1|, ~#m~0.base=|v_~#m~0.base_18|, ~#m~0.offset=|v_~#m~0.offset_18|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_#t~ret41#1][3030], [1998#(<= 1 ~top~0), 32789#(< ~top~0 2147483642), 8121#(<= |t1Thread1of1ForFork1_~i~0#1| 399), 17923#(< ~top~0 2147483645), 13831#(< ~top~0 2147483645), 9971#(< ~top~0 2147483647), 1982#true, 22633#(< ~top~0 2147483641), 1967#true, 1954#true, 1925#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 1978#(<= 1 ~top~0), 208#L998-2true, 574#true, 5172#(< ~top~0 2147483646), 27579#(< ~top~0 2147483641), 1973#true, 16#L1022-4true, 6561#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 1961#true, 38035#(< ~top~0 2147483641), 335#L1005-7true, t2Thread1of1ForFork0InUse, t1Thread1of1ForFork1InUse, 11386#(<= 1 ~top~0), 580#true]) [2025-03-15 01:27:47,908 INFO L294 olderBase$Statistics]: this new event has 848 ancestors and is cut-off event [2025-03-15 01:27:47,908 INFO L297 olderBase$Statistics]: existing Event has 793 ancestors and is cut-off event [2025-03-15 01:27:47,908 INFO L297 olderBase$Statistics]: existing Event has 766 ancestors and is cut-off event [2025-03-15 01:27:47,908 INFO L297 olderBase$Statistics]: existing Event has 811 ancestors and is cut-off event [2025-03-15 01:27:47,908 INFO L297 olderBase$Statistics]: existing Event has 819 ancestors and is cut-off event [2025-03-15 01:29:16,310 INFO L124 PetriNetUnfolderBase]: 13980/97148 cut-off events. [2025-03-15 01:29:16,311 INFO L125 PetriNetUnfolderBase]: For 3578708/3696023 co-relation queries the response was YES. [2025-03-15 01:29:17,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 670908 conditions, 97148 events. 13980/97148 cut-off events. For 3578708/3696023 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 1255618 event pairs, 2398 based on Foata normal form. 755/89058 useless extension candidates. Maximal degree in co-relation 645652. Up to 30593 conditions per place. [2025-03-15 01:29:17,911 INFO L140 encePairwiseOnDemand]: 560/574 looper letters, 7026 selfloop transitions, 1253 changer transitions 2441/11240 dead transitions. [2025-03-15 01:29:17,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 939 places, 11240 transitions, 404157 flow [2025-03-15 01:29:17,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-03-15 01:29:17,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2025-03-15 01:29:17,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 39394 transitions. [2025-03-15 01:29:17,962 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9274413786608908 [2025-03-15 01:29:17,963 INFO L298 CegarLoopForPetriNet]: 571 programPoint places, 368 predicate places. [2025-03-15 01:29:17,963 INFO L471 AbstractCegarLoop]: Abstraction has has 939 places, 11240 transitions, 404157 flow [2025-03-15 01:29:17,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 532.2391304347826) internal successors, (24483), 46 states have internal predecessors, (24483), 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:29:17,979 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:29:17,980 INFO L221 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:29:17,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-15 01:29:18,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-15 01:29:18,181 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:29:18,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:29:18,186 INFO L85 PathProgramCache]: Analyzing trace with hash 42718284, now seen corresponding path program 4 times [2025-03-15 01:29:18,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:29:18,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384227790] [2025-03-15 01:29:18,187 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 01:29:18,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:29:18,551 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 01:29:18,551 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:29:21,508 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 0 proven. 647 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 01:29:21,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:29:21,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384227790] [2025-03-15 01:29:21,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384227790] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:29:21,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932108322] [2025-03-15 01:29:21,510 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 01:29:21,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:29:21,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:29:21,512 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:29:21,514 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:29:22,173 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 01:29:22,173 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:29:22,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 1966 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-15 01:29:22,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:29:23,194 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 0 proven. 647 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 01:29:23,195 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:29:24,451 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 0 proven. 647 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 01:29:24,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932108322] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:29:24,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:29:24,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 41 [2025-03-15 01:29:24,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300336605] [2025-03-15 01:29:24,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:29:24,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-15 01:29:24,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:29:24,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-15 01:29:24,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=1354, Unknown=0, NotChecked=0, Total=1722 [2025-03-15 01:29:24,466 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 532 out of 574 [2025-03-15 01:29:24,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 939 places, 11240 transitions, 404157 flow. Second operand has 42 states, 42 states have (on average 538.1190476190476) internal successors, (22601), 42 states have internal predecessors, (22601), 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:29:24,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:29:24,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 532 of 574 [2025-03-15 01:29:24,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:31:25,583 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1260] L996-10-->L998-2: Formula: (and (= (store |v_#pthreadsMutex_24| |v_~#m~0.base_18| (store (select |v_#pthreadsMutex_24| |v_~#m~0.base_18|) |v_~#m~0.offset_18| 0)) |v_#pthreadsMutex_23|) (= |v_t1Thread1of1ForFork1_#t~ret41#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#m~0.base=|v_~#m~0.base_18|, ~#m~0.offset=|v_~#m~0.offset_18|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_23|, t1Thread1of1ForFork1_#t~ret41#1=|v_t1Thread1of1ForFork1_#t~ret41#1_1|, ~#m~0.base=|v_~#m~0.base_18|, ~#m~0.offset=|v_~#m~0.offset_18|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork1_#t~ret41#1][4469], [1998#(<= 1 ~top~0), 32789#(< ~top~0 2147483642), 8121#(<= |t1Thread1of1ForFork1_~i~0#1| 399), 17923#(< ~top~0 2147483645), 13831#(< ~top~0 2147483645), 9971#(< ~top~0 2147483647), 1982#true, 22633#(< ~top~0 2147483641), 1957#(<= |t2Thread1of1ForFork0_#t~post46#1| 399), 1967#true, 1978#(<= 1 ~top~0), 208#L998-2true, 574#true, 5172#(< ~top~0 2147483646), 27579#(< ~top~0 2147483641), 1973#true, 16#L1022-4true, 1952#(and (<= 0 (+ |t2Thread1of1ForFork0_#t~post46#1| 2147483648)) (<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|))), 6561#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 526#L1005-6true, 1961#true, 44290#(< ~top~0 2147483640), 38035#(< ~top~0 2147483641), t2Thread1of1ForFork0InUse, t1Thread1of1ForFork1InUse, 11386#(<= 1 ~top~0), 580#true]) [2025-03-15 01:31:25,583 INFO L294 olderBase$Statistics]: this new event has 900 ancestors and is cut-off event [2025-03-15 01:31:25,583 INFO L297 olderBase$Statistics]: existing Event has 855 ancestors and is cut-off event [2025-03-15 01:31:25,583 INFO L297 olderBase$Statistics]: existing Event has 829 ancestors and is cut-off event [2025-03-15 01:31:25,583 INFO L297 olderBase$Statistics]: existing Event has 855 ancestors and is cut-off event [2025-03-15 01:35:42,218 INFO L124 PetriNetUnfolderBase]: 23355/166308 cut-off events. [2025-03-15 01:35:42,219 INFO L125 PetriNetUnfolderBase]: For 6402677/6619413 co-relation queries the response was YES. [2025-03-15 01:35:43,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1192218 conditions, 166308 events. 23355/166308 cut-off events. For 6402677/6619413 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 2281823 event pairs, 4256 based on Foata normal form. 1322/152534 useless extension candidates. Maximal degree in co-relation 1158094. Up to 52505 conditions per place. [2025-03-15 01:35:44,558 INFO L140 encePairwiseOnDemand]: 563/574 looper letters, 11833 selfloop transitions, 2274 changer transitions 4168/18905 dead transitions. [2025-03-15 01:35:44,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1007 places, 18905 transitions, 725902 flow [2025-03-15 01:35:44,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-03-15 01:35:44,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2025-03-15 01:35:44,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 37193 transitions. [2025-03-15 01:35:44,570 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9390748876432864 [2025-03-15 01:35:44,571 INFO L298 CegarLoopForPetriNet]: 571 programPoint places, 436 predicate places. [2025-03-15 01:35:44,571 INFO L471 AbstractCegarLoop]: Abstraction has has 1007 places, 18905 transitions, 725902 flow [2025-03-15 01:35:44,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 538.1190476190476) internal successors, (22601), 42 states have internal predecessors, (22601), 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:35:44,575 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:35:44,576 INFO L221 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:35:44,587 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:35:44,776 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,SelfDestructingSolverStorable21 [2025-03-15 01:35:44,777 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:35:44,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:35:44,779 INFO L85 PathProgramCache]: Analyzing trace with hash 466664493, now seen corresponding path program 5 times [2025-03-15 01:35:44,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:35:44,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630975619] [2025-03-15 01:35:44,780 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 01:35:44,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:35:45,010 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-15 01:35:45,011 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:35:47,100 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 952 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-15 01:35:47,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:35:47,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630975619] [2025-03-15 01:35:47,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630975619] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:35:47,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171436159] [2025-03-15 01:35:47,101 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 01:35:47,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:35:47,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:35:47,104 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:35:47,106 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:35:58,671 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-15 01:35:58,671 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:35:58,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 2212 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-15 01:35:58,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:35:59,486 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 952 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-15 01:35:59,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:36:00,599 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 952 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-15 01:36:00,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171436159] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:36:00,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:36:00,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2025-03-15 01:36:00,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071565505] [2025-03-15 01:36:00,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:36:00,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-15 01:36:00,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:36:00,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-15 01:36:00,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=578, Invalid=2074, Unknown=0, NotChecked=0, Total=2652 [2025-03-15 01:36:00,613 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 532 out of 574 [2025-03-15 01:36:00,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1007 places, 18905 transitions, 725902 flow. Second operand has 52 states, 52 states have (on average 538.0) internal successors, (27976), 52 states have internal predecessors, (27976), 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:00,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:36:00,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 532 of 574 [2025-03-15 01:36:00,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:36:19,479 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1293] L1008-1-->L1013-2: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret45#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret45#1=|v_t2Thread1of1ForFork0_#t~ret45#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret45#1][680], [8155#(<= ~top~0 0), 1976#true, 19639#(<= ~top~0 0), 46024#(<= ~top~0 0), 1967#true, 11388#(<= 0 ~top~0), 1925#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 574#true, 1994#true, 15262#(<= ~top~0 0), 8119#true, 1986#(<= ~top~0 1), 1956#(<= |t2Thread1of1ForFork0_~i~1#1| 399), 1973#true, 34250#(<= ~top~0 0), 3538#(<= ~top~0 0), 16#L1022-4true, 11431#(<= ~top~0 0), 6561#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 171#L1013-2true, 1961#true, 29081#(<= ~top~0 0), 294#L1000true, 39762#(<= ~top~0 0), t2Thread1of1ForFork0InUse, t1Thread1of1ForFork1InUse, 24092#(<= ~top~0 0), 580#true]) [2025-03-15 01:36:19,479 INFO L294 olderBase$Statistics]: this new event has 609 ancestors and is cut-off event [2025-03-15 01:36:19,479 INFO L297 olderBase$Statistics]: existing Event has 538 ancestors and is cut-off event [2025-03-15 01:36:19,479 INFO L297 olderBase$Statistics]: existing Event has 527 ancestors and is cut-off event [2025-03-15 01:36:19,479 INFO L297 olderBase$Statistics]: existing Event has 572 ancestors and is cut-off event [2025-03-15 01:36:19,479 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1293] L1008-1-->L1013-2: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret45#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret45#1=|v_t2Thread1of1ForFork0_#t~ret45#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret45#1][680], [8155#(<= ~top~0 0), 19639#(<= ~top~0 0), 1976#true, 46024#(<= ~top~0 0), 1967#true, 11388#(<= 0 ~top~0), 1925#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 574#true, 1994#true, 15262#(<= ~top~0 0), 8119#true, 374#L991-7true, 1986#(<= ~top~0 1), 1956#(<= |t2Thread1of1ForFork0_~i~1#1| 399), 1973#true, 34250#(<= ~top~0 0), 3538#(<= ~top~0 0), 16#L1022-4true, 11431#(<= ~top~0 0), 6561#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 171#L1013-2true, 1961#true, 29081#(<= ~top~0 0), 39762#(<= ~top~0 0), t2Thread1of1ForFork0InUse, t1Thread1of1ForFork1InUse, 24092#(<= ~top~0 0), 580#true]) [2025-03-15 01:36:19,479 INFO L294 olderBase$Statistics]: this new event has 608 ancestors and is cut-off event [2025-03-15 01:36:19,479 INFO L297 olderBase$Statistics]: existing Event has 571 ancestors and is cut-off event [2025-03-15 01:36:19,479 INFO L297 olderBase$Statistics]: existing Event has 537 ancestors and is cut-off event [2025-03-15 01:36:19,479 INFO L297 olderBase$Statistics]: existing Event has 526 ancestors and is cut-off event [2025-03-15 01:36:19,572 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1346] t1EXIT-->L1023-1: Formula: (and (= |v_ULTIMATE.start_main_~id1~0#1_6| v_t1Thread1of1ForFork1_thidvar0_4) (= v_t1Thread1of1ForFork1_thidvar1_4 0)) InVars {t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} OutVars{t1Thread1of1ForFork1_thidvar0=v_t1Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~id1~0#1=|v_ULTIMATE.start_main_~id1~0#1_6|, t1Thread1of1ForFork1_thidvar1=v_t1Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][689], [130#L1008-1true, 8155#(<= ~top~0 0), 19639#(<= ~top~0 0), 46024#(<= ~top~0 0), 1976#true, 145#L1023-1true, 1967#true, 11388#(<= 0 ~top~0), 1925#(<= 0 (+ 2147483648 |t2Thread1of1ForFork0_~i~1#1|)), 574#true, 1994#true, 1975#(= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 1), 15262#(<= ~top~0 0), 8119#true, 1986#(<= ~top~0 1), 1956#(<= |t2Thread1of1ForFork0_~i~1#1| 399), 34250#(<= ~top~0 0), 3538#(<= ~top~0 0), 11431#(<= ~top~0 0), 6561#(<= 1 |t1Thread1of1ForFork1_~i~0#1|), 1961#true, 29081#(<= ~top~0 0), 39762#(<= ~top~0 0), t2Thread1of1ForFork0InUse, t1Thread1of1ForFork1NotInUse, 24092#(<= ~top~0 0), 580#true]) [2025-03-15 01:36:19,572 INFO L294 olderBase$Statistics]: this new event has 613 ancestors and is cut-off event [2025-03-15 01:36:19,572 INFO L297 olderBase$Statistics]: existing Event has 531 ancestors and is cut-off event [2025-03-15 01:36:19,572 INFO L297 olderBase$Statistics]: existing Event has 576 ancestors and is cut-off event [2025-03-15 01:36:19,572 INFO L297 olderBase$Statistics]: existing Event has 542 ancestors and is cut-off event Received shutdown request... [2025-03-15 01:37:33,332 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:33,332 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:33,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-15 01:37:33,403 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2025-03-15 01:37:33,424 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:33,608 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,SelfDestructingSolverStorable22 [2025-03-15 01:37:33,608 WARN L596 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (52states, 532/574 universal loopers) in iteration 23,while PetriNetUnfolder was constructing finite prefix that currently has 161304 conditions, 21072 events (3155/21071 cut-off events. For 1059195/1086856 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 232941 event pairs, 454 based on Foata normal form. 297/19714 useless extension candidates. Maximal degree in co-relation 152610. Up to 6176 conditions per place.). [2025-03-15 01:37:33,613 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 18 remaining) [2025-03-15 01:37:33,613 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 18 remaining) [2025-03-15 01:37:33,613 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2025-03-15 01:37:33,613 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2025-03-15 01:37:33,613 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2025-03-15 01:37:33,613 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2025-03-15 01:37:33,613 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2025-03-15 01:37:33,613 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2025-03-15 01:37:33,613 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2025-03-15 01:37:33,613 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2025-03-15 01:37:33,613 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2025-03-15 01:37:33,613 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2025-03-15 01:37:33,613 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2025-03-15 01:37:33,613 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2025-03-15 01:37:33,613 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2025-03-15 01:37:33,613 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2025-03-15 01:37:33,614 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2025-03-15 01:37:33,614 INFO L422 BasicCegarLoop]: Path program histogram: [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:37:33,633 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:37:33,633 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:37:33,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:37:33 BasicIcfg [2025-03-15 01:37:33,642 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:37:33,643 INFO L158 Benchmark]: Toolchain (without parser) took 753914.04ms. Allocated memory was 71.3MB in the beginning and 6.6GB in the end (delta: 6.5GB). Free memory was 41.9MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 6.3GB. Max. memory is 8.0GB. [2025-03-15 01:37:33,643 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 71.3MB. Free memory is still 36.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:37:33,643 INFO L158 Benchmark]: CACSL2BoogieTranslator took 555.40ms. Allocated memory is still 71.3MB. Free memory was 41.8MB in the beginning and 32.0MB in the end (delta: 9.8MB). Peak memory consumption was 31.0MB. Max. memory is 8.0GB. [2025-03-15 01:37:33,648 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.89ms. Allocated memory is still 71.3MB. Free memory was 32.0MB in the beginning and 26.3MB in the end (delta: 5.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:37:33,648 INFO L158 Benchmark]: Boogie Preprocessor took 44.59ms. Allocated memory is still 71.3MB. Free memory was 26.3MB in the beginning and 22.8MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:37:33,648 INFO L158 Benchmark]: RCFGBuilder took 837.32ms. Allocated memory was 71.3MB in the beginning and 92.3MB in the end (delta: 21.0MB). Free memory was 22.8MB in the beginning and 35.8MB in the end (delta: -13.0MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. [2025-03-15 01:37:33,648 INFO L158 Benchmark]: TraceAbstraction took 752393.70ms. Allocated memory was 92.3MB in the beginning and 6.6GB in the end (delta: 6.5GB). Free memory was 34.8MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 6.3GB. Max. memory is 8.0GB. [2025-03-15 01:37:33,650 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.23ms. Allocated memory is still 71.3MB. Free memory is still 36.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 555.40ms. Allocated memory is still 71.3MB. Free memory was 41.8MB in the beginning and 32.0MB in the end (delta: 9.8MB). Peak memory consumption was 31.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 71.89ms. Allocated memory is still 71.3MB. Free memory was 32.0MB in the beginning and 26.3MB in the end (delta: 5.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.59ms. Allocated memory is still 71.3MB. Free memory was 26.3MB in the beginning and 22.8MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 837.32ms. Allocated memory was 71.3MB in the beginning and 92.3MB in the end (delta: 21.0MB). Free memory was 22.8MB in the beginning and 35.8MB in the end (delta: -13.0MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. * TraceAbstraction took 752393.70ms. Allocated memory was 92.3MB in the beginning and 6.6GB in the end (delta: 6.5GB). Free memory was 34.8MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 6.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 945]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (52states, 532/574 universal loopers) in iteration 23,while PetriNetUnfolder was constructing finite prefix that currently has 161304 conditions, 21072 events (3155/21071 cut-off events. For 1059195/1086856 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 232941 event pairs, 454 based on Foata normal form. 297/19714 useless extension candidates. Maximal degree in co-relation 152610. Up to 6176 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 (52states, 532/574 universal loopers) in iteration 23,while PetriNetUnfolder was constructing finite prefix that currently has 161304 conditions, 21072 events (3155/21071 cut-off events. For 1059195/1086856 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 232941 event pairs, 454 based on Foata normal form. 297/19714 useless extension candidates. Maximal degree in co-relation 152610. Up to 6176 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 (52states, 532/574 universal loopers) in iteration 23,while PetriNetUnfolder was constructing finite prefix that currently has 161304 conditions, 21072 events (3155/21071 cut-off events. For 1059195/1086856 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 232941 event pairs, 454 based on Foata normal form. 297/19714 useless extension candidates. Maximal degree in co-relation 152610. Up to 6176 conditions per place.). - TimeoutResultAtElement [Line: 945]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (52states, 532/574 universal loopers) in iteration 23,while PetriNetUnfolder was constructing finite prefix that currently has 161304 conditions, 21072 events (3155/21071 cut-off events. For 1059195/1086856 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 232941 event pairs, 454 based on Foata normal form. 297/19714 useless extension candidates. Maximal degree in co-relation 152610. Up to 6176 conditions per place.). - TimeoutResultAtElement [Line: 991]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (52states, 532/574 universal loopers) in iteration 23,while PetriNetUnfolder was constructing finite prefix that currently has 161304 conditions, 21072 events (3155/21071 cut-off events. For 1059195/1086856 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 232941 event pairs, 454 based on Foata normal form. 297/19714 useless extension candidates. Maximal degree in co-relation 152610. Up to 6176 conditions per place.). - TimeoutResultAtElement [Line: 991]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (52states, 532/574 universal loopers) in iteration 23,while PetriNetUnfolder was constructing finite prefix that currently has 161304 conditions, 21072 events (3155/21071 cut-off events. For 1059195/1086856 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 232941 event pairs, 454 based on Foata normal form. 297/19714 useless extension candidates. Maximal degree in co-relation 152610. Up to 6176 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 (52states, 532/574 universal loopers) in iteration 23,while PetriNetUnfolder was constructing finite prefix that currently has 161304 conditions, 21072 events (3155/21071 cut-off events. For 1059195/1086856 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 232941 event pairs, 454 based on Foata normal form. 297/19714 useless extension candidates. Maximal degree in co-relation 152610. Up to 6176 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 (52states, 532/574 universal loopers) in iteration 23,while PetriNetUnfolder was constructing finite prefix that currently has 161304 conditions, 21072 events (3155/21071 cut-off events. For 1059195/1086856 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 232941 event pairs, 454 based on Foata normal form. 297/19714 useless extension candidates. Maximal degree in co-relation 152610. Up to 6176 conditions per place.). - TimeoutResultAtElement [Line: 949]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (52states, 532/574 universal loopers) in iteration 23,while PetriNetUnfolder was constructing finite prefix that currently has 161304 conditions, 21072 events (3155/21071 cut-off events. For 1059195/1086856 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 232941 event pairs, 454 based on Foata normal form. 297/19714 useless extension candidates. Maximal degree in co-relation 152610. Up to 6176 conditions per place.). - TimeoutResultAtElement [Line: 949]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (52states, 532/574 universal loopers) in iteration 23,while PetriNetUnfolder was constructing finite prefix that currently has 161304 conditions, 21072 events (3155/21071 cut-off events. For 1059195/1086856 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 232941 event pairs, 454 based on Foata normal form. 297/19714 useless extension candidates. Maximal degree in co-relation 152610. Up to 6176 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 691 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.2s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 752.2s, OverallIterations: 23, TraceHistogramMax: 14, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 703.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3863 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3863 mSDsluCounter, 1241 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1056 mSDsCounter, 210 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5222 IncrementalHoareTripleChecker+Invalid, 5432 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 210 mSolverCounterUnsat, 185 mSDtfsCounter, 5222 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17732 GetRequests, 17076 SyntacticMatches, 1 SemanticMatches, 655 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11092 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=725902occurred in iteration=22, InterpolantAutomatonStates: 481, 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.6s SsaConstructionTime, 15.2s SatisfiabilityAnalysisTime, 28.8s InterpolantComputationTime, 23445 NumberOfCodeBlocks, 23445 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 31251 ConstructedInterpolants, 0 QuantifiedInterpolants, 83649 SizeOfPredicates, 168 NumberOfNonLiveVariables, 18334 ConjunctsInSsa, 194 ConjunctsInUnsatCore, 46 InterpolantComputations, 13 PerfectInterpolantSequences, 168/13970 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