/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/weaver/popl20-bad-buffer-mult-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 02:38:52,678 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 02:38:52,757 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 02:38:52,780 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 02:38:52,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 02:38:52,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 02:38:52,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 02:38:52,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 02:38:52,781 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 02:38:52,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 02:38:52,781 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 02:38:52,781 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 02:38:52,781 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 02:38:52,781 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 02:38:52,781 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 02:38:52,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 02:38:52,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 02:38:52,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 02:38:52,782 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 02:38:52,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 02:38:52,782 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 02:38:52,782 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 02:38:52,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 02:38:52,782 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 02:38:52,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 02:38:52,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 02:38:52,782 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 02:38:52,782 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 02:38:52,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 02:38:52,783 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 02:38:52,783 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 02:38:52,783 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 02:38:52,783 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 02:38:53,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 02:38:53,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 02:38:53,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 02:38:53,027 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 02:38:53,028 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 02:38:53,028 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c [2025-03-15 02:38:54,189 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db2cc88e5/4f7f0f8fe06a49ecb4ba61a9ed3c0f33/FLAG5dc1598e3 [2025-03-15 02:38:54,394 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 02:38:54,395 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c [2025-03-15 02:38:54,404 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db2cc88e5/4f7f0f8fe06a49ecb4ba61a9ed3c0f33/FLAG5dc1598e3 [2025-03-15 02:38:54,419 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db2cc88e5/4f7f0f8fe06a49ecb4ba61a9ed3c0f33 [2025-03-15 02:38:54,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 02:38:54,424 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 02:38:54,425 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 02:38:54,425 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 02:38:54,429 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 02:38:54,429 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:38:54" (1/1) ... [2025-03-15 02:38:54,431 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23da58cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:38:54, skipping insertion in model container [2025-03-15 02:38:54,431 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:38:54" (1/1) ... [2025-03-15 02:38:54,449 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 02:38:54,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 02:38:54,620 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 02:38:54,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 02:38:54,653 INFO L204 MainTranslator]: Completed translation [2025-03-15 02:38:54,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:38:54 WrapperNode [2025-03-15 02:38:54,654 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 02:38:54,655 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 02:38:54,655 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 02:38:54,655 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 02:38:54,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:38:54" (1/1) ... [2025-03-15 02:38:54,668 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:38:54" (1/1) ... [2025-03-15 02:38:54,687 INFO L138 Inliner]: procedures = 25, calls = 60, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 341 [2025-03-15 02:38:54,688 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 02:38:54,688 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 02:38:54,688 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 02:38:54,688 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 02:38:54,695 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:38:54" (1/1) ... [2025-03-15 02:38:54,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:38:54" (1/1) ... [2025-03-15 02:38:54,697 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:38:54" (1/1) ... [2025-03-15 02:38:54,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:38:54" (1/1) ... [2025-03-15 02:38:54,707 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:38:54" (1/1) ... [2025-03-15 02:38:54,709 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:38:54" (1/1) ... [2025-03-15 02:38:54,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:38:54" (1/1) ... [2025-03-15 02:38:54,713 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:38:54" (1/1) ... [2025-03-15 02:38:54,713 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:38:54" (1/1) ... [2025-03-15 02:38:54,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 02:38:54,716 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 02:38:54,716 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 02:38:54,716 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 02:38:54,717 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:38:54" (1/1) ... [2025-03-15 02:38:54,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 02:38:54,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:38:54,739 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 02:38:54,741 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 02:38:54,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 02:38:54,757 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 02:38:54,757 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 02:38:54,757 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 02:38:54,757 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 02:38:54,757 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-15 02:38:54,757 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-15 02:38:54,758 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-15 02:38:54,758 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-15 02:38:54,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 02:38:54,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 02:38:54,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-15 02:38:54,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-15 02:38:54,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 02:38:54,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 02:38:54,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 02:38:54,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 02:38:54,759 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 02:38:54,838 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 02:38:54,840 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 02:38:55,294 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 02:38:55,294 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 02:38:55,611 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 02:38:55,611 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 02:38:55,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:38:55 BoogieIcfgContainer [2025-03-15 02:38:55,612 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 02:38:55,615 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 02:38:55,615 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 02:38:55,618 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 02:38:55,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 02:38:54" (1/3) ... [2025-03-15 02:38:55,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f95187c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:38:55, skipping insertion in model container [2025-03-15 02:38:55,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:38:54" (2/3) ... [2025-03-15 02:38:55,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f95187c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:38:55, skipping insertion in model container [2025-03-15 02:38:55,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:38:55" (3/3) ... [2025-03-15 02:38:55,620 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt.wvr.c [2025-03-15 02:38:55,632 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 02:38:55,634 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-buffer-mult-alt.wvr.c that has 5 procedures, 262 locations, 1 initial locations, 6 loop locations, and 30 error locations. [2025-03-15 02:38:55,635 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 02:38:55,768 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-15 02:38:55,802 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 02:38:55,811 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@334a9953, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 02:38:55,811 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2025-03-15 02:38:55,855 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 02:38:55,855 INFO L124 PetriNetUnfolderBase]: 2/99 cut-off events. [2025-03-15 02:38:55,858 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 02:38:55,858 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:38:55,858 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] [2025-03-15 02:38:55,858 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:38:55,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:38:55,864 INFO L85 PathProgramCache]: Analyzing trace with hash 183856601, now seen corresponding path program 1 times [2025-03-15 02:38:55,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:38:55,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875903570] [2025-03-15 02:38:55,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:38:55,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:38:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:38:56,201 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 02:38:56,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:38:56,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875903570] [2025-03-15 02:38:56,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875903570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:38:56,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:38:56,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:38:56,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025524089] [2025-03-15 02:38:56,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:38:56,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:38:56,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:38:56,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:38:56,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:38:56,232 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 274 [2025-03-15 02:38:56,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 274 transitions, 576 flow. Second operand has 4 states, 4 states have (on average 199.5) internal successors, (798), 4 states have internal predecessors, (798), 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 02:38:56,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:38:56,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 274 [2025-03-15 02:38:56,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:38:59,672 INFO L124 PetriNetUnfolderBase]: 13075/18763 cut-off events. [2025-03-15 02:38:59,672 INFO L125 PetriNetUnfolderBase]: For 2882/2882 co-relation queries the response was YES. [2025-03-15 02:38:59,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36752 conditions, 18763 events. 13075/18763 cut-off events. For 2882/2882 co-relation queries the response was YES. Maximal size of possible extension queue 1864. Compared 120647 event pairs, 7753 based on Foata normal form. 8/7085 useless extension candidates. Maximal degree in co-relation 35920. Up to 16289 conditions per place. [2025-03-15 02:38:59,891 INFO L140 encePairwiseOnDemand]: 244/274 looper letters, 67 selfloop transitions, 10 changer transitions 15/266 dead transitions. [2025-03-15 02:38:59,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 266 transitions, 712 flow [2025-03-15 02:38:59,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 02:38:59,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 02:38:59,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1088 transitions. [2025-03-15 02:38:59,903 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7941605839416058 [2025-03-15 02:38:59,905 INFO L298 CegarLoopForPetriNet]: 274 programPoint places, -15 predicate places. [2025-03-15 02:38:59,905 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 266 transitions, 712 flow [2025-03-15 02:38:59,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 199.5) internal successors, (798), 4 states have internal predecessors, (798), 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 02:38:59,906 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:38:59,906 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 02:38:59,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 02:38:59,907 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:38:59,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:38:59,907 INFO L85 PathProgramCache]: Analyzing trace with hash -748966650, now seen corresponding path program 1 times [2025-03-15 02:38:59,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:38:59,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890317482] [2025-03-15 02:38:59,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:38:59,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:38:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:39:00,097 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:39:00,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:39:00,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890317482] [2025-03-15 02:39:00,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890317482] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:39:00,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838947854] [2025-03-15 02:39:00,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:39:00,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:39:00,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:39:00,102 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 02:39:00,107 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 02:39:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:39:00,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 02:39:00,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:39:00,306 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:39:00,306 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 02:39:00,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838947854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:39:00,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 02:39:00,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-15 02:39:00,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189792669] [2025-03-15 02:39:00,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:39:00,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:39:00,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:39:00,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:39:00,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:39:00,310 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 274 [2025-03-15 02:39:00,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 266 transitions, 712 flow. Second operand has 6 states, 6 states have (on average 200.16666666666666) internal successors, (1201), 6 states have internal predecessors, (1201), 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 02:39:00,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:39:00,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 274 [2025-03-15 02:39:00,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:39:02,761 INFO L124 PetriNetUnfolderBase]: 13075/18761 cut-off events. [2025-03-15 02:39:02,762 INFO L125 PetriNetUnfolderBase]: For 3449/3899 co-relation queries the response was YES. [2025-03-15 02:39:02,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53051 conditions, 18761 events. 13075/18761 cut-off events. For 3449/3899 co-relation queries the response was YES. Maximal size of possible extension queue 1865. Compared 120150 event pairs, 7753 based on Foata normal form. 0/7077 useless extension candidates. Maximal degree in co-relation 51979. Up to 16287 conditions per place. [2025-03-15 02:39:02,932 INFO L140 encePairwiseOnDemand]: 262/274 looper letters, 59 selfloop transitions, 16 changer transitions 15/264 dead transitions. [2025-03-15 02:39:02,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 264 transitions, 856 flow [2025-03-15 02:39:02,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:39:02,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:39:02,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1464 transitions. [2025-03-15 02:39:02,935 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7632950990615224 [2025-03-15 02:39:02,936 INFO L298 CegarLoopForPetriNet]: 274 programPoint places, -11 predicate places. [2025-03-15 02:39:02,936 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 264 transitions, 856 flow [2025-03-15 02:39:02,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 200.16666666666666) internal successors, (1201), 6 states have internal predecessors, (1201), 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 02:39:02,937 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:39:02,937 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] [2025-03-15 02:39:02,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-15 02:39:03,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:39:03,141 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:39:03,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:39:03,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1743128623, now seen corresponding path program 1 times [2025-03-15 02:39:03,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:39:03,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959170637] [2025-03-15 02:39:03,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:39:03,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:39:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:39:03,274 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 02:39:03,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:39:03,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959170637] [2025-03-15 02:39:03,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959170637] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:39:03,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317173362] [2025-03-15 02:39:03,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:39:03,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:39:03,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:39:03,277 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 02:39:03,278 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 02:39:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:39:03,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 02:39:03,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:39:03,503 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 02:39:03,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:39:03,573 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 02:39:03,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317173362] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:39:03,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:39:03,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-15 02:39:03,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352570674] [2025-03-15 02:39:03,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:39:03,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-15 02:39:03,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:39:03,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-15 02:39:03,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-15 02:39:03,584 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 274 [2025-03-15 02:39:03,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 264 transitions, 856 flow. Second operand has 12 states, 12 states have (on average 200.83333333333334) internal successors, (2410), 12 states have internal predecessors, (2410), 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 02:39:03,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:39:03,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 274 [2025-03-15 02:39:03,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:39:06,119 INFO L124 PetriNetUnfolderBase]: 13081/18831 cut-off events. [2025-03-15 02:39:06,119 INFO L125 PetriNetUnfolderBase]: For 4568/5468 co-relation queries the response was YES. [2025-03-15 02:39:06,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69580 conditions, 18831 events. 13081/18831 cut-off events. For 4568/5468 co-relation queries the response was YES. Maximal size of possible extension queue 1866. Compared 120841 event pairs, 7753 based on Foata normal form. 0/7141 useless extension candidates. Maximal degree in co-relation 68038. Up to 16339 conditions per place. [2025-03-15 02:39:06,358 INFO L140 encePairwiseOnDemand]: 260/274 looper letters, 91 selfloop transitions, 36 changer transitions 15/316 dead transitions. [2025-03-15 02:39:06,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 316 transitions, 1424 flow [2025-03-15 02:39:06,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 02:39:06,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 02:39:06,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2906 transitions. [2025-03-15 02:39:06,377 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7575599582898853 [2025-03-15 02:39:06,378 INFO L298 CegarLoopForPetriNet]: 274 programPoint places, 2 predicate places. [2025-03-15 02:39:06,378 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 316 transitions, 1424 flow [2025-03-15 02:39:06,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 200.83333333333334) internal successors, (2410), 12 states have internal predecessors, (2410), 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 02:39:06,379 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:39:06,380 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:39:06,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-15 02:39:06,581 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,SelfDestructingSolverStorable2 [2025-03-15 02:39:06,581 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:39:06,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:39:06,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1656124586, now seen corresponding path program 2 times [2025-03-15 02:39:06,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:39:06,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101455043] [2025-03-15 02:39:06,582 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:39:06,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:39:06,604 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:39:06,604 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:39:06,708 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-15 02:39:06,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:39:06,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101455043] [2025-03-15 02:39:06,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101455043] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:39:06,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910917572] [2025-03-15 02:39:06,708 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:39:06,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:39:06,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:39:06,710 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 02:39:06,712 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 02:39:06,791 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:39:06,792 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:39:06,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-15 02:39:06,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:39:06,876 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-15 02:39:06,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:39:06,960 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-15 02:39:06,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910917572] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:39:06,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:39:06,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2025-03-15 02:39:06,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160451896] [2025-03-15 02:39:06,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:39:06,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:39:06,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:39:06,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:39:06,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:39:06,962 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 274 [2025-03-15 02:39:06,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 316 transitions, 1424 flow. Second operand has 8 states, 8 states have (on average 182.125) internal successors, (1457), 8 states have internal predecessors, (1457), 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 02:39:06,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:39:06,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 274 [2025-03-15 02:39:06,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:39:08,673 INFO L124 PetriNetUnfolderBase]: 9237/13764 cut-off events. [2025-03-15 02:39:08,673 INFO L125 PetriNetUnfolderBase]: For 5252/6326 co-relation queries the response was YES. [2025-03-15 02:39:08,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61814 conditions, 13764 events. 9237/13764 cut-off events. For 5252/6326 co-relation queries the response was YES. Maximal size of possible extension queue 1361. Compared 89215 event pairs, 5587 based on Foata normal form. 0/5880 useless extension candidates. Maximal degree in co-relation 60164. Up to 11655 conditions per place. [2025-03-15 02:39:08,917 INFO L140 encePairwiseOnDemand]: 250/274 looper letters, 102 selfloop transitions, 41 changer transitions 15/314 dead transitions. [2025-03-15 02:39:08,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 314 transitions, 1696 flow [2025-03-15 02:39:08,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 02:39:08,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 02:39:08,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2594 transitions. [2025-03-15 02:39:08,933 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6762252346193952 [2025-03-15 02:39:08,935 INFO L298 CegarLoopForPetriNet]: 274 programPoint places, 12 predicate places. [2025-03-15 02:39:08,936 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 314 transitions, 1696 flow [2025-03-15 02:39:08,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 182.125) internal successors, (1457), 8 states have internal predecessors, (1457), 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 02:39:08,937 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:39:08,937 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] [2025-03-15 02:39:08,951 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 02:39:09,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:39:09,139 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:39:09,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:39:09,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1949578207, now seen corresponding path program 1 times [2025-03-15 02:39:09,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:39:09,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165812060] [2025-03-15 02:39:09,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:39:09,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:39:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:39:09,287 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 02:39:09,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:39:09,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165812060] [2025-03-15 02:39:09,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165812060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:39:09,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:39:09,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 02:39:09,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399223511] [2025-03-15 02:39:09,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:39:09,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 02:39:09,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:39:09,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 02:39:09,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 02:39:09,289 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 274 [2025-03-15 02:39:09,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 314 transitions, 1696 flow. Second operand has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 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 02:39:09,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:39:09,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 274 [2025-03-15 02:39:09,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:39:11,908 INFO L124 PetriNetUnfolderBase]: 14679/22678 cut-off events. [2025-03-15 02:39:11,908 INFO L125 PetriNetUnfolderBase]: For 23321/29989 co-relation queries the response was YES. [2025-03-15 02:39:11,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112294 conditions, 22678 events. 14679/22678 cut-off events. For 23321/29989 co-relation queries the response was YES. Maximal size of possible extension queue 1914. Compared 178034 event pairs, 8435 based on Foata normal form. 0/10873 useless extension candidates. Maximal degree in co-relation 108947. Up to 17076 conditions per place. [2025-03-15 02:39:12,120 INFO L140 encePairwiseOnDemand]: 270/274 looper letters, 60 selfloop transitions, 2 changer transitions 16/343 dead transitions. [2025-03-15 02:39:12,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 343 transitions, 2119 flow [2025-03-15 02:39:12,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 02:39:12,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 02:39:12,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 729 transitions. [2025-03-15 02:39:12,122 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8868613138686131 [2025-03-15 02:39:12,122 INFO L298 CegarLoopForPetriNet]: 274 programPoint places, 14 predicate places. [2025-03-15 02:39:12,122 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 343 transitions, 2119 flow [2025-03-15 02:39:12,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 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 02:39:12,122 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:39:12,123 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 02:39:12,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 02:39:12,123 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:39:12,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:39:12,123 INFO L85 PathProgramCache]: Analyzing trace with hash -320181188, now seen corresponding path program 1 times [2025-03-15 02:39:12,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:39:12,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21809631] [2025-03-15 02:39:12,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:39:12,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:39:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:39:12,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:39:12,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:39:12,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21809631] [2025-03-15 02:39:12,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21809631] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:39:12,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556678021] [2025-03-15 02:39:12,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:39:12,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:39:12,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:39:12,235 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 02:39:12,236 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 02:39:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:39:12,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-15 02:39:12,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:39:12,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:39:12,453 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 02:39:12,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556678021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:39:12,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 02:39:12,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-15 02:39:12,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187002478] [2025-03-15 02:39:12,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:39:12,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:39:12,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:39:12,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:39:12,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-15 02:39:12,455 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 274 [2025-03-15 02:39:12,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 343 transitions, 2119 flow. Second operand has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 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 02:39:12,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:39:12,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 274 [2025-03-15 02:39:12,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:39:15,248 INFO L124 PetriNetUnfolderBase]: 13196/20388 cut-off events. [2025-03-15 02:39:15,249 INFO L125 PetriNetUnfolderBase]: For 26698/34214 co-relation queries the response was YES. [2025-03-15 02:39:15,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117975 conditions, 20388 events. 13196/20388 cut-off events. For 26698/34214 co-relation queries the response was YES. Maximal size of possible extension queue 1714. Compared 157797 event pairs, 7651 based on Foata normal form. 4/10156 useless extension candidates. Maximal degree in co-relation 114219. Up to 15271 conditions per place. [2025-03-15 02:39:15,466 INFO L140 encePairwiseOnDemand]: 271/274 looper letters, 59 selfloop transitions, 2 changer transitions 16/342 dead transitions. [2025-03-15 02:39:15,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 342 transitions, 2233 flow [2025-03-15 02:39:15,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:39:15,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:39:15,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 948 transitions. [2025-03-15 02:39:15,472 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.864963503649635 [2025-03-15 02:39:15,472 INFO L298 CegarLoopForPetriNet]: 274 programPoint places, 16 predicate places. [2025-03-15 02:39:15,473 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 342 transitions, 2233 flow [2025-03-15 02:39:15,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 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 02:39:15,473 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:39:15,473 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 02:39:15,480 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 02:39:15,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:39:15,674 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:39:15,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:39:15,675 INFO L85 PathProgramCache]: Analyzing trace with hash -320181187, now seen corresponding path program 1 times [2025-03-15 02:39:15,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:39:15,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390142659] [2025-03-15 02:39:15,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:39:15,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:39:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:39:15,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:39:15,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:39:15,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390142659] [2025-03-15 02:39:15,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390142659] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:39:15,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973099140] [2025-03-15 02:39:15,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:39:15,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:39:15,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:39:15,760 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 02:39:15,761 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 02:39:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:39:15,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-15 02:39:15,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:39:15,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:39:15,961 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:39:16,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:39:16,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973099140] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:39:16,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:39:16,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-15 02:39:16,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112664406] [2025-03-15 02:39:16,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:39:16,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 02:39:16,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:39:16,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 02:39:16,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-15 02:39:16,083 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 274 [2025-03-15 02:39:16,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 342 transitions, 2233 flow. Second operand has 7 states, 7 states have (on average 224.0) internal successors, (1568), 7 states have internal predecessors, (1568), 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 02:39:16,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:39:16,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 274 [2025-03-15 02:39:16,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:39:22,567 INFO L124 PetriNetUnfolderBase]: 30712/48522 cut-off events. [2025-03-15 02:39:22,567 INFO L125 PetriNetUnfolderBase]: For 116736/135758 co-relation queries the response was YES. [2025-03-15 02:39:22,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315304 conditions, 48522 events. 30712/48522 cut-off events. For 116736/135758 co-relation queries the response was YES. Maximal size of possible extension queue 2526. Compared 420571 event pairs, 6867 based on Foata normal form. 4/25138 useless extension candidates. Maximal degree in co-relation 305917. Up to 35353 conditions per place. [2025-03-15 02:39:23,368 INFO L140 encePairwiseOnDemand]: 271/274 looper letters, 143 selfloop transitions, 5 changer transitions 19/432 dead transitions. [2025-03-15 02:39:23,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 432 transitions, 3790 flow [2025-03-15 02:39:23,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 02:39:23,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 02:39:23,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1482 transitions. [2025-03-15 02:39:23,371 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9014598540145985 [2025-03-15 02:39:23,371 INFO L298 CegarLoopForPetriNet]: 274 programPoint places, 21 predicate places. [2025-03-15 02:39:23,371 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 432 transitions, 3790 flow [2025-03-15 02:39:23,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 224.0) internal successors, (1568), 7 states have internal predecessors, (1568), 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 02:39:23,372 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:39:23,372 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] [2025-03-15 02:39:23,378 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 02:39:23,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:39:23,573 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:39:23,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:39:23,573 INFO L85 PathProgramCache]: Analyzing trace with hash 875966811, now seen corresponding path program 1 times [2025-03-15 02:39:23,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:39:23,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755846783] [2025-03-15 02:39:23,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:39:23,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:39:23,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:39:23,683 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 02:39:23,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:39:23,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755846783] [2025-03-15 02:39:23,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755846783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:39:23,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:39:23,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:39:23,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610142588] [2025-03-15 02:39:23,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:39:23,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:39:23,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:39:23,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:39:23,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:39:23,685 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 274 [2025-03-15 02:39:23,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 432 transitions, 3790 flow. Second operand has 6 states, 6 states have (on average 198.5) internal successors, (1191), 6 states have internal predecessors, (1191), 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 02:39:23,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:39:23,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 274 [2025-03-15 02:39:23,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:39:31,177 INFO L124 PetriNetUnfolderBase]: 31150/50594 cut-off events. [2025-03-15 02:39:31,178 INFO L125 PetriNetUnfolderBase]: For 169557/175824 co-relation queries the response was YES. [2025-03-15 02:39:31,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358482 conditions, 50594 events. 31150/50594 cut-off events. For 169557/175824 co-relation queries the response was YES. Maximal size of possible extension queue 2601. Compared 454224 event pairs, 4515 based on Foata normal form. 447/27381 useless extension candidates. Maximal degree in co-relation 340968. Up to 35964 conditions per place. [2025-03-15 02:39:31,966 INFO L140 encePairwiseOnDemand]: 254/274 looper letters, 264 selfloop transitions, 12 changer transitions 29/505 dead transitions. [2025-03-15 02:39:31,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 505 transitions, 5636 flow [2025-03-15 02:39:31,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 02:39:31,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 02:39:31,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1841 transitions. [2025-03-15 02:39:31,969 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7465531224655312 [2025-03-15 02:39:31,969 INFO L298 CegarLoopForPetriNet]: 274 programPoint places, 29 predicate places. [2025-03-15 02:39:31,969 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 505 transitions, 5636 flow [2025-03-15 02:39:31,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.5) internal successors, (1191), 6 states have internal predecessors, (1191), 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 02:39:31,970 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:39:31,970 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] [2025-03-15 02:39:31,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 02:39:31,970 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:39:31,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:39:31,971 INFO L85 PathProgramCache]: Analyzing trace with hash -2112370998, now seen corresponding path program 1 times [2025-03-15 02:39:31,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:39:31,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45385865] [2025-03-15 02:39:31,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:39:31,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:39:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:39:32,081 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 02:39:32,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:39:32,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45385865] [2025-03-15 02:39:32,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45385865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:39:32,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:39:32,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:39:32,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150369102] [2025-03-15 02:39:32,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:39:32,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:39:32,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:39:32,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:39:32,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:39:32,084 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 274 [2025-03-15 02:39:32,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 505 transitions, 5636 flow. Second operand has 6 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 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 02:39:32,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:39:32,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 274 [2025-03-15 02:39:32,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:39:40,353 INFO L124 PetriNetUnfolderBase]: 32113/52487 cut-off events. [2025-03-15 02:39:40,354 INFO L125 PetriNetUnfolderBase]: For 219512/225581 co-relation queries the response was YES. [2025-03-15 02:39:40,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407325 conditions, 52487 events. 32113/52487 cut-off events. For 219512/225581 co-relation queries the response was YES. Maximal size of possible extension queue 2609. Compared 470262 event pairs, 5203 based on Foata normal form. 340/28466 useless extension candidates. Maximal degree in co-relation 375267. Up to 37050 conditions per place. [2025-03-15 02:39:41,252 INFO L140 encePairwiseOnDemand]: 258/274 looper letters, 323 selfloop transitions, 12 changer transitions 42/577 dead transitions. [2025-03-15 02:39:41,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 577 transitions, 7400 flow [2025-03-15 02:39:41,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 02:39:41,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 02:39:41,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1857 transitions. [2025-03-15 02:39:41,255 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7530413625304136 [2025-03-15 02:39:41,256 INFO L298 CegarLoopForPetriNet]: 274 programPoint places, 37 predicate places. [2025-03-15 02:39:41,256 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 577 transitions, 7400 flow [2025-03-15 02:39:41,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 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 02:39:41,256 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:39:41,256 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] [2025-03-15 02:39:41,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 02:39:41,256 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:39:41,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:39:41,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1360093608, now seen corresponding path program 1 times [2025-03-15 02:39:41,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:39:41,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696457430] [2025-03-15 02:39:41,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:39:41,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:39:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:39:41,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:39:41,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:39:41,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696457430] [2025-03-15 02:39:41,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696457430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:39:41,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:39:41,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:39:41,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503803821] [2025-03-15 02:39:41,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:39:41,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:39:41,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:39:41,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:39:41,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:39:41,339 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 274 [2025-03-15 02:39:41,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 577 transitions, 7400 flow. Second operand has 4 states, 4 states have (on average 219.75) internal successors, (879), 4 states have internal predecessors, (879), 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 02:39:41,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:39:41,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 274 [2025-03-15 02:39:41,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:39:49,011 INFO L124 PetriNetUnfolderBase]: 27503/45728 cut-off events. [2025-03-15 02:39:49,011 INFO L125 PetriNetUnfolderBase]: For 242640/248868 co-relation queries the response was YES. [2025-03-15 02:39:49,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 383418 conditions, 45728 events. 27503/45728 cut-off events. For 242640/248868 co-relation queries the response was YES. Maximal size of possible extension queue 2293. Compared 409723 event pairs, 4540 based on Foata normal form. 0/25485 useless extension candidates. Maximal degree in co-relation 350582. Up to 31889 conditions per place. [2025-03-15 02:39:49,821 INFO L140 encePairwiseOnDemand]: 270/274 looper letters, 213 selfloop transitions, 3 changer transitions 42/571 dead transitions. [2025-03-15 02:39:49,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 571 transitions, 7760 flow [2025-03-15 02:39:49,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:39:49,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:39:49,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 905 transitions. [2025-03-15 02:39:49,823 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8257299270072993 [2025-03-15 02:39:49,824 INFO L298 CegarLoopForPetriNet]: 274 programPoint places, 39 predicate places. [2025-03-15 02:39:49,824 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 571 transitions, 7760 flow [2025-03-15 02:39:49,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 219.75) internal successors, (879), 4 states have internal predecessors, (879), 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 02:39:49,824 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:39:49,824 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] [2025-03-15 02:39:49,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 02:39:49,824 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:39:49,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:39:49,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1360093609, now seen corresponding path program 1 times [2025-03-15 02:39:49,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:39:49,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566608690] [2025-03-15 02:39:49,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:39:49,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:39:49,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:39:49,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:39:49,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:39:49,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566608690] [2025-03-15 02:39:49,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566608690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:39:49,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:39:49,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 02:39:49,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238501536] [2025-03-15 02:39:49,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:39:49,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 02:39:49,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:39:49,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 02:39:49,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-15 02:39:49,984 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 274 [2025-03-15 02:39:49,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 571 transitions, 7760 flow. Second operand has 5 states, 5 states have (on average 183.2) internal successors, (916), 5 states have internal predecessors, (916), 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 02:39:49,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:39:49,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 274 [2025-03-15 02:39:49,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:39:56,568 INFO L124 PetriNetUnfolderBase]: 22893/38983 cut-off events. [2025-03-15 02:39:56,569 INFO L125 PetriNetUnfolderBase]: For 262603/268799 co-relation queries the response was YES. [2025-03-15 02:39:56,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349373 conditions, 38983 events. 22893/38983 cut-off events. For 262603/268799 co-relation queries the response was YES. Maximal size of possible extension queue 1977. Compared 351649 event pairs, 3881 based on Foata normal form. 0/22854 useless extension candidates. Maximal degree in co-relation 315877. Up to 26730 conditions per place. [2025-03-15 02:39:57,105 INFO L140 encePairwiseOnDemand]: 264/274 looper letters, 237 selfloop transitions, 5 changer transitions 42/565 dead transitions. [2025-03-15 02:39:57,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 565 transitions, 8186 flow [2025-03-15 02:39:57,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 02:39:57,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 02:39:57,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1129 transitions. [2025-03-15 02:39:57,107 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6867396593673966 [2025-03-15 02:39:57,108 INFO L298 CegarLoopForPetriNet]: 274 programPoint places, 43 predicate places. [2025-03-15 02:39:57,108 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 565 transitions, 8186 flow [2025-03-15 02:39:57,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 183.2) internal successors, (916), 5 states have internal predecessors, (916), 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 02:39:57,108 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:39:57,108 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] [2025-03-15 02:39:57,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 02:39:57,108 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:39:57,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:39:57,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1360093611, now seen corresponding path program 1 times [2025-03-15 02:39:57,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:39:57,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047389240] [2025-03-15 02:39:57,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:39:57,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:39:57,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:39:57,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:39:57,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:39:57,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047389240] [2025-03-15 02:39:57,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047389240] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:39:57,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364832359] [2025-03-15 02:39:57,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:39:57,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:39:57,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:39:57,284 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 02:39:57,286 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 02:39:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:39:57,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-15 02:39:57,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:39:57,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:39:57,470 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 02:39:57,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364832359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:39:57,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 02:39:57,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-15 02:39:57,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962534443] [2025-03-15 02:39:57,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:39:57,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:39:57,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:39:57,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:39:57,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-15 02:39:57,471 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 274 [2025-03-15 02:39:57,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 565 transitions, 8186 flow. Second operand has 4 states, 4 states have (on average 220.5) internal successors, (882), 4 states have internal predecessors, (882), 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 02:39:57,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:39:57,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 274 [2025-03-15 02:39:57,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:40:01,961 INFO L124 PetriNetUnfolderBase]: 15987/28336 cut-off events. [2025-03-15 02:40:01,961 INFO L125 PetriNetUnfolderBase]: For 216821/222433 co-relation queries the response was YES. [2025-03-15 02:40:02,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266124 conditions, 28336 events. 15987/28336 cut-off events. For 216821/222433 co-relation queries the response was YES. Maximal size of possible extension queue 1333. Compared 254132 event pairs, 3331 based on Foata normal form. 0/18154 useless extension candidates. Maximal degree in co-relation 242745. Up to 18796 conditions per place. [2025-03-15 02:40:02,709 INFO L140 encePairwiseOnDemand]: 269/274 looper letters, 195 selfloop transitions, 3 changer transitions 42/553 dead transitions. [2025-03-15 02:40:02,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 553 transitions, 8342 flow [2025-03-15 02:40:02,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:40:02,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:40:02,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 906 transitions. [2025-03-15 02:40:02,711 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8266423357664233 [2025-03-15 02:40:02,711 INFO L298 CegarLoopForPetriNet]: 274 programPoint places, 44 predicate places. [2025-03-15 02:40:02,711 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 553 transitions, 8342 flow [2025-03-15 02:40:02,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 220.5) internal successors, (882), 4 states have internal predecessors, (882), 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 02:40:02,712 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:40:02,712 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] [2025-03-15 02:40:02,718 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 02:40:02,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:40:02,913 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:40:02,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:40:02,913 INFO L85 PathProgramCache]: Analyzing trace with hash -786769904, now seen corresponding path program 1 times [2025-03-15 02:40:02,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:40:02,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102004771] [2025-03-15 02:40:02,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:40:02,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:40:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:40:02,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:40:02,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:40:02,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102004771] [2025-03-15 02:40:02,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102004771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:40:02,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:40:02,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 02:40:02,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033691107] [2025-03-15 02:40:02,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:40:02,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 02:40:02,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:40:02,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 02:40:02,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 02:40:02,990 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 274 [2025-03-15 02:40:02,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 553 transitions, 8342 flow. Second operand has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 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 02:40:02,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:40:02,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 274 [2025-03-15 02:40:02,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:40:13,139 INFO L124 PetriNetUnfolderBase]: 30552/53118 cut-off events. [2025-03-15 02:40:13,139 INFO L125 PetriNetUnfolderBase]: For 549438/561038 co-relation queries the response was YES. [2025-03-15 02:40:13,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491585 conditions, 53118 events. 30552/53118 cut-off events. For 549438/561038 co-relation queries the response was YES. Maximal size of possible extension queue 1861. Compared 491937 event pairs, 5639 based on Foata normal form. 1/35482 useless extension candidates. Maximal degree in co-relation 437459. Up to 31831 conditions per place. [2025-03-15 02:40:13,943 INFO L140 encePairwiseOnDemand]: 270/274 looper letters, 298 selfloop transitions, 7 changer transitions 48/669 dead transitions. [2025-03-15 02:40:13,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 669 transitions, 12088 flow [2025-03-15 02:40:13,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 02:40:13,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 02:40:13,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2025-03-15 02:40:13,945 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8734793187347932 [2025-03-15 02:40:13,945 INFO L298 CegarLoopForPetriNet]: 274 programPoint places, 46 predicate places. [2025-03-15 02:40:13,945 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 669 transitions, 12088 flow [2025-03-15 02:40:13,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 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 02:40:13,946 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:40:13,946 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:40:13,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 02:40:13,946 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:40:13,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:40:13,947 INFO L85 PathProgramCache]: Analyzing trace with hash -822820540, now seen corresponding path program 1 times [2025-03-15 02:40:13,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:40:13,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28511645] [2025-03-15 02:40:13,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:40:13,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:40:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:40:14,073 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:40:14,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:40:14,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28511645] [2025-03-15 02:40:14,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28511645] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:40:14,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949491064] [2025-03-15 02:40:14,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:40:14,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:40:14,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:40:14,076 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 02:40:14,077 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 02:40:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:40:14,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-15 02:40:14,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:40:14,225 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:40:14,225 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:40:14,358 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:40:14,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949491064] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:40:14,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:40:14,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-15 02:40:14,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487992548] [2025-03-15 02:40:14,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:40:14,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-15 02:40:14,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:40:14,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-15 02:40:14,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-15 02:40:14,363 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 274 [2025-03-15 02:40:14,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 669 transitions, 12088 flow. Second operand has 24 states, 24 states have (on average 201.375) internal successors, (4833), 24 states have internal predecessors, (4833), 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 02:40:14,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:40:14,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 274 [2025-03-15 02:40:14,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:40:24,666 INFO L124 PetriNetUnfolderBase]: 30615/53731 cut-off events. [2025-03-15 02:40:24,667 INFO L125 PetriNetUnfolderBase]: For 665019/679236 co-relation queries the response was YES. [2025-03-15 02:40:24,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 526144 conditions, 53731 events. 30615/53731 cut-off events. For 665019/679236 co-relation queries the response was YES. Maximal size of possible extension queue 1834. Compared 500288 event pairs, 5376 based on Foata normal form. 1/35921 useless extension candidates. Maximal degree in co-relation 467433. Up to 32022 conditions per place. [2025-03-15 02:40:25,571 INFO L140 encePairwiseOnDemand]: 261/274 looper letters, 456 selfloop transitions, 114 changer transitions 48/813 dead transitions. [2025-03-15 02:40:25,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 813 transitions, 15166 flow [2025-03-15 02:40:25,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-15 02:40:25,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-15 02:40:25,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 6570 transitions. [2025-03-15 02:40:25,724 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.749315693430657 [2025-03-15 02:40:25,725 INFO L298 CegarLoopForPetriNet]: 274 programPoint places, 77 predicate places. [2025-03-15 02:40:25,726 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 813 transitions, 15166 flow [2025-03-15 02:40:25,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 201.375) internal successors, (4833), 24 states have internal predecessors, (4833), 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 02:40:25,727 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:40:25,727 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 02:40:25,735 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 02:40:25,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:40:25,928 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:40:25,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:40:25,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1695879958, now seen corresponding path program 1 times [2025-03-15 02:40:25,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:40:25,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306568565] [2025-03-15 02:40:25,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:40:25,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:40:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:40:26,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:40:26,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:40:26,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306568565] [2025-03-15 02:40:26,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306568565] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:40:26,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478139890] [2025-03-15 02:40:26,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:40:26,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:40:26,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:40:26,066 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 02:40:26,069 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 02:40:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:40:26,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-15 02:40:26,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:40:26,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:40:26,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:40:26,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:40:26,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478139890] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:40:26,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:40:26,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-15 02:40:26,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773237985] [2025-03-15 02:40:26,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:40:26,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 02:40:26,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:40:26,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 02:40:26,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-15 02:40:26,577 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 274 [2025-03-15 02:40:26,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 813 transitions, 15166 flow. Second operand has 7 states, 7 states have (on average 224.42857142857142) internal successors, (1571), 7 states have internal predecessors, (1571), 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 02:40:26,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:40:26,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 274 [2025-03-15 02:40:26,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:40:52,494 INFO L124 PetriNetUnfolderBase]: 65940/115239 cut-off events. [2025-03-15 02:40:52,494 INFO L125 PetriNetUnfolderBase]: For 1611635/1628929 co-relation queries the response was YES. [2025-03-15 02:40:53,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1200998 conditions, 115239 events. 65940/115239 cut-off events. For 1611635/1628929 co-relation queries the response was YES. Maximal size of possible extension queue 3740. Compared 1167467 event pairs, 7427 based on Foata normal form. 425/77751 useless extension candidates. Maximal degree in co-relation 1109131. Up to 68366 conditions per place. [2025-03-15 02:40:55,047 INFO L140 encePairwiseOnDemand]: 270/274 looper letters, 693 selfloop transitions, 49 changer transitions 66/1268 dead transitions. [2025-03-15 02:40:55,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 1268 transitions, 30488 flow [2025-03-15 02:40:55,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:40:55,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:40:55,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1696 transitions. [2025-03-15 02:40:55,049 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8842544316996872 [2025-03-15 02:40:55,050 INFO L298 CegarLoopForPetriNet]: 274 programPoint places, 83 predicate places. [2025-03-15 02:40:55,050 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 1268 transitions, 30488 flow [2025-03-15 02:40:55,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 224.42857142857142) internal successors, (1571), 7 states have internal predecessors, (1571), 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 02:40:55,051 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:40:55,051 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 02:40:55,057 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 02:40:55,251 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,SelfDestructingSolverStorable14 [2025-03-15 02:40:55,252 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:40:55,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:40:55,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1695879959, now seen corresponding path program 1 times [2025-03-15 02:40:55,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:40:55,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523828620] [2025-03-15 02:40:55,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:40:55,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:40:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:40:55,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:40:55,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:40:55,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523828620] [2025-03-15 02:40:55,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523828620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:40:55,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:40:55,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 02:40:55,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270787159] [2025-03-15 02:40:55,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:40:55,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 02:40:55,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:40:55,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 02:40:55,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 02:40:55,314 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 274 [2025-03-15 02:40:55,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 1268 transitions, 30488 flow. Second operand has 3 states, 3 states have (on average 224.0) internal successors, (672), 3 states have internal predecessors, (672), 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 02:40:55,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:40:55,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 274 [2025-03-15 02:40:55,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:41:23,320 INFO L124 PetriNetUnfolderBase]: 58768/106862 cut-off events. [2025-03-15 02:41:23,321 INFO L125 PetriNetUnfolderBase]: For 1758046/1775625 co-relation queries the response was YES. [2025-03-15 02:41:23,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150340 conditions, 106862 events. 58768/106862 cut-off events. For 1758046/1775625 co-relation queries the response was YES. Maximal size of possible extension queue 3552. Compared 1124728 event pairs, 7071 based on Foata normal form. 1/75091 useless extension candidates. Maximal degree in co-relation 1058523. Up to 72110 conditions per place. [2025-03-15 02:41:25,580 INFO L140 encePairwiseOnDemand]: 272/274 looper letters, 631 selfloop transitions, 1 changer transitions 66/1158 dead transitions. [2025-03-15 02:41:25,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 1158 transitions, 28326 flow [2025-03-15 02:41:25,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 02:41:25,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 02:41:25,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 693 transitions. [2025-03-15 02:41:25,582 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.843065693430657 [2025-03-15 02:41:25,582 INFO L298 CegarLoopForPetriNet]: 274 programPoint places, 83 predicate places. [2025-03-15 02:41:25,582 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 1158 transitions, 28326 flow [2025-03-15 02:41:25,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.0) internal successors, (672), 3 states have internal predecessors, (672), 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 02:41:25,583 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:41:25,583 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] [2025-03-15 02:41:25,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 02:41:25,583 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:41:25,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:41:25,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1612478784, now seen corresponding path program 1 times [2025-03-15 02:41:25,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:41:25,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240191798] [2025-03-15 02:41:25,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:41:25,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:41:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:41:25,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:41:25,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:41:25,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240191798] [2025-03-15 02:41:25,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240191798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:41:25,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:41:25,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 02:41:25,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483401392] [2025-03-15 02:41:25,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:41:25,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 02:41:25,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:41:25,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 02:41:25,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 02:41:25,705 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 274 [2025-03-15 02:41:25,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 1158 transitions, 28326 flow. Second operand has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 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 02:41:25,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:41:25,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 274 [2025-03-15 02:41:25,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:41:28,321 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1101] L92-->L96: Formula: (let ((.cse0 (select (select |v_#memory_int_91| v_~q1~0.base_47) (+ v_~q1~0.offset_47 (* 4 v_~q1_front~0_91)))) (.cse2 (+ |v_thread3Thread1of1ForFork3_plus_#res#1_17| 2147483648))) (let ((.cse1 (not |v_thread3_plus_#t~short37#1_202|)) (.cse3 (<= 0 .cse2)) (.cse6 (not |v_thread3_plus_#t~short38#1_208|)) (.cse4 (<= 0 .cse0)) (.cse5 (<= |v_thread3Thread1of1ForFork3_plus_#res#1_17| 2147483647))) (and (= |v_thread3Thread1of1ForFork3_plus_#res#1_17| (+ v_~total~0_150 .cse0)) (<= v_~total~0_149 2147483647) (<= 0 (+ 2147483649 v_~q1_front~0_91)) (or (and .cse1 (or (and (not |v_thread3_plus_#t~short37#1_201|) (< .cse2 0)) (and .cse3 |v_thread3_plus_#t~short37#1_201|)) (<= 0 (+ 9223372039002259455 .cse0)) (<= .cse0 9223372034707292160)) (and (= |v_thread3_plus_#t~short37#1_201| |v_thread3_plus_#t~short37#1_202|) |v_thread3_plus_#t~short37#1_202|)) (or (and .cse4 |v_thread3_plus_#t~short37#1_202|) (and .cse1 (< .cse0 0))) (= (+ v_~q1_front~0_91 1) v_~q1_front~0_90) (not (= (ite |v_thread3_plus_#t~short37#1_201| 1 0) 0)) (= v_~total~0_149 |v_thread3Thread1of1ForFork3_plus_#res#1_17|) (not (= (ite (and (< v_~q1_front~0_91 v_~q1_back~0_55) (< v_~q1_front~0_91 v_~n1~0_36) (<= 0 v_~q1_front~0_91)) 1 0) 0)) .cse3 (not (= (ite |v_thread3_plus_#t~short38#1_207| 1 0) 0)) (<= v_~q1_front~0_91 2147483646) (<= 0 (+ v_~total~0_149 2147483648)) .cse5 (or (and (<= .cse0 0) |v_thread3_plus_#t~short38#1_208|) (and .cse6 (< 0 .cse0))) (or (and (= |v_thread3_plus_#t~short38#1_207| |v_thread3_plus_#t~short38#1_208|) |v_thread3_plus_#t~short38#1_208|) (and .cse6 (<= .cse0 4294967295) .cse4 (or (and |v_thread3_plus_#t~short38#1_207| .cse5) (and (not |v_thread3_plus_#t~short38#1_207|) (< 2147483647 |v_thread3Thread1of1ForFork3_plus_#res#1_17|)))))))) InVars {~q1~0.offset=v_~q1~0.offset_47, ~q1_front~0=v_~q1_front~0_91, ~q1_back~0=v_~q1_back~0_55, ~n1~0=v_~n1~0_36, ~q1~0.base=v_~q1~0.base_47, #memory_int=|v_#memory_int_91|, ~total~0=v_~total~0_150} OutVars{~q1~0.offset=v_~q1~0.offset_47, ~q1_front~0=v_~q1_front~0_90, thread3Thread1of1ForFork3_plus_#res#1=|v_thread3Thread1of1ForFork3_plus_#res#1_17|, ~n1~0=v_~n1~0_36, thread3Thread1of1ForFork3_plus_#in~a#1=|v_thread3Thread1of1ForFork3_plus_#in~a#1_17|, thread3Thread1of1ForFork3_#t~ret10#1=|v_thread3Thread1of1ForFork3_#t~ret10#1_5|, ~total~0=v_~total~0_149, thread3Thread1of1ForFork3_#t~mem9#1=|v_thread3Thread1of1ForFork3_#t~mem9#1_17|, thread3Thread1of1ForFork3_plus_#in~b#1=|v_thread3Thread1of1ForFork3_plus_#in~b#1_17|, thread3Thread1of1ForFork3_plus_~a#1=|v_thread3Thread1of1ForFork3_plus_~a#1_17|, ~q1_back~0=v_~q1_back~0_55, thread3Thread1of1ForFork3_plus_#t~short37#1=|v_thread3Thread1of1ForFork3_plus_#t~short37#1_17|, thread3Thread1of1ForFork3_#t~post11#1=|v_thread3Thread1of1ForFork3_#t~post11#1_5|, ~q1~0.base=v_~q1~0.base_47, #memory_int=|v_#memory_int_91|, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_17|, thread3Thread1of1ForFork3_plus_#t~short38#1=|v_thread3Thread1of1ForFork3_plus_#t~short38#1_17|, thread3Thread1of1ForFork3_plus_~b#1=|v_thread3Thread1of1ForFork3_plus_~b#1_17|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_17|} AuxVars[|v_thread3_plus_#t~short37#1_202|, |v_thread3_plus_#t~short37#1_201|, |v_thread3_plus_#t~short38#1_207|, |v_thread3_plus_#t~short38#1_208|] AssignedVars[~q1_front~0, thread3Thread1of1ForFork3_plus_#res#1, thread3Thread1of1ForFork3_plus_#in~a#1, thread3Thread1of1ForFork3_#t~ret10#1, ~total~0, thread3Thread1of1ForFork3_#t~mem9#1, thread3Thread1of1ForFork3_plus_#in~b#1, thread3Thread1of1ForFork3_plus_~a#1, thread3Thread1of1ForFork3_plus_#t~short37#1, thread3Thread1of1ForFork3_#t~post11#1, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_plus_#t~short38#1, thread3Thread1of1ForFork3_plus_~b#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][537], [4833#(= ~j~0 0), 3308#true, 283#true, 157#L61true, 3827#true, 109#L96true, 591#true, thread4Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, thread1Thread1of1ForFork0InUse, 277#true, thread3Thread1of1ForFork3InUse, 2017#(= ~i~0 0), 2049#(<= 0 ~i~0), 3343#(<= ~C~0 2147483647), 73#L147-4true, 5789#true, 5788#(<= 0 (+ ~j~0 2147483648)), 38#L81true, 1214#(<= ~n1~0 2147483647), 3350#(<= 0 (+ 2147483647 ~C~0)), 3826#(= ~j~0 0), 2451#(= ~i~0 0), 35#L117true, 3324#true, 3545#(<= ~n2~0 2147483647)]) [2025-03-15 02:41:28,321 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,321 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,322 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,322 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,322 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1094] L92-->thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (let ((.cse0 (not |v_thread3Thread1of1ForFork3_plus_#t~short37#1_3|))) (and (= |v_thread3Thread1of1ForFork3_#t~mem9#1_3| (select (select |v_#memory_int_75| v_~q1~0.base_31) (+ v_~q1~0.offset_31 (* 4 v_~q1_front~0_40)))) (not (= (ite (and (<= 0 v_~q1_front~0_40) (< v_~q1_front~0_40 v_~q1_back~0_39) (< v_~q1_front~0_40 v_~n1~0_20)) 1 0) 0)) (= |v_thread3Thread1of1ForFork3_plus_#in~a#1_3| |v_thread3Thread1of1ForFork3_plus_~a#1_3|) .cse0 (or (and (<= 0 |v_thread3Thread1of1ForFork3_plus_~b#1_3|) |v_thread3Thread1of1ForFork3_plus_#t~short37#1_3|) (and (< |v_thread3Thread1of1ForFork3_plus_~b#1_3| 0) .cse0)) (= |v_thread3Thread1of1ForFork3_plus_#in~b#1_3| |v_thread3Thread1of1ForFork3_plus_~b#1_3|) (= v_~total~0_105 |v_thread3Thread1of1ForFork3_plus_#in~a#1_3|) (= |v_thread3Thread1of1ForFork3_#t~mem9#1_3| |v_thread3Thread1of1ForFork3_plus_#in~b#1_3|) (< (+ 9223372039002259455 |v_thread3Thread1of1ForFork3_plus_~b#1_3|) 0) (<= |v_thread3Thread1of1ForFork3_plus_~b#1_3| 9223372034707292160))) InVars {~q1~0.offset=v_~q1~0.offset_31, ~q1_front~0=v_~q1_front~0_40, ~q1_back~0=v_~q1_back~0_39, ~n1~0=v_~n1~0_20, ~q1~0.base=v_~q1~0.base_31, #memory_int=|v_#memory_int_75|, ~total~0=v_~total~0_105} OutVars{~q1~0.offset=v_~q1~0.offset_31, ~q1_front~0=v_~q1_front~0_40, thread3Thread1of1ForFork3_plus_#res#1=|v_thread3Thread1of1ForFork3_plus_#res#1_3|, ~n1~0=v_~n1~0_20, thread3Thread1of1ForFork3_plus_#in~a#1=|v_thread3Thread1of1ForFork3_plus_#in~a#1_3|, ~total~0=v_~total~0_105, thread3Thread1of1ForFork3_#t~mem9#1=|v_thread3Thread1of1ForFork3_#t~mem9#1_3|, thread3Thread1of1ForFork3_plus_#in~b#1=|v_thread3Thread1of1ForFork3_plus_#in~b#1_3|, thread3Thread1of1ForFork3_plus_~a#1=|v_thread3Thread1of1ForFork3_plus_~a#1_3|, ~q1_back~0=v_~q1_back~0_39, thread3Thread1of1ForFork3_plus_#t~short37#1=|v_thread3Thread1of1ForFork3_plus_#t~short37#1_3|, ~q1~0.base=v_~q1~0.base_31, #memory_int=|v_#memory_int_75|, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_3|, thread3Thread1of1ForFork3_plus_#t~short38#1=|v_thread3Thread1of1ForFork3_plus_#t~short38#1_3|, thread3Thread1of1ForFork3_plus_~b#1=|v_thread3Thread1of1ForFork3_plus_~b#1_3|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_plus_#res#1, thread3Thread1of1ForFork3_plus_#in~b#1, thread3Thread1of1ForFork3_plus_~a#1, thread3Thread1of1ForFork3_plus_#t~short37#1, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_plus_#t~short38#1, thread3Thread1of1ForFork3_plus_#in~a#1, thread3Thread1of1ForFork3_plus_~b#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork3_#t~mem9#1][538], [4833#(= ~j~0 0), 3308#true, 283#true, 157#L61true, 3827#true, 591#true, thread4Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, thread1Thread1of1ForFork0InUse, 277#true, thread3Thread1of1ForFork3InUse, 2017#(= ~i~0 0), 181#thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 2049#(<= 0 ~i~0), 3343#(<= ~C~0 2147483647), 73#L147-4true, 5789#true, 5788#(<= 0 (+ ~j~0 2147483648)), 38#L81true, 3350#(<= 0 (+ 2147483647 ~C~0)), 1214#(<= ~n1~0 2147483647), 3826#(= ~j~0 0), 2451#(= ~i~0 0), 35#L117true, 3324#true, 3545#(<= ~n2~0 2147483647)]) [2025-03-15 02:41:28,322 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,322 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,322 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,322 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,323 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1095] L92-->thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (let ((.cse1 (not |v_thread3_plus_#t~short37#1_178|)) (.cse2 (not |v_thread3Thread1of1ForFork3_plus_#t~short38#1_5|))) (and (or (and (= |v_thread3_plus_#t~short37#1_178| |v_thread3_plus_#t~short37#1_177|) |v_thread3_plus_#t~short37#1_178|) (and (<= |v_thread3Thread1of1ForFork3_plus_~b#1_5| 9223372034707292160) (let ((.cse0 (+ |v_thread3Thread1of1ForFork3_plus_~a#1_5| |v_thread3Thread1of1ForFork3_plus_~b#1_5| 2147483648))) (or (and (< .cse0 0) (not |v_thread3_plus_#t~short37#1_177|)) (and (<= 0 .cse0) |v_thread3_plus_#t~short37#1_177|))) (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork3_plus_~b#1_5|)) .cse1)) (or (and (<= 0 |v_thread3Thread1of1ForFork3_plus_~b#1_5|) |v_thread3_plus_#t~short37#1_178|) (and (< |v_thread3Thread1of1ForFork3_plus_~b#1_5| 0) .cse1)) (= (select (select |v_#memory_int_79| v_~q1~0.base_35) (+ v_~q1~0.offset_35 (* 4 v_~q1_front~0_78))) |v_thread3Thread1of1ForFork3_#t~mem9#1_5|) (or (and (<= |v_thread3Thread1of1ForFork3_plus_~b#1_5| 0) |v_thread3Thread1of1ForFork3_plus_#t~short38#1_5|) (and (< 0 |v_thread3Thread1of1ForFork3_plus_~b#1_5|) .cse2)) (not (= (ite (and (<= 0 v_~q1_front~0_78) (< v_~q1_front~0_78 v_~q1_back~0_43) (< v_~q1_front~0_78 v_~n1~0_24)) 1 0) 0)) (= v_~total~0_133 |v_thread3Thread1of1ForFork3_plus_#in~a#1_5|) (= |v_thread3Thread1of1ForFork3_plus_#in~a#1_5| |v_thread3Thread1of1ForFork3_plus_~a#1_5|) (not (= (ite |v_thread3_plus_#t~short37#1_177| 1 0) 0)) (= |v_thread3Thread1of1ForFork3_plus_#in~b#1_5| |v_thread3Thread1of1ForFork3_plus_~b#1_5|) (< 4294967295 |v_thread3Thread1of1ForFork3_plus_~b#1_5|) .cse2 (= |v_thread3Thread1of1ForFork3_#t~mem9#1_5| |v_thread3Thread1of1ForFork3_plus_#in~b#1_5|))) InVars {~q1~0.offset=v_~q1~0.offset_35, ~q1_front~0=v_~q1_front~0_78, ~q1_back~0=v_~q1_back~0_43, ~n1~0=v_~n1~0_24, ~q1~0.base=v_~q1~0.base_35, #memory_int=|v_#memory_int_79|, ~total~0=v_~total~0_133} OutVars{~q1~0.offset=v_~q1~0.offset_35, ~q1_front~0=v_~q1_front~0_78, thread3Thread1of1ForFork3_plus_#res#1=|v_thread3Thread1of1ForFork3_plus_#res#1_5|, ~n1~0=v_~n1~0_24, thread3Thread1of1ForFork3_plus_#in~a#1=|v_thread3Thread1of1ForFork3_plus_#in~a#1_5|, ~total~0=v_~total~0_133, thread3Thread1of1ForFork3_#t~mem9#1=|v_thread3Thread1of1ForFork3_#t~mem9#1_5|, thread3Thread1of1ForFork3_plus_#in~b#1=|v_thread3Thread1of1ForFork3_plus_#in~b#1_5|, thread3Thread1of1ForFork3_plus_~a#1=|v_thread3Thread1of1ForFork3_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_43, thread3Thread1of1ForFork3_plus_#t~short37#1=|v_thread3Thread1of1ForFork3_plus_#t~short37#1_5|, ~q1~0.base=v_~q1~0.base_35, #memory_int=|v_#memory_int_79|, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_5|, thread3Thread1of1ForFork3_plus_#t~short38#1=|v_thread3Thread1of1ForFork3_plus_#t~short38#1_5|, thread3Thread1of1ForFork3_plus_~b#1=|v_thread3Thread1of1ForFork3_plus_~b#1_5|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_5|} AuxVars[|v_thread3_plus_#t~short37#1_178|, |v_thread3_plus_#t~short37#1_177|] AssignedVars[thread3Thread1of1ForFork3_plus_#res#1, thread3Thread1of1ForFork3_plus_#in~b#1, thread3Thread1of1ForFork3_plus_~a#1, thread3Thread1of1ForFork3_plus_#t~short37#1, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_plus_#t~short38#1, thread3Thread1of1ForFork3_plus_#in~a#1, thread3Thread1of1ForFork3_plus_~b#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork3_#t~mem9#1][539], [4833#(= ~j~0 0), 3308#true, 283#true, 157#L61true, 3827#true, 591#true, thread4Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, thread1Thread1of1ForFork0InUse, 277#true, thread3Thread1of1ForFork3InUse, 2017#(= ~i~0 0), 46#thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 2049#(<= 0 ~i~0), 3343#(<= ~C~0 2147483647), 73#L147-4true, 5789#true, 5788#(<= 0 (+ ~j~0 2147483648)), 38#L81true, 3350#(<= 0 (+ 2147483647 ~C~0)), 1214#(<= ~n1~0 2147483647), 3826#(= ~j~0 0), 2451#(= ~i~0 0), 35#L117true, 3324#true, 3545#(<= ~n2~0 2147483647)]) [2025-03-15 02:41:28,323 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,323 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,323 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,323 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,323 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L92-->thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (let ((.cse3 (+ |v_thread3Thread1of1ForFork3_plus_~a#1_9| |v_thread3Thread1of1ForFork3_plus_~b#1_9| 2147483648))) (let ((.cse1 (not |v_thread3_plus_#t~short38#1_192|)) (.cse5 (not |v_thread3_plus_#t~short37#1_186|)) (.cse2 (<= 0 |v_thread3Thread1of1ForFork3_plus_~b#1_9|)) (.cse4 (< .cse3 0))) (and (not (= (ite |v_thread3_plus_#t~short37#1_185| 1 0) 0)) (= |v_thread3Thread1of1ForFork3_plus_#in~b#1_9| |v_thread3Thread1of1ForFork3_plus_~b#1_9|) (= |v_thread3Thread1of1ForFork3_#t~mem9#1_9| (select (select |v_#memory_int_83| v_~q1~0.base_39) (+ v_~q1~0.offset_39 (* 4 v_~q1_front~0_82)))) (not (= (ite |v_thread3_plus_#t~short38#1_191| 1 0) 0)) (or (and (let ((.cse0 (+ |v_thread3Thread1of1ForFork3_plus_~a#1_9| |v_thread3Thread1of1ForFork3_plus_~b#1_9|))) (or (and (< 2147483647 .cse0) (not |v_thread3_plus_#t~short38#1_191|)) (and (<= .cse0 2147483647) |v_thread3_plus_#t~short38#1_191|))) (<= |v_thread3Thread1of1ForFork3_plus_~b#1_9| 4294967295) .cse1 .cse2) (and (= |v_thread3_plus_#t~short38#1_191| |v_thread3_plus_#t~short38#1_192|) |v_thread3_plus_#t~short38#1_192|)) (= |v_thread3Thread1of1ForFork3_plus_#in~a#1_9| |v_thread3Thread1of1ForFork3_plus_~a#1_9|) (= |v_thread3Thread1of1ForFork3_#t~mem9#1_9| |v_thread3Thread1of1ForFork3_plus_#in~b#1_9|) (or (and (<= |v_thread3Thread1of1ForFork3_plus_~b#1_9| 0) |v_thread3_plus_#t~short38#1_192|) (and (< 0 |v_thread3Thread1of1ForFork3_plus_~b#1_9|) .cse1)) (or (and (= |v_thread3_plus_#t~short37#1_185| |v_thread3_plus_#t~short37#1_186|) |v_thread3_plus_#t~short37#1_186|) (and (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork3_plus_~b#1_9|)) (or (and (<= 0 .cse3) |v_thread3_plus_#t~short37#1_185|) (and (not |v_thread3_plus_#t~short37#1_185|) .cse4)) .cse5 (<= |v_thread3Thread1of1ForFork3_plus_~b#1_9| 9223372034707292160))) (not (= (ite (and (< v_~q1_front~0_82 v_~n1~0_28) (< v_~q1_front~0_82 v_~q1_back~0_47) (<= 0 v_~q1_front~0_82)) 1 0) 0)) (or (and (< |v_thread3Thread1of1ForFork3_plus_~b#1_9| 0) .cse5) (and .cse2 |v_thread3_plus_#t~short37#1_186|)) .cse4 (= v_~total~0_137 |v_thread3Thread1of1ForFork3_plus_#in~a#1_9|)))) InVars {~q1~0.offset=v_~q1~0.offset_39, ~q1_front~0=v_~q1_front~0_82, ~q1_back~0=v_~q1_back~0_47, ~n1~0=v_~n1~0_28, ~q1~0.base=v_~q1~0.base_39, #memory_int=|v_#memory_int_83|, ~total~0=v_~total~0_137} OutVars{~q1~0.offset=v_~q1~0.offset_39, ~q1_front~0=v_~q1_front~0_82, thread3Thread1of1ForFork3_plus_#res#1=|v_thread3Thread1of1ForFork3_plus_#res#1_9|, ~n1~0=v_~n1~0_28, thread3Thread1of1ForFork3_plus_#in~a#1=|v_thread3Thread1of1ForFork3_plus_#in~a#1_9|, ~total~0=v_~total~0_137, thread3Thread1of1ForFork3_#t~mem9#1=|v_thread3Thread1of1ForFork3_#t~mem9#1_9|, thread3Thread1of1ForFork3_plus_#in~b#1=|v_thread3Thread1of1ForFork3_plus_#in~b#1_9|, thread3Thread1of1ForFork3_plus_~a#1=|v_thread3Thread1of1ForFork3_plus_~a#1_9|, ~q1_back~0=v_~q1_back~0_47, thread3Thread1of1ForFork3_plus_#t~short37#1=|v_thread3Thread1of1ForFork3_plus_#t~short37#1_9|, ~q1~0.base=v_~q1~0.base_39, #memory_int=|v_#memory_int_83|, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_9|, thread3Thread1of1ForFork3_plus_#t~short38#1=|v_thread3Thread1of1ForFork3_plus_#t~short38#1_9|, thread3Thread1of1ForFork3_plus_~b#1=|v_thread3Thread1of1ForFork3_plus_~b#1_9|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_9|} AuxVars[|v_thread3_plus_#t~short38#1_191|, |v_thread3_plus_#t~short38#1_192|, |v_thread3_plus_#t~short37#1_185|, |v_thread3_plus_#t~short37#1_186|] AssignedVars[thread3Thread1of1ForFork3_plus_#res#1, thread3Thread1of1ForFork3_plus_#in~b#1, thread3Thread1of1ForFork3_plus_~a#1, thread3Thread1of1ForFork3_plus_#t~short37#1, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_plus_#t~short38#1, thread3Thread1of1ForFork3_plus_#in~a#1, thread3Thread1of1ForFork3_plus_~b#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork3_#t~mem9#1][540], [4833#(= ~j~0 0), 3308#true, 283#true, 104#thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 157#L61true, 3827#true, 591#true, thread4Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, thread1Thread1of1ForFork0InUse, 277#true, thread3Thread1of1ForFork3InUse, 2017#(= ~i~0 0), 2049#(<= 0 ~i~0), 3343#(<= ~C~0 2147483647), 73#L147-4true, 5789#true, 5788#(<= 0 (+ ~j~0 2147483648)), 38#L81true, 3350#(<= 0 (+ 2147483647 ~C~0)), 1214#(<= ~n1~0 2147483647), 3826#(= ~j~0 0), 2451#(= ~i~0 0), 35#L117true, 3324#true, 3545#(<= ~n2~0 2147483647)]) [2025-03-15 02:41:28,323 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,323 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,323 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,323 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,324 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1098] L92-->thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (let ((.cse4 (+ |v_thread3Thread1of1ForFork3_plus_~a#1_11| |v_thread3Thread1of1ForFork3_plus_~b#1_11| 2147483648)) (.cse6 (+ |v_thread3Thread1of1ForFork3_plus_~a#1_11| |v_thread3Thread1of1ForFork3_plus_~b#1_11|))) (let ((.cse1 (not |v_thread3_plus_#t~short37#1_190|)) (.cse2 (< 2147483647 .cse6)) (.cse0 (<= 0 |v_thread3Thread1of1ForFork3_plus_~b#1_11|)) (.cse5 (not |v_thread3_plus_#t~short38#1_196|)) (.cse3 (<= 0 .cse4))) (and (= |v_thread3Thread1of1ForFork3_#t~mem9#1_11| |v_thread3Thread1of1ForFork3_plus_#in~b#1_11|) (or (and .cse0 |v_thread3_plus_#t~short37#1_190|) (and .cse1 (< |v_thread3Thread1of1ForFork3_plus_~b#1_11| 0))) .cse2 (not (= (ite (and (< v_~q1_front~0_84 v_~n1~0_30) (<= 0 v_~q1_front~0_84) (< v_~q1_front~0_84 v_~q1_back~0_49)) 1 0) 0)) (or (and .cse1 (<= 0 (+ 9223372039002259455 |v_thread3Thread1of1ForFork3_plus_~b#1_11|)) (<= |v_thread3Thread1of1ForFork3_plus_~b#1_11| 9223372034707292160) (or (and |v_thread3_plus_#t~short37#1_189| .cse3) (and (not |v_thread3_plus_#t~short37#1_189|) (< .cse4 0)))) (and |v_thread3_plus_#t~short37#1_190| (= |v_thread3_plus_#t~short37#1_189| |v_thread3_plus_#t~short37#1_190|))) (= v_~total~0_139 |v_thread3Thread1of1ForFork3_plus_#in~a#1_11|) (not (= (ite |v_thread3_plus_#t~short37#1_189| 1 0) 0)) (= |v_thread3Thread1of1ForFork3_plus_~a#1_11| |v_thread3Thread1of1ForFork3_plus_#in~a#1_11|) (not (= (ite |v_thread3_plus_#t~short38#1_195| 1 0) 0)) (or (and (<= |v_thread3Thread1of1ForFork3_plus_~b#1_11| 0) |v_thread3_plus_#t~short38#1_196|) (and .cse5 (< 0 |v_thread3Thread1of1ForFork3_plus_~b#1_11|))) (or (and (or (and (not |v_thread3_plus_#t~short38#1_195|) .cse2) (and (<= .cse6 2147483647) |v_thread3_plus_#t~short38#1_195|)) (<= |v_thread3Thread1of1ForFork3_plus_~b#1_11| 4294967295) .cse0 .cse5) (and (= |v_thread3_plus_#t~short38#1_195| |v_thread3_plus_#t~short38#1_196|) |v_thread3_plus_#t~short38#1_196|)) (= |v_thread3Thread1of1ForFork3_plus_~b#1_11| |v_thread3Thread1of1ForFork3_plus_#in~b#1_11|) (= (select (select |v_#memory_int_85| v_~q1~0.base_41) (+ v_~q1~0.offset_41 (* 4 v_~q1_front~0_84))) |v_thread3Thread1of1ForFork3_#t~mem9#1_11|) .cse3))) InVars {~q1~0.offset=v_~q1~0.offset_41, ~q1_front~0=v_~q1_front~0_84, ~q1_back~0=v_~q1_back~0_49, ~n1~0=v_~n1~0_30, ~q1~0.base=v_~q1~0.base_41, #memory_int=|v_#memory_int_85|, ~total~0=v_~total~0_139} OutVars{~q1~0.offset=v_~q1~0.offset_41, ~q1_front~0=v_~q1_front~0_84, thread3Thread1of1ForFork3_plus_#res#1=|v_thread3Thread1of1ForFork3_plus_#res#1_11|, ~n1~0=v_~n1~0_30, thread3Thread1of1ForFork3_plus_#in~a#1=|v_thread3Thread1of1ForFork3_plus_#in~a#1_11|, ~total~0=v_~total~0_139, thread3Thread1of1ForFork3_#t~mem9#1=|v_thread3Thread1of1ForFork3_#t~mem9#1_11|, thread3Thread1of1ForFork3_plus_#in~b#1=|v_thread3Thread1of1ForFork3_plus_#in~b#1_11|, thread3Thread1of1ForFork3_plus_~a#1=|v_thread3Thread1of1ForFork3_plus_~a#1_11|, ~q1_back~0=v_~q1_back~0_49, thread3Thread1of1ForFork3_plus_#t~short37#1=|v_thread3Thread1of1ForFork3_plus_#t~short37#1_11|, ~q1~0.base=v_~q1~0.base_41, #memory_int=|v_#memory_int_85|, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_11|, thread3Thread1of1ForFork3_plus_#t~short38#1=|v_thread3Thread1of1ForFork3_plus_#t~short38#1_11|, thread3Thread1of1ForFork3_plus_~b#1=|v_thread3Thread1of1ForFork3_plus_~b#1_11|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_11|} AuxVars[|v_thread3_plus_#t~short38#1_195|, |v_thread3_plus_#t~short38#1_196|, |v_thread3_plus_#t~short37#1_189|, |v_thread3_plus_#t~short37#1_190|] AssignedVars[thread3Thread1of1ForFork3_plus_#res#1, thread3Thread1of1ForFork3_plus_#in~b#1, thread3Thread1of1ForFork3_plus_~a#1, thread3Thread1of1ForFork3_plus_#t~short37#1, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_plus_#t~short38#1, thread3Thread1of1ForFork3_plus_#in~a#1, thread3Thread1of1ForFork3_plus_~b#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork3_#t~mem9#1][541], [4833#(= ~j~0 0), 3308#true, 283#true, 157#L61true, 3827#true, 591#true, thread4Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, thread1Thread1of1ForFork0InUse, 277#true, thread3Thread1of1ForFork3InUse, 2017#(= ~i~0 0), 2049#(<= 0 ~i~0), 3343#(<= ~C~0 2147483647), 29#thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 73#L147-4true, 5789#true, 5788#(<= 0 (+ ~j~0 2147483648)), 38#L81true, 3350#(<= 0 (+ 2147483647 ~C~0)), 1214#(<= ~n1~0 2147483647), 3826#(= ~j~0 0), 2451#(= ~i~0 0), 35#L117true, 3324#true, 3545#(<= ~n2~0 2147483647)]) [2025-03-15 02:41:28,324 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,324 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,324 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,324 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,324 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1067] L52-->L55: Formula: (let ((.cse0 (not |v_thread1_#t~short2#1_74|))) (and (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (<= 0 (+ 2147483649 v_~q1_back~0_64)) (or (and .cse0 (or (< v_~q1_back~0_64 0) (<= v_~n1~0_42 v_~q1_back~0_64))) (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_42) |v_thread1_#t~short2#1_74|)) (not (= (ite |v_thread1_#t~short2#1_73| 1 0) 0)) (<= v_~q1_back~0_64 2147483646) (or (and (= |v_thread1_#t~mem1#1_52| (select (select |v_#memory_int_119| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_64)))) (let ((.cse1 (= |v_thread1_#t~mem1#1_52| v_~C~0_49))) (or (and .cse1 |v_thread1_#t~short2#1_73|) (and (not .cse1) (not |v_thread1_#t~short2#1_73|)))) |v_thread1_#t~short2#1_74|) (and .cse0 (= |v_thread1_#t~mem1#1_52| |v_thread1Thread1of1ForFork0_#t~mem1#1_5|) (= |v_thread1_#t~short2#1_73| |v_thread1_#t~short2#1_74|))))) InVars {~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_64, ~C~0=v_~C~0_49, ~n1~0=v_~n1~0_42, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_119|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread1Thread1of1ForFork0_#t~short2#1=|v_thread1Thread1of1ForFork0_#t~short2#1_5|, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_63, ~C~0=v_~C~0_49, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~n1~0=v_~n1~0_42, ~q1~0.base=v_~q1~0.base_53, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_119|} AuxVars[|v_thread1_#t~short2#1_73|, |v_thread1_#t~short2#1_74|, |v_thread1_#t~mem1#1_52|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1][561], [4833#(= ~j~0 0), 3308#true, 283#true, 3827#true, 591#true, thread4Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, thread1Thread1of1ForFork0InUse, 277#true, thread3Thread1of1ForFork3InUse, 2017#(= ~i~0 0), 226#L99true, 2049#(<= 0 ~i~0), 3343#(<= ~C~0 2147483647), 73#L147-4true, 5789#true, 5788#(<= 0 (+ ~j~0 2147483648)), 38#L81true, 57#L55true, 3350#(<= 0 (+ 2147483647 ~C~0)), 1214#(<= ~n1~0 2147483647), 3826#(= ~j~0 0), 2451#(= ~i~0 0), 35#L117true, 3324#true, 3545#(<= ~n2~0 2147483647)]) [2025-03-15 02:41:28,325 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,325 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,325 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,325 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,655 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L72-->L75: Formula: (let ((.cse0 (not |v_thread2_#t~short6#1_105|))) (and (<= v_~q2_back~0_79 2147483647) (not (= (ite |v_thread2_#t~short6#1_106| 1 0) 0)) (or (and |v_thread2_#t~short6#1_105| (<= 0 v_~q2_back~0_80) (< v_~q2_back~0_80 v_~n2~0_40)) (and .cse0 (or (< v_~q2_back~0_80 0) (<= v_~n2~0_40 v_~q2_back~0_80)))) (or (and .cse0 (= |v_thread2_#t~short6#1_105| |v_thread2_#t~short6#1_106|) (= |v_thread2Thread1of1ForFork2_#t~mem5#1_9| |v_thread2_#t~mem5#1_80|)) (and (let ((.cse1 (= (+ v_~C~0_43 |v_thread2_#t~mem5#1_80|) 0))) (or (and (not |v_thread2_#t~short6#1_106|) (not .cse1)) (and .cse1 |v_thread2_#t~short6#1_106|))) (= (select (select |v_#memory_int_113| v_~q2~0.base_63) (+ v_~q2~0.offset_63 (* v_~q2_back~0_80 4))) |v_thread2_#t~mem5#1_80|) (<= 0 (+ 2147483647 v_~C~0_43)) |v_thread2_#t~short6#1_105| (<= v_~C~0_43 2147483648))) (<= 0 (+ v_~q2_back~0_79 2147483648)) (= (+ v_~q2_back~0_80 1) v_~q2_back~0_79))) InVars {~n2~0=v_~n2~0_40, ~C~0=v_~C~0_43, ~q2~0.offset=v_~q2~0.offset_63, thread2Thread1of1ForFork2_#t~mem5#1=|v_thread2Thread1of1ForFork2_#t~mem5#1_9|, #memory_int=|v_#memory_int_113|, ~q2~0.base=v_~q2~0.base_63, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_40, ~C~0=v_~C~0_43, ~q2~0.offset=v_~q2~0.offset_63, #memory_int=|v_#memory_int_113|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_5|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2~0.base=v_~q2~0.base_63, thread2Thread1of1ForFork2_#t~short6#1=|v_thread2Thread1of1ForFork2_#t~short6#1_9|, ~q2_back~0=v_~q2_back~0_79} AuxVars[|v_thread2_#t~short6#1_106|, |v_thread2_#t~short6#1_105|, |v_thread2_#t~mem5#1_80|] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem5#1, thread2Thread1of1ForFork2_#t~post7#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~short6#1, ~q2_back~0][568], [4833#(= ~j~0 0), 3308#true, 283#true, 157#L61true, 3827#true, thread4Thread1of1ForFork1InUse, 591#true, thread2Thread1of1ForFork2InUse, thread1Thread1of1ForFork0InUse, 277#true, thread3Thread1of1ForFork3InUse, 2017#(= ~i~0 0), 226#L99true, 2049#(<= 0 ~i~0), 9#L75true, 3343#(<= ~C~0 2147483647), 73#L147-4true, 5789#true, 5788#(<= 0 (+ ~j~0 2147483648)), 1214#(<= ~n1~0 2147483647), 3350#(<= 0 (+ 2147483647 ~C~0)), 3826#(= ~j~0 0), 2451#(= ~i~0 0), 3324#true, 35#L117true, 3545#(<= ~n2~0 2147483647)]) [2025-03-15 02:41:28,655 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,655 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,655 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,655 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,666 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1117] L110-->L114: Formula: (let ((.cse2 (+ |v_thread4Thread1of1ForFork1_plus_#res#1_17| 2147483648))) (let ((.cse1 (<= 0 .cse2)) (.cse0 (<= |v_thread4Thread1of1ForFork1_plus_#res#1_17| 2147483647)) (.cse5 (not |v_thread4_plus_#t~short38#1_205|)) (.cse3 (not |v_thread4_plus_#t~short37#1_200|)) (.cse4 (<= v_~total~0_100 |v_thread4Thread1of1ForFork1_plus_#res#1_17|))) (and .cse0 (= |v_thread4Thread1of1ForFork1_plus_#res#1_17| (+ v_~total~0_100 (select (select |v_#memory_int_71| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_89))))) .cse1 (or (and (= |v_thread4_plus_#t~short37#1_200| |v_thread4_plus_#t~short37#1_199|) |v_thread4_plus_#t~short37#1_200|) (and (or (and (< .cse2 0) (not |v_thread4_plus_#t~short37#1_199|)) (and .cse1 |v_thread4_plus_#t~short37#1_199|)) (<= v_~total~0_100 (+ 9223372039002259455 |v_thread4Thread1of1ForFork1_plus_#res#1_17|)) .cse3 (<= |v_thread4Thread1of1ForFork1_plus_#res#1_17| (+ v_~total~0_100 9223372034707292160)))) (<= 0 (+ 2147483648 v_~q2_front~0_88)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (not (= (ite (and (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_30) (< v_~q2_front~0_89 v_~q2_back~0_45)) 1 0) 0)) (<= v_~q2_front~0_88 2147483647) (or (and |v_thread4_plus_#t~short38#1_205| (= |v_thread4_plus_#t~short38#1_206| |v_thread4_plus_#t~short38#1_205|)) (and (or (and (not |v_thread4_plus_#t~short38#1_206|) (< 2147483647 |v_thread4Thread1of1ForFork1_plus_#res#1_17|)) (and .cse0 |v_thread4_plus_#t~short38#1_206|)) .cse4 (<= |v_thread4Thread1of1ForFork1_plus_#res#1_17| (+ v_~total~0_100 4294967295)) .cse5)) (= v_~total~0_99 |v_thread4Thread1of1ForFork1_plus_#res#1_17|) (not (= (ite |v_thread4_plus_#t~short37#1_199| 1 0) 0)) (not (= (ite |v_thread4_plus_#t~short38#1_206| 1 0) 0)) (or (and (< v_~total~0_100 |v_thread4Thread1of1ForFork1_plus_#res#1_17|) .cse5) (and |v_thread4_plus_#t~short38#1_205| (<= |v_thread4Thread1of1ForFork1_plus_#res#1_17| v_~total~0_100))) (or (and (< |v_thread4Thread1of1ForFork1_plus_#res#1_17| v_~total~0_100) .cse3) (and .cse4 |v_thread4_plus_#t~short37#1_200|))))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_71|, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_45, ~total~0=v_~total~0_100} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_17|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_41, thread4Thread1of1ForFork1_#t~ret13#1=|v_thread4Thread1of1ForFork1_#t~ret13#1_5|, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork1_plus_#t~short38#1=|v_thread4Thread1of1ForFork1_plus_#t~short38#1_17|, thread4Thread1of1ForFork1_#t~mem12#1=|v_thread4Thread1of1ForFork1_#t~mem12#1_17|, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_17|, ~total~0=v_~total~0_99, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_17|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, #memory_int=|v_#memory_int_71|, thread4Thread1of1ForFork1_plus_#t~short37#1=|v_thread4Thread1of1ForFork1_plus_#t~short37#1_17|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_17|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_17|, ~q2~0.base=v_~q2~0.base_41, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~q2_back~0=v_~q2_back~0_45, thread4Thread1of1ForFork1_#t~post14#1=|v_thread4Thread1of1ForFork1_#t~post14#1_5|} AuxVars[|v_thread4_plus_#t~short37#1_199|, |v_thread4_plus_#t~short37#1_200|, |v_thread4_plus_#t~short38#1_206|, |v_thread4_plus_#t~short38#1_205|] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~ret13#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_#t~short38#1, thread4Thread1of1ForFork1_#t~mem12#1, thread4Thread1of1ForFork1_plus_~b#1, ~total~0, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#t~short37#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post14#1][686], [4833#(= ~j~0 0), 220#L114true, 3308#true, 283#true, 157#L61true, 3827#true, 591#true, thread4Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, thread1Thread1of1ForFork0InUse, 277#true, thread3Thread1of1ForFork3InUse, 2017#(= ~i~0 0), 226#L99true, 2049#(<= 0 ~i~0), 3343#(<= ~C~0 2147483647), 73#L147-4true, 5789#true, 5788#(<= 0 (+ ~j~0 2147483648)), 38#L81true, 3350#(<= 0 (+ 2147483647 ~C~0)), 1214#(<= ~n1~0 2147483647), 3826#(= ~j~0 0), 2451#(= ~i~0 0), 3324#true, 3545#(<= ~n2~0 2147483647)]) [2025-03-15 02:41:28,666 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,666 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,666 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,666 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,668 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1113] L110-->thread4Err4ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (let ((.cse1 (+ |v_thread4Thread1of1ForFork1_plus_~a#1_9| |v_thread4Thread1of1ForFork1_plus_~b#1_9| 2147483648))) (let ((.cse3 (not |v_thread4_plus_#t~short38#1_189|)) (.cse0 (< .cse1 0)) (.cse5 (<= 0 |v_thread4Thread1of1ForFork1_plus_~b#1_9|)) (.cse2 (not |v_thread4_plus_#t~short37#1_183|))) (and (or (and (= |v_thread4_plus_#t~short37#1_184| |v_thread4_plus_#t~short37#1_183|) |v_thread4_plus_#t~short37#1_183|) (and (<= |v_thread4Thread1of1ForFork1_plus_~b#1_9| 9223372034707292160) (<= 0 (+ |v_thread4Thread1of1ForFork1_plus_~b#1_9| 9223372039002259455)) (or (and (not |v_thread4_plus_#t~short37#1_184|) .cse0) (and (<= 0 .cse1) |v_thread4_plus_#t~short37#1_184|)) .cse2)) (not (= (ite |v_thread4_plus_#t~short38#1_190| 1 0) 0)) (or (and |v_thread4_plus_#t~short38#1_189| (<= |v_thread4Thread1of1ForFork1_plus_~b#1_9| 0)) (and .cse3 (< 0 |v_thread4Thread1of1ForFork1_plus_~b#1_9|))) (or (and .cse3 (let ((.cse4 (+ |v_thread4Thread1of1ForFork1_plus_~a#1_9| |v_thread4Thread1of1ForFork1_plus_~b#1_9|))) (or (and (not |v_thread4_plus_#t~short38#1_190|) (< 2147483647 .cse4)) (and |v_thread4_plus_#t~short38#1_190| (<= .cse4 2147483647)))) .cse5 (<= |v_thread4Thread1of1ForFork1_plus_~b#1_9| 4294967295)) (and |v_thread4_plus_#t~short38#1_189| (= |v_thread4_plus_#t~short38#1_189| |v_thread4_plus_#t~short38#1_190|))) (not (= (ite (and (< v_~q2_front~0_80 v_~q2_back~0_37) (<= 0 v_~q2_front~0_80) (< v_~q2_front~0_80 v_~n2~0_22)) 1 0) 0)) (= |v_thread4Thread1of1ForFork1_plus_#in~b#1_9| |v_thread4Thread1of1ForFork1_#t~mem12#1_9|) (= |v_thread4Thread1of1ForFork1_plus_~a#1_9| |v_thread4Thread1of1ForFork1_plus_#in~a#1_9|) (= |v_thread4Thread1of1ForFork1_plus_#in~a#1_9| v_~total~0_87) .cse0 (= |v_thread4Thread1of1ForFork1_plus_~b#1_9| |v_thread4Thread1of1ForFork1_plus_#in~b#1_9|) (= |v_thread4Thread1of1ForFork1_#t~mem12#1_9| (select (select |v_#memory_int_63| v_~q2~0.base_33) (+ v_~q2~0.offset_33 (* 4 v_~q2_front~0_80)))) (not (= (ite |v_thread4_plus_#t~short37#1_184| 1 0) 0)) (or (and .cse5 |v_thread4_plus_#t~short37#1_183|) (and (< |v_thread4Thread1of1ForFork1_plus_~b#1_9| 0) .cse2))))) InVars {~n2~0=v_~n2~0_22, ~q2~0.offset=v_~q2~0.offset_33, #memory_int=|v_#memory_int_63|, ~q2_front~0=v_~q2_front~0_80, ~q2~0.base=v_~q2~0.base_33, ~q2_back~0=v_~q2_back~0_37, ~total~0=v_~total~0_87} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_9|, ~n2~0=v_~n2~0_22, ~q2~0.offset=v_~q2~0.offset_33, ~q2_front~0=v_~q2_front~0_80, thread4Thread1of1ForFork1_plus_#t~short38#1=|v_thread4Thread1of1ForFork1_plus_#t~short38#1_9|, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_9|, thread4Thread1of1ForFork1_#t~mem12#1=|v_thread4Thread1of1ForFork1_#t~mem12#1_9|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_9|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, #memory_int=|v_#memory_int_63|, thread4Thread1of1ForFork1_plus_#t~short37#1=|v_thread4Thread1of1ForFork1_plus_#t~short37#1_9|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_9|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_9|, ~q2~0.base=v_~q2~0.base_33, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, ~q2_back~0=v_~q2_back~0_37} AuxVars[|v_thread4_plus_#t~short38#1_190|, |v_thread4_plus_#t~short38#1_189|, |v_thread4_plus_#t~short37#1_183|, |v_thread4_plus_#t~short37#1_184|] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#t~short37#1, thread4Thread1of1ForFork1_plus_~a#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_#t~short38#1, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_#t~mem12#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][684], [4833#(= ~j~0 0), 3308#true, 283#true, 157#L61true, 3827#true, thread4Thread1of1ForFork1InUse, 591#true, thread2Thread1of1ForFork2InUse, thread1Thread1of1ForFork0InUse, 277#true, thread3Thread1of1ForFork3InUse, 2017#(= ~i~0 0), 226#L99true, 2049#(<= 0 ~i~0), 3343#(<= ~C~0 2147483647), 73#L147-4true, 5789#true, 5788#(<= 0 (+ ~j~0 2147483648)), 38#L81true, 1214#(<= ~n1~0 2147483647), 3350#(<= 0 (+ 2147483647 ~C~0)), 3826#(= ~j~0 0), 2451#(= ~i~0 0), 3324#true, 3545#(<= ~n2~0 2147483647), 55#thread4Err4ASSERT_VIOLATIONINTEGER_OVERFLOWtrue]) [2025-03-15 02:41:28,668 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,668 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,668 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,668 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,669 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1114] L110-->thread4Err5ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (let ((.cse6 (+ |v_thread4Thread1of1ForFork1_plus_~a#1_11| |v_thread4Thread1of1ForFork1_plus_~b#1_11|)) (.cse4 (+ |v_thread4Thread1of1ForFork1_plus_~a#1_11| |v_thread4Thread1of1ForFork1_plus_~b#1_11| 2147483648))) (let ((.cse2 (<= 0 .cse4)) (.cse0 (not |v_thread4_plus_#t~short37#1_187|)) (.cse1 (<= 0 |v_thread4Thread1of1ForFork1_plus_~b#1_11|)) (.cse5 (< 2147483647 .cse6)) (.cse3 (not |v_thread4_plus_#t~short38#1_193|))) (and (= |v_thread4Thread1of1ForFork1_plus_~b#1_11| |v_thread4Thread1of1ForFork1_plus_#in~b#1_11|) (or (and .cse0 (< |v_thread4Thread1of1ForFork1_plus_~b#1_11| 0)) (and .cse1 |v_thread4_plus_#t~short37#1_187|)) .cse2 (= (select (select |v_#memory_int_65| v_~q2~0.base_35) (+ v_~q2~0.offset_35 (* 4 v_~q2_front~0_82))) |v_thread4Thread1of1ForFork1_#t~mem12#1_11|) (= v_~total~0_89 |v_thread4Thread1of1ForFork1_plus_#in~a#1_11|) (or (and (< 0 |v_thread4Thread1of1ForFork1_plus_~b#1_11|) .cse3) (and |v_thread4_plus_#t~short38#1_193| (<= |v_thread4Thread1of1ForFork1_plus_~b#1_11| 0))) (or (and (= |v_thread4_plus_#t~short37#1_188| |v_thread4_plus_#t~short37#1_187|) |v_thread4_plus_#t~short37#1_187|) (and (or (and (not |v_thread4_plus_#t~short37#1_188|) (< .cse4 0)) (and .cse2 |v_thread4_plus_#t~short37#1_188|)) .cse0 (<= |v_thread4Thread1of1ForFork1_plus_~b#1_11| 9223372034707292160) (<= 0 (+ 9223372039002259455 |v_thread4Thread1of1ForFork1_plus_~b#1_11|)))) (not (= (ite (and (<= 0 v_~q2_front~0_82) (< v_~q2_front~0_82 v_~q2_back~0_39) (< v_~q2_front~0_82 v_~n2~0_24)) 1 0) 0)) .cse5 (= |v_thread4Thread1of1ForFork1_plus_~a#1_11| |v_thread4Thread1of1ForFork1_plus_#in~a#1_11|) (or (and |v_thread4_plus_#t~short38#1_193| (= |v_thread4_plus_#t~short38#1_194| |v_thread4_plus_#t~short38#1_193|)) (and (<= |v_thread4Thread1of1ForFork1_plus_~b#1_11| 4294967295) .cse1 (or (and .cse5 (not |v_thread4_plus_#t~short38#1_194|)) (and |v_thread4_plus_#t~short38#1_194| (<= .cse6 2147483647))) .cse3)) (= |v_thread4Thread1of1ForFork1_#t~mem12#1_11| |v_thread4Thread1of1ForFork1_plus_#in~b#1_11|) (not (= (ite |v_thread4_plus_#t~short38#1_194| 1 0) 0)) (not (= (ite |v_thread4_plus_#t~short37#1_188| 1 0) 0))))) InVars {~n2~0=v_~n2~0_24, ~q2~0.offset=v_~q2~0.offset_35, #memory_int=|v_#memory_int_65|, ~q2_front~0=v_~q2_front~0_82, ~q2~0.base=v_~q2~0.base_35, ~q2_back~0=v_~q2_back~0_39, ~total~0=v_~total~0_89} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_11|, ~n2~0=v_~n2~0_24, ~q2~0.offset=v_~q2~0.offset_35, ~q2_front~0=v_~q2_front~0_82, thread4Thread1of1ForFork1_plus_#t~short38#1=|v_thread4Thread1of1ForFork1_plus_#t~short38#1_11|, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_11|, thread4Thread1of1ForFork1_#t~mem12#1=|v_thread4Thread1of1ForFork1_#t~mem12#1_11|, ~total~0=v_~total~0_89, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_11|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|, #memory_int=|v_#memory_int_65|, thread4Thread1of1ForFork1_plus_#t~short37#1=|v_thread4Thread1of1ForFork1_plus_#t~short37#1_11|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_11|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_11|, ~q2~0.base=v_~q2~0.base_35, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_11|, ~q2_back~0=v_~q2_back~0_39} AuxVars[|v_thread4_plus_#t~short38#1_194|, |v_thread4_plus_#t~short37#1_187|, |v_thread4_plus_#t~short37#1_188|, |v_thread4_plus_#t~short38#1_193|] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#t~short37#1, thread4Thread1of1ForFork1_plus_~a#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_#t~short38#1, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_#t~mem12#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][685], [4833#(= ~j~0 0), 3308#true, 283#true, 157#L61true, 3827#true, thread4Thread1of1ForFork1InUse, 591#true, thread2Thread1of1ForFork2InUse, thread1Thread1of1ForFork0InUse, 277#true, thread3Thread1of1ForFork3InUse, 2017#(= ~i~0 0), 226#L99true, 2049#(<= 0 ~i~0), 3343#(<= ~C~0 2147483647), 73#L147-4true, 5789#true, 5788#(<= 0 (+ ~j~0 2147483648)), 10#thread4Err5ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 38#L81true, 1214#(<= ~n1~0 2147483647), 3350#(<= 0 (+ 2147483647 ~C~0)), 3826#(= ~j~0 0), 2451#(= ~i~0 0), 3324#true, 3545#(<= ~n2~0 2147483647)]) [2025-03-15 02:41:28,669 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,669 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,669 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,669 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,671 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1110] L110-->thread4Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (let ((.cse0 (not |v_thread4Thread1of1ForFork1_plus_#t~short37#1_3|))) (and (= |v_thread4Thread1of1ForFork1_plus_~b#1_3| |v_thread4Thread1of1ForFork1_plus_#in~b#1_3|) (= |v_thread4Thread1of1ForFork1_plus_#in~a#1_3| v_~total~0_55) (< (+ |v_thread4Thread1of1ForFork1_plus_~b#1_3| 9223372039002259455) 0) (or (and .cse0 (< |v_thread4Thread1of1ForFork1_plus_~b#1_3| 0)) (and (<= 0 |v_thread4Thread1of1ForFork1_plus_~b#1_3|) |v_thread4Thread1of1ForFork1_plus_#t~short37#1_3|)) (= |v_thread4Thread1of1ForFork1_plus_~a#1_3| |v_thread4Thread1of1ForFork1_plus_#in~a#1_3|) (not (= (ite (and (<= 0 v_~q2_front~0_38) (< v_~q2_front~0_38 v_~n2~0_14) (< v_~q2_front~0_38 v_~q2_back~0_29)) 1 0) 0)) .cse0 (= |v_thread4Thread1of1ForFork1_#t~mem12#1_3| (select (select |v_#memory_int_55| v_~q2~0.base_25) (+ v_~q2~0.offset_25 (* 4 v_~q2_front~0_38)))) (= |v_thread4Thread1of1ForFork1_plus_#in~b#1_3| |v_thread4Thread1of1ForFork1_#t~mem12#1_3|) (<= |v_thread4Thread1of1ForFork1_plus_~b#1_3| 9223372034707292160))) InVars {~n2~0=v_~n2~0_14, ~q2~0.offset=v_~q2~0.offset_25, #memory_int=|v_#memory_int_55|, ~q2_front~0=v_~q2_front~0_38, ~q2~0.base=v_~q2~0.base_25, ~q2_back~0=v_~q2_back~0_29, ~total~0=v_~total~0_55} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_3|, ~n2~0=v_~n2~0_14, ~q2~0.offset=v_~q2~0.offset_25, ~q2_front~0=v_~q2_front~0_38, thread4Thread1of1ForFork1_plus_#t~short38#1=|v_thread4Thread1of1ForFork1_plus_#t~short38#1_3|, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_3|, thread4Thread1of1ForFork1_#t~mem12#1=|v_thread4Thread1of1ForFork1_#t~mem12#1_3|, ~total~0=v_~total~0_55, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_3|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|, #memory_int=|v_#memory_int_55|, thread4Thread1of1ForFork1_plus_#t~short37#1=|v_thread4Thread1of1ForFork1_plus_#t~short37#1_3|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_3|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_3|, ~q2~0.base=v_~q2~0.base_25, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|, ~q2_back~0=v_~q2_back~0_29} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#t~short37#1, thread4Thread1of1ForFork1_plus_~a#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_#t~short38#1, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_#t~mem12#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][687], [4833#(= ~j~0 0), 18#thread4Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 3308#true, 283#true, 157#L61true, 3827#true, thread4Thread1of1ForFork1InUse, 591#true, thread2Thread1of1ForFork2InUse, thread1Thread1of1ForFork0InUse, 277#true, thread3Thread1of1ForFork3InUse, 2017#(= ~i~0 0), 226#L99true, 2049#(<= 0 ~i~0), 3343#(<= ~C~0 2147483647), 73#L147-4true, 5789#true, 5788#(<= 0 (+ ~j~0 2147483648)), 38#L81true, 1214#(<= ~n1~0 2147483647), 3350#(<= 0 (+ 2147483647 ~C~0)), 3826#(= ~j~0 0), 2451#(= ~i~0 0), 3324#true, 3545#(<= ~n2~0 2147483647)]) [2025-03-15 02:41:28,671 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,672 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,672 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,672 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,673 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1111] L110-->thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (let ((.cse2 (not |v_thread4_plus_#t~short37#1_175|)) (.cse0 (not |v_thread4Thread1of1ForFork1_plus_#t~short38#1_5|))) (and (not (= (ite (and (<= 0 v_~q2_front~0_76) (< v_~q2_front~0_76 v_~q2_back~0_33) (< v_~q2_front~0_76 v_~n2~0_18)) 1 0) 0)) (= |v_thread4Thread1of1ForFork1_plus_#in~b#1_5| |v_thread4Thread1of1ForFork1_#t~mem12#1_5|) (or (and |v_thread4Thread1of1ForFork1_plus_#t~short38#1_5| (<= |v_thread4Thread1of1ForFork1_plus_~b#1_5| 0)) (and (< 0 |v_thread4Thread1of1ForFork1_plus_~b#1_5|) .cse0)) (= |v_thread4Thread1of1ForFork1_plus_~a#1_5| |v_thread4Thread1of1ForFork1_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork1_#t~mem12#1_5| (select (select |v_#memory_int_59| v_~q2~0.base_29) (+ v_~q2~0.offset_29 (* 4 v_~q2_front~0_76)))) (not (= (ite |v_thread4_plus_#t~short37#1_176| 1 0) 0)) (or (and (let ((.cse1 (+ |v_thread4Thread1of1ForFork1_plus_~a#1_5| |v_thread4Thread1of1ForFork1_plus_~b#1_5| 2147483648))) (or (and (<= 0 .cse1) |v_thread4_plus_#t~short37#1_176|) (and (not |v_thread4_plus_#t~short37#1_176|) (< .cse1 0)))) (<= 0 (+ |v_thread4Thread1of1ForFork1_plus_~b#1_5| 9223372039002259455)) .cse2 (<= |v_thread4Thread1of1ForFork1_plus_~b#1_5| 9223372034707292160)) (and (= |v_thread4_plus_#t~short37#1_175| |v_thread4_plus_#t~short37#1_176|) |v_thread4_plus_#t~short37#1_175|)) (or (and (<= 0 |v_thread4Thread1of1ForFork1_plus_~b#1_5|) |v_thread4_plus_#t~short37#1_175|) (and (< |v_thread4Thread1of1ForFork1_plus_~b#1_5| 0) .cse2)) (= |v_thread4Thread1of1ForFork1_plus_~b#1_5| |v_thread4Thread1of1ForFork1_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork1_plus_#in~a#1_5| v_~total~0_83) (< 4294967295 |v_thread4Thread1of1ForFork1_plus_~b#1_5|) .cse0)) InVars {~n2~0=v_~n2~0_18, ~q2~0.offset=v_~q2~0.offset_29, #memory_int=|v_#memory_int_59|, ~q2_front~0=v_~q2_front~0_76, ~q2~0.base=v_~q2~0.base_29, ~q2_back~0=v_~q2_back~0_33, ~total~0=v_~total~0_83} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_5|, ~n2~0=v_~n2~0_18, ~q2~0.offset=v_~q2~0.offset_29, ~q2_front~0=v_~q2_front~0_76, thread4Thread1of1ForFork1_plus_#t~short38#1=|v_thread4Thread1of1ForFork1_plus_#t~short38#1_5|, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_5|, thread4Thread1of1ForFork1_#t~mem12#1=|v_thread4Thread1of1ForFork1_#t~mem12#1_5|, ~total~0=v_~total~0_83, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_5|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, #memory_int=|v_#memory_int_59|, thread4Thread1of1ForFork1_plus_#t~short37#1=|v_thread4Thread1of1ForFork1_plus_#t~short37#1_5|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_5|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_29, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, ~q2_back~0=v_~q2_back~0_33} AuxVars[|v_thread4_plus_#t~short37#1_175|, |v_thread4_plus_#t~short37#1_176|] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#t~short37#1, thread4Thread1of1ForFork1_plus_~a#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_#t~short38#1, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_#t~mem12#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][688], [4833#(= ~j~0 0), 3308#true, 283#true, 157#L61true, 3827#true, thread4Thread1of1ForFork1InUse, 591#true, thread2Thread1of1ForFork2InUse, thread1Thread1of1ForFork0InUse, 277#true, thread3Thread1of1ForFork3InUse, 2017#(= ~i~0 0), 226#L99true, 2049#(<= 0 ~i~0), 3343#(<= ~C~0 2147483647), 73#L147-4true, 5789#true, 5788#(<= 0 (+ ~j~0 2147483648)), 215#thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 38#L81true, 3350#(<= 0 (+ 2147483647 ~C~0)), 1214#(<= ~n1~0 2147483647), 3826#(= ~j~0 0), 2451#(= ~i~0 0), 3324#true, 3545#(<= ~n2~0 2147483647)]) [2025-03-15 02:41:28,673 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,673 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,673 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:28,673 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 02:41:29,998 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1128] thread1EXIT-->L148-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][733], [4833#(= ~j~0 0), 3308#true, 283#true, 3827#true, 591#true, thread4Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, thread1Thread1of1ForFork0NotInUse, 277#true, thread3Thread1of1ForFork3InUse, 2017#(= ~i~0 0), 226#L99true, 2049#(<= 0 ~i~0), 228#L148-1true, 3343#(<= ~C~0 2147483647), 5789#true, 5788#(<= 0 (+ ~j~0 2147483648)), 38#L81true, 1214#(<= ~n1~0 2147483647), 3350#(<= 0 (+ 2147483647 ~C~0)), 3826#(= ~j~0 0), 2451#(= ~i~0 0), 35#L117true, 3324#true, 3545#(<= ~n2~0 2147483647)]) [2025-03-15 02:41:29,999 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is cut-off event [2025-03-15 02:41:29,999 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-03-15 02:41:29,999 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-03-15 02:41:29,999 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-03-15 02:42:02,391 INFO L124 PetriNetUnfolderBase]: 79075/129988 cut-off events. [2025-03-15 02:42:02,392 INFO L125 PetriNetUnfolderBase]: For 1760801/1791951 co-relation queries the response was YES. [2025-03-15 02:42:03,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1610333 conditions, 129988 events. 79075/129988 cut-off events. For 1760801/1791951 co-relation queries the response was YES. Maximal size of possible extension queue 3923. Compared 1233849 event pairs, 17768 based on Foata normal form. 34/91754 useless extension candidates. Maximal degree in co-relation 1415740. Up to 95530 conditions per place. [2025-03-15 02:42:05,805 INFO L140 encePairwiseOnDemand]: 267/274 looper letters, 998 selfloop transitions, 61 changer transitions 107/1641 dead transitions. [2025-03-15 02:42:05,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 1641 transitions, 47526 flow [2025-03-15 02:42:05,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 02:42:05,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 02:42:05,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 720 transitions. [2025-03-15 02:42:05,806 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8759124087591241 [2025-03-15 02:42:05,807 INFO L298 CegarLoopForPetriNet]: 274 programPoint places, 85 predicate places. [2025-03-15 02:42:05,807 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 1641 transitions, 47526 flow [2025-03-15 02:42:05,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 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 02:42:05,807 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:42:05,808 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] [2025-03-15 02:42:05,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 02:42:05,808 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:42:05,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:42:05,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1612478787, now seen corresponding path program 1 times [2025-03-15 02:42:05,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:42:05,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514035479] [2025-03-15 02:42:05,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:42:05,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:42:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:42:05,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:42:05,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:42:05,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514035479] [2025-03-15 02:42:05,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514035479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:42:05,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:42:05,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 02:42:05,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893777996] [2025-03-15 02:42:05,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:42:05,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 02:42:05,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:42:05,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 02:42:05,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-15 02:42:05,945 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 274 [2025-03-15 02:42:05,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 1641 transitions, 47526 flow. Second operand has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 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 02:42:05,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:42:05,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 274 [2025-03-15 02:42:05,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:42:45,448 INFO L124 PetriNetUnfolderBase]: 70415/115992 cut-off events. [2025-03-15 02:42:45,449 INFO L125 PetriNetUnfolderBase]: For 1720144/1747024 co-relation queries the response was YES. [2025-03-15 02:42:46,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1515909 conditions, 115992 events. 70415/115992 cut-off events. For 1720144/1747024 co-relation queries the response was YES. Maximal size of possible extension queue 3612. Compared 1092179 event pairs, 14935 based on Foata normal form. 605/83090 useless extension candidates. Maximal degree in co-relation 1220501. Up to 85266 conditions per place. [2025-03-15 02:42:48,499 INFO L140 encePairwiseOnDemand]: 259/274 looper letters, 1168 selfloop transitions, 14 changer transitions 115/1721 dead transitions. [2025-03-15 02:42:48,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 1721 transitions, 52740 flow [2025-03-15 02:42:48,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 02:42:48,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 02:42:48,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1134 transitions. [2025-03-15 02:42:48,501 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6897810218978102 [2025-03-15 02:42:48,501 INFO L298 CegarLoopForPetriNet]: 274 programPoint places, 90 predicate places. [2025-03-15 02:42:48,501 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 1721 transitions, 52740 flow [2025-03-15 02:42:48,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 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 02:42:48,502 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:42:48,502 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] [2025-03-15 02:42:48,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 02:42:48,502 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:42:48,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:42:48,503 INFO L85 PathProgramCache]: Analyzing trace with hash 743702946, now seen corresponding path program 1 times [2025-03-15 02:42:48,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:42:48,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996916571] [2025-03-15 02:42:48,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:42:48,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:42:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:42:49,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:42:49,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:42:49,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996916571] [2025-03-15 02:42:49,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996916571] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:42:49,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328312859] [2025-03-15 02:42:49,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:42:49,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:42:49,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:42:49,062 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 02:42:49,063 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 02:42:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:42:49,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-15 02:42:49,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:42:49,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:42:49,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:42:49,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 02:42:49,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2025-03-15 02:42:50,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:42:50,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328312859] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:42:50,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:42:50,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 10] total 29 [2025-03-15 02:42:50,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214729053] [2025-03-15 02:42:50,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:42:50,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-15 02:42:50,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:42:50,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-15 02:42:50,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=716, Unknown=0, NotChecked=0, Total=870 [2025-03-15 02:42:50,423 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 274 [2025-03-15 02:42:50,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 1721 transitions, 52740 flow. Second operand has 30 states, 30 states have (on average 159.36666666666667) internal successors, (4781), 30 states have internal predecessors, (4781), 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 02:42:50,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:42:50,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 274 [2025-03-15 02:42:50,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:44:10,669 INFO L124 PetriNetUnfolderBase]: 126873/209271 cut-off events. [2025-03-15 02:44:10,670 INFO L125 PetriNetUnfolderBase]: For 3424635/3491787 co-relation queries the response was YES. [2025-03-15 02:44:12,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2864264 conditions, 209271 events. 126873/209271 cut-off events. For 3424635/3491787 co-relation queries the response was YES. Maximal size of possible extension queue 6007. Compared 2101138 event pairs, 26369 based on Foata normal form. 77/150361 useless extension candidates. Maximal degree in co-relation 1400574. Up to 152864 conditions per place. [2025-03-15 02:44:16,680 INFO L140 encePairwiseOnDemand]: 244/274 looper letters, 2477 selfloop transitions, 86 changer transitions 185/2893 dead transitions. [2025-03-15 02:44:16,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 2893 transitions, 100332 flow [2025-03-15 02:44:16,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-15 02:44:16,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-15 02:44:16,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 5425 transitions. [2025-03-15 02:44:16,685 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5823314727350795 [2025-03-15 02:44:16,685 INFO L298 CegarLoopForPetriNet]: 274 programPoint places, 123 predicate places. [2025-03-15 02:44:16,685 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 2893 transitions, 100332 flow [2025-03-15 02:44:16,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 159.36666666666667) internal successors, (4781), 30 states have internal predecessors, (4781), 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 02:44:16,687 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:44:16,687 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] [2025-03-15 02:44:16,701 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 02:44:16,887 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 02:44:16,888 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:44:16,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:44:16,889 INFO L85 PathProgramCache]: Analyzing trace with hash 743702947, now seen corresponding path program 1 times [2025-03-15 02:44:16,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:44:16,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425354191] [2025-03-15 02:44:16,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:44:16,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:44:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:44:17,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:44:17,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:44:17,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425354191] [2025-03-15 02:44:17,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425354191] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:44:17,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303730154] [2025-03-15 02:44:17,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:44:17,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:44:17,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:44:17,871 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 02:44:17,875 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 02:44:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:44:18,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-15 02:44:18,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:44:18,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:44:18,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:44:18,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 02:44:18,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 16 [2025-03-15 02:44:19,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:44:19,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303730154] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:44:19,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:44:19,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 10] total 29 [2025-03-15 02:44:19,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432805168] [2025-03-15 02:44:19,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:44:19,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-15 02:44:19,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:44:19,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-15 02:44:19,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=716, Unknown=0, NotChecked=0, Total=870 [2025-03-15 02:44:19,577 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 274 [2025-03-15 02:44:19,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 2893 transitions, 100332 flow. Second operand has 30 states, 30 states have (on average 159.36666666666667) internal successors, (4781), 30 states have internal predecessors, (4781), 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 02:44:19,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:44:19,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 274 [2025-03-15 02:44:19,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:46:04,714 INFO L124 PetriNetUnfolderBase]: 115313/192248 cut-off events. [2025-03-15 02:46:04,714 INFO L125 PetriNetUnfolderBase]: For 3559526/3624099 co-relation queries the response was YES. [2025-03-15 02:46:06,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2725964 conditions, 192248 events. 115313/192248 cut-off events. For 3559526/3624099 co-relation queries the response was YES. Maximal size of possible extension queue 5470. Compared 1931500 event pairs, 24119 based on Foata normal form. 61/139971 useless extension candidates. Maximal degree in co-relation 1531610. Up to 138074 conditions per place. [2025-03-15 02:46:10,540 INFO L140 encePairwiseOnDemand]: 244/274 looper letters, 2417 selfloop transitions, 86 changer transitions 185/2833 dead transitions. [2025-03-15 02:46:10,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 2833 transitions, 103262 flow [2025-03-15 02:46:10,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-15 02:46:10,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-15 02:46:10,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 5424 transitions. [2025-03-15 02:46:10,543 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5822241305281236 [2025-03-15 02:46:10,544 INFO L298 CegarLoopForPetriNet]: 274 programPoint places, 156 predicate places. [2025-03-15 02:46:10,544 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 2833 transitions, 103262 flow [2025-03-15 02:46:10,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 159.36666666666667) internal successors, (4781), 30 states have internal predecessors, (4781), 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 02:46:10,546 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:46:10,546 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:46:10,552 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 02:46:10,747 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 02:46:10,747 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:46:10,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:46:10,748 INFO L85 PathProgramCache]: Analyzing trace with hash 810118011, now seen corresponding path program 1 times [2025-03-15 02:46:10,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:46:10,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543635422] [2025-03-15 02:46:10,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:46:10,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:46:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:46:10,839 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:46:10,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:46:10,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543635422] [2025-03-15 02:46:10,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543635422] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:46:10,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753623477] [2025-03-15 02:46:10,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:46:10,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:46:10,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:46:10,842 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 02:46:10,843 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 02:46:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:46:10,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-15 02:46:10,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:46:11,071 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:46:11,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:46:11,227 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:46:11,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753623477] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:46:11,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:46:11,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-15 02:46:11,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711609531] [2025-03-15 02:46:11,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:46:11,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 02:46:11,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:46:11,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 02:46:11,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-15 02:46:11,229 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 274 [2025-03-15 02:46:11,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 2833 transitions, 103262 flow. Second operand has 13 states, 13 states have (on average 224.0) internal successors, (2912), 13 states have internal predecessors, (2912), 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 02:46:11,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:46:11,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 274 [2025-03-15 02:46:11,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand