/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/chl-node-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 02:28:04,651 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 02:28:04,722 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:28:04,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 02:28:04,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 02:28:04,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 02:28:04,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 02:28:04,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 02:28:04,781 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 02:28:04,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 02:28:04,781 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 02:28:04,782 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 02:28:04,782 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 02:28:04,782 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 02:28:04,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 02:28:04,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 02:28:04,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 02:28:04,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 02:28:04,782 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 02:28:04,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 02:28:04,782 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 02:28:04,782 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 02:28:04,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 02:28:04,783 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 02:28:04,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 02:28:04,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 02:28:04,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 02:28:04,783 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 02:28:04,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 02:28:04,783 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 02:28:04,783 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 02:28:04,783 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 02:28:04,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:28:05,067 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 02:28:05,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 02:28:05,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 02:28:05,078 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 02:28:05,078 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 02:28:05,079 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-node-subst.wvr.c [2025-03-15 02:28:06,273 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5dbccb17/8107ae3ff6f949edbb575ca47fd9d48e/FLAG2bfaf01d6 [2025-03-15 02:28:06,427 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 02:28:06,427 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-subst.wvr.c [2025-03-15 02:28:06,434 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5dbccb17/8107ae3ff6f949edbb575ca47fd9d48e/FLAG2bfaf01d6 [2025-03-15 02:28:06,447 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5dbccb17/8107ae3ff6f949edbb575ca47fd9d48e [2025-03-15 02:28:06,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 02:28:06,450 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 02:28:06,451 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 02:28:06,451 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 02:28:06,455 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 02:28:06,455 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:28:06" (1/1) ... [2025-03-15 02:28:06,456 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47d78665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:28:06, skipping insertion in model container [2025-03-15 02:28:06,456 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:28:06" (1/1) ... [2025-03-15 02:28:06,471 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 02:28:06,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 02:28:06,645 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 02:28:06,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 02:28:06,700 INFO L204 MainTranslator]: Completed translation [2025-03-15 02:28:06,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:28:06 WrapperNode [2025-03-15 02:28:06,702 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 02:28:06,703 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 02:28:06,704 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 02:28:06,704 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 02:28:06,708 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:28:06" (1/1) ... [2025-03-15 02:28:06,721 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:28:06" (1/1) ... [2025-03-15 02:28:06,755 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 23, calls inlined = 35, statements flattened = 474 [2025-03-15 02:28:06,756 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 02:28:06,756 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 02:28:06,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 02:28:06,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 02:28:06,765 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:28:06" (1/1) ... [2025-03-15 02:28:06,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:28:06" (1/1) ... [2025-03-15 02:28:06,772 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:28:06" (1/1) ... [2025-03-15 02:28:06,772 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:28:06" (1/1) ... [2025-03-15 02:28:06,787 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:28:06" (1/1) ... [2025-03-15 02:28:06,793 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:28:06" (1/1) ... [2025-03-15 02:28:06,800 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:28:06" (1/1) ... [2025-03-15 02:28:06,802 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:28:06" (1/1) ... [2025-03-15 02:28:06,803 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:28:06" (1/1) ... [2025-03-15 02:28:06,812 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 02:28:06,813 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 02:28:06,813 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 02:28:06,813 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 02:28:06,814 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:28:06" (1/1) ... [2025-03-15 02:28:06,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 02:28:06,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:28:06,851 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:28:06,853 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:28:06,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 02:28:06,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 02:28:06,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 02:28:06,875 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 02:28:06,875 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 02:28:06,875 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 02:28:06,876 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 02:28:06,876 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-15 02:28:06,876 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-15 02:28:06,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 02:28:06,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 02:28:06,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 02:28:06,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 02:28:06,877 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:28:06,973 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 02:28:06,975 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 02:28:07,619 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 02:28:07,619 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 02:28:07,651 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 02:28:07,651 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 02:28:07,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:28:07 BoogieIcfgContainer [2025-03-15 02:28:07,652 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 02:28:07,656 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 02:28:07,656 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 02:28:07,660 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 02:28:07,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 02:28:06" (1/3) ... [2025-03-15 02:28:07,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec4f8e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:28:07, skipping insertion in model container [2025-03-15 02:28:07,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:28:06" (2/3) ... [2025-03-15 02:28:07,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec4f8e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:28:07, skipping insertion in model container [2025-03-15 02:28:07,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:28:07" (3/3) ... [2025-03-15 02:28:07,663 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-subst.wvr.c [2025-03-15 02:28:07,677 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 02:28:07,679 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-subst.wvr.c that has 4 procedures, 628 locations, 1 initial locations, 6 loop locations, and 42 error locations. [2025-03-15 02:28:07,679 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 02:28:07,818 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-15 02:28:07,882 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 02:28:07,896 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;@480518f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 02:28:07,896 INFO L334 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2025-03-15 02:28:07,948 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 02:28:07,949 INFO L124 PetriNetUnfolderBase]: 4/109 cut-off events. [2025-03-15 02:28:07,954 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 02:28:07,954 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:07,955 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] [2025-03-15 02:28:07,955 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-15 02:28:07,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:07,967 INFO L85 PathProgramCache]: Analyzing trace with hash -116475095, now seen corresponding path program 1 times [2025-03-15 02:28:07,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:07,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410795279] [2025-03-15 02:28:07,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:07,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:08,332 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:28:08,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:08,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410795279] [2025-03-15 02:28:08,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410795279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:28:08,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:28:08,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:28:08,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604184458] [2025-03-15 02:28:08,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:28:08,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:28:08,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:08,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:28:08,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:28:08,375 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 668 [2025-03-15 02:28:08,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 637 places, 668 transitions, 1357 flow. Second operand has 4 states, 4 states have (on average 615.25) internal successors, (2461), 4 states have internal predecessors, (2461), 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:28:08,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:08,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 668 [2025-03-15 02:28:08,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:08,867 INFO L124 PetriNetUnfolderBase]: 97/1412 cut-off events. [2025-03-15 02:28:08,867 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-15 02:28:08,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1562 conditions, 1412 events. 97/1412 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 7335 event pairs, 39 based on Foata normal form. 51/1251 useless extension candidates. Maximal degree in co-relation 1052. Up to 95 conditions per place. [2025-03-15 02:28:08,909 INFO L140 encePairwiseOnDemand]: 639/668 looper letters, 24 selfloop transitions, 3 changer transitions 25/633 dead transitions. [2025-03-15 02:28:08,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 633 transitions, 1340 flow [2025-03-15 02:28:08,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:28:08,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:28:08,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2506 transitions. [2025-03-15 02:28:08,934 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.937874251497006 [2025-03-15 02:28:08,937 INFO L298 CegarLoopForPetriNet]: 637 programPoint places, -9 predicate places. [2025-03-15 02:28:08,937 INFO L471 AbstractCegarLoop]: Abstraction has has 628 places, 633 transitions, 1340 flow [2025-03-15 02:28:08,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 615.25) internal successors, (2461), 4 states have internal predecessors, (2461), 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:28:08,939 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:08,939 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] [2025-03-15 02:28:08,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 02:28:08,939 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-15 02:28:08,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:08,940 INFO L85 PathProgramCache]: Analyzing trace with hash 684240354, now seen corresponding path program 1 times [2025-03-15 02:28:08,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:08,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467812380] [2025-03-15 02:28:08,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:08,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:09,145 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:28:09,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:09,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467812380] [2025-03-15 02:28:09,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467812380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:28:09,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:28:09,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 02:28:09,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117820356] [2025-03-15 02:28:09,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:28:09,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 02:28:09,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:09,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 02:28:09,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-15 02:28:09,154 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 501 out of 668 [2025-03-15 02:28:09,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 628 places, 633 transitions, 1340 flow. Second operand has 5 states, 5 states have (on average 506.6) internal successors, (2533), 5 states have internal predecessors, (2533), 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:28:09,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:09,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 501 of 668 [2025-03-15 02:28:09,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:09,495 INFO L124 PetriNetUnfolderBase]: 97/1410 cut-off events. [2025-03-15 02:28:09,495 INFO L125 PetriNetUnfolderBase]: For 99/133 co-relation queries the response was YES. [2025-03-15 02:28:09,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1767 conditions, 1410 events. 97/1410 cut-off events. For 99/133 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 7316 event pairs, 39 based on Foata normal form. 0/1200 useless extension candidates. Maximal degree in co-relation 1123. Up to 182 conditions per place. [2025-03-15 02:28:09,509 INFO L140 encePairwiseOnDemand]: 658/668 looper letters, 110 selfloop transitions, 5 changer transitions 25/631 dead transitions. [2025-03-15 02:28:09,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 631 places, 631 transitions, 1610 flow [2025-03-15 02:28:09,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 02:28:09,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 02:28:09,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3147 transitions. [2025-03-15 02:28:09,515 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7851796407185628 [2025-03-15 02:28:09,516 INFO L298 CegarLoopForPetriNet]: 637 programPoint places, -6 predicate places. [2025-03-15 02:28:09,516 INFO L471 AbstractCegarLoop]: Abstraction has has 631 places, 631 transitions, 1610 flow [2025-03-15 02:28:09,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 506.6) internal successors, (2533), 5 states have internal predecessors, (2533), 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:28:09,518 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:09,518 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] [2025-03-15 02:28:09,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 02:28:09,518 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-15 02:28:09,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:09,519 INFO L85 PathProgramCache]: Analyzing trace with hash 683649429, now seen corresponding path program 1 times [2025-03-15 02:28:09,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:09,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532867073] [2025-03-15 02:28:09,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:09,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:09,776 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:28:09,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:09,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532867073] [2025-03-15 02:28:09,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532867073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:28:09,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:28:09,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:28:09,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401091315] [2025-03-15 02:28:09,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:28:09,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:28:09,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:09,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:28:09,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:28:09,787 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 668 [2025-03-15 02:28:09,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 631 transitions, 1610 flow. Second operand has 4 states, 4 states have (on average 597.5) internal successors, (2390), 4 states have internal predecessors, (2390), 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:28:09,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:09,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 668 [2025-03-15 02:28:09,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:10,174 INFO L124 PetriNetUnfolderBase]: 100/1446 cut-off events. [2025-03-15 02:28:10,174 INFO L125 PetriNetUnfolderBase]: For 194/228 co-relation queries the response was YES. [2025-03-15 02:28:10,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1900 conditions, 1446 events. 100/1446 cut-off events. For 194/228 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 7428 event pairs, 39 based on Foata normal form. 0/1233 useless extension candidates. Maximal degree in co-relation 1168. Up to 182 conditions per place. [2025-03-15 02:28:10,196 INFO L140 encePairwiseOnDemand]: 647/668 looper letters, 59 selfloop transitions, 15 changer transitions 25/658 dead transitions. [2025-03-15 02:28:10,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 635 places, 658 transitions, 1814 flow [2025-03-15 02:28:10,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 02:28:10,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 02:28:10,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3061 transitions. [2025-03-15 02:28:10,204 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9164670658682634 [2025-03-15 02:28:10,204 INFO L298 CegarLoopForPetriNet]: 637 programPoint places, -2 predicate places. [2025-03-15 02:28:10,205 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 658 transitions, 1814 flow [2025-03-15 02:28:10,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 597.5) internal successors, (2390), 4 states have internal predecessors, (2390), 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:28:10,206 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:10,206 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] [2025-03-15 02:28:10,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 02:28:10,207 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-15 02:28:10,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:10,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1403000740, now seen corresponding path program 1 times [2025-03-15 02:28:10,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:10,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061286915] [2025-03-15 02:28:10,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:10,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:10,346 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:28:10,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:10,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061286915] [2025-03-15 02:28:10,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061286915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:28:10,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:28:10,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:28:10,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885101847] [2025-03-15 02:28:10,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:28:10,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:28:10,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:10,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:28:10,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:28:10,354 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 668 [2025-03-15 02:28:10,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 658 transitions, 1814 flow. Second operand has 4 states, 4 states have (on average 615.25) internal successors, (2461), 4 states have internal predecessors, (2461), 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:28:10,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:10,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 668 [2025-03-15 02:28:10,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:11,001 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1744] thread2EXIT-->L105: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][643], [662#(<= 0 (+ ~id_3~0 2147483648)), 650#(<= ~id_0~0 2147483646), 494#L105true, 483#L68-10true, thread2Thread1of1ForFork1NotInUse, 653#true, thread3Thread1of1ForFork2InUse, 643#(<= 0 (+ ~id_0~0 2147483648)), thread1Thread1of1ForFork0NotInUse]) [2025-03-15 02:28:11,001 INFO L294 olderBase$Statistics]: this new event has 389 ancestors and is cut-off event [2025-03-15 02:28:11,001 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2025-03-15 02:28:11,001 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2025-03-15 02:28:11,001 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2025-03-15 02:28:11,002 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1744] thread2EXIT-->L105: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][643], [662#(<= 0 (+ ~id_3~0 2147483648)), 391#L68-1true, 650#(<= ~id_0~0 2147483646), 494#L105true, thread2Thread1of1ForFork1NotInUse, 653#true, 643#(<= 0 (+ ~id_0~0 2147483648)), thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0NotInUse]) [2025-03-15 02:28:11,002 INFO L294 olderBase$Statistics]: this new event has 385 ancestors and is cut-off event [2025-03-15 02:28:11,002 INFO L297 olderBase$Statistics]: existing Event has 353 ancestors and is cut-off event [2025-03-15 02:28:11,002 INFO L297 olderBase$Statistics]: existing Event has 353 ancestors and is cut-off event [2025-03-15 02:28:11,002 INFO L297 olderBase$Statistics]: existing Event has 353 ancestors and is cut-off event [2025-03-15 02:28:11,003 INFO L124 PetriNetUnfolderBase]: 211/2816 cut-off events. [2025-03-15 02:28:11,003 INFO L125 PetriNetUnfolderBase]: For 868/949 co-relation queries the response was YES. [2025-03-15 02:28:11,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3613 conditions, 2816 events. 211/2816 cut-off events. For 868/949 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 21286 event pairs, 80 based on Foata normal form. 0/2370 useless extension candidates. Maximal degree in co-relation 2664. Up to 231 conditions per place. [2025-03-15 02:28:11,043 INFO L140 encePairwiseOnDemand]: 663/668 looper letters, 24 selfloop transitions, 3 changer transitions 25/656 dead transitions. [2025-03-15 02:28:11,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 656 transitions, 1866 flow [2025-03-15 02:28:11,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:28:11,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:28:11,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2482 transitions. [2025-03-15 02:28:11,049 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9288922155688623 [2025-03-15 02:28:11,050 INFO L298 CegarLoopForPetriNet]: 637 programPoint places, -1 predicate places. [2025-03-15 02:28:11,050 INFO L471 AbstractCegarLoop]: Abstraction has has 636 places, 656 transitions, 1866 flow [2025-03-15 02:28:11,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 615.25) internal successors, (2461), 4 states have internal predecessors, (2461), 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:28:11,052 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:11,052 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] [2025-03-15 02:28:11,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 02:28:11,053 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-15 02:28:11,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:11,054 INFO L85 PathProgramCache]: Analyzing trace with hash -543349023, now seen corresponding path program 1 times [2025-03-15 02:28:11,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:11,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225151865] [2025-03-15 02:28:11,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:11,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:11,336 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:28:11,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:11,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225151865] [2025-03-15 02:28:11,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225151865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:28:11,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:28:11,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 02:28:11,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515480634] [2025-03-15 02:28:11,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:28:11,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:28:11,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:11,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:28:11,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:28:11,344 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 463 out of 668 [2025-03-15 02:28:11,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 636 places, 656 transitions, 1866 flow. Second operand has 8 states, 8 states have (on average 469.125) internal successors, (3753), 8 states have internal predecessors, (3753), 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:28:11,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:11,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 463 of 668 [2025-03-15 02:28:11,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:12,127 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1744] thread2EXIT-->L105: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][641], [662#(<= 0 (+ ~id_3~0 2147483648)), 391#L68-1true, 650#(<= ~id_0~0 2147483646), 494#L105true, thread2Thread1of1ForFork1NotInUse, 653#true, 643#(<= 0 (+ ~id_0~0 2147483648)), 669#(<= 0 ~id_0~0), thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0NotInUse]) [2025-03-15 02:28:12,128 INFO L294 olderBase$Statistics]: this new event has 395 ancestors and is cut-off event [2025-03-15 02:28:12,128 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2025-03-15 02:28:12,128 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2025-03-15 02:28:12,128 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2025-03-15 02:28:12,128 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1744] thread2EXIT-->L105: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][641], [662#(<= 0 (+ ~id_3~0 2147483648)), 650#(<= ~id_0~0 2147483646), 483#L68-10true, 494#L105true, thread2Thread1of1ForFork1NotInUse, 653#true, 643#(<= 0 (+ ~id_0~0 2147483648)), 669#(<= 0 ~id_0~0), thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0NotInUse]) [2025-03-15 02:28:12,128 INFO L294 olderBase$Statistics]: this new event has 399 ancestors and is cut-off event [2025-03-15 02:28:12,128 INFO L297 olderBase$Statistics]: existing Event has 367 ancestors and is cut-off event [2025-03-15 02:28:12,128 INFO L297 olderBase$Statistics]: existing Event has 367 ancestors and is cut-off event [2025-03-15 02:28:12,128 INFO L297 olderBase$Statistics]: existing Event has 367 ancestors and is cut-off event [2025-03-15 02:28:12,129 INFO L124 PetriNetUnfolderBase]: 210/2814 cut-off events. [2025-03-15 02:28:12,129 INFO L125 PetriNetUnfolderBase]: For 1131/1288 co-relation queries the response was YES. [2025-03-15 02:28:12,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3921 conditions, 2814 events. 210/2814 cut-off events. For 1131/1288 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 21235 event pairs, 80 based on Foata normal form. 0/2369 useless extension candidates. Maximal degree in co-relation 2771. Up to 276 conditions per place. [2025-03-15 02:28:12,161 INFO L140 encePairwiseOnDemand]: 656/668 looper letters, 158 selfloop transitions, 11 changer transitions 25/654 dead transitions. [2025-03-15 02:28:12,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 643 places, 654 transitions, 2244 flow [2025-03-15 02:28:12,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 02:28:12,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 02:28:12,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 3886 transitions. [2025-03-15 02:28:12,169 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7271706586826348 [2025-03-15 02:28:12,173 INFO L298 CegarLoopForPetriNet]: 637 programPoint places, 6 predicate places. [2025-03-15 02:28:12,173 INFO L471 AbstractCegarLoop]: Abstraction has has 643 places, 654 transitions, 2244 flow [2025-03-15 02:28:12,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 469.125) internal successors, (3753), 8 states have internal predecessors, (3753), 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:28:12,174 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:12,175 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:12,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 02:28:12,175 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-15 02:28:12,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:12,176 INFO L85 PathProgramCache]: Analyzing trace with hash -52844947, now seen corresponding path program 1 times [2025-03-15 02:28:12,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:12,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288141981] [2025-03-15 02:28:12,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:12,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:12,287 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:28:12,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:12,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288141981] [2025-03-15 02:28:12,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288141981] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:28:12,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478103968] [2025-03-15 02:28:12,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:12,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:12,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:28:12,290 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:28:12,291 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:28:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:12,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 02:28:12,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:28:12,482 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:28:12,482 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 02:28:12,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478103968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:28:12,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 02:28:12,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-15 02:28:12,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390387233] [2025-03-15 02:28:12,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:28:12,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:28:12,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:12,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:28:12,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:28:12,490 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 668 [2025-03-15 02:28:12,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 643 places, 654 transitions, 2244 flow. Second operand has 6 states, 6 states have (on average 598.1666666666666) internal successors, (3589), 6 states have internal predecessors, (3589), 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:28:12,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:12,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 668 [2025-03-15 02:28:12,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:13,124 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1744] thread2EXIT-->L105: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][638], [681#true, 662#(<= 0 (+ ~id_3~0 2147483648)), 391#L68-1true, 650#(<= ~id_0~0 2147483646), 494#L105true, thread2Thread1of1ForFork1NotInUse, 653#true, thread3Thread1of1ForFork2InUse, 643#(<= 0 (+ ~id_0~0 2147483648)), 669#(<= 0 ~id_0~0), thread1Thread1of1ForFork0NotInUse]) [2025-03-15 02:28:13,124 INFO L294 olderBase$Statistics]: this new event has 395 ancestors and is cut-off event [2025-03-15 02:28:13,124 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2025-03-15 02:28:13,124 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2025-03-15 02:28:13,124 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2025-03-15 02:28:13,125 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1744] thread2EXIT-->L105: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][638], [681#true, 662#(<= 0 (+ ~id_3~0 2147483648)), 650#(<= ~id_0~0 2147483646), 494#L105true, 483#L68-10true, thread2Thread1of1ForFork1NotInUse, 653#true, 669#(<= 0 ~id_0~0), thread3Thread1of1ForFork2InUse, 643#(<= 0 (+ ~id_0~0 2147483648)), thread1Thread1of1ForFork0NotInUse]) [2025-03-15 02:28:13,125 INFO L294 olderBase$Statistics]: this new event has 399 ancestors and is cut-off event [2025-03-15 02:28:13,125 INFO L297 olderBase$Statistics]: existing Event has 367 ancestors and is cut-off event [2025-03-15 02:28:13,125 INFO L297 olderBase$Statistics]: existing Event has 367 ancestors and is cut-off event [2025-03-15 02:28:13,125 INFO L297 olderBase$Statistics]: existing Event has 367 ancestors and is cut-off event [2025-03-15 02:28:13,125 INFO L124 PetriNetUnfolderBase]: 210/2811 cut-off events. [2025-03-15 02:28:13,125 INFO L125 PetriNetUnfolderBase]: For 1677/1834 co-relation queries the response was YES. [2025-03-15 02:28:13,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4044 conditions, 2811 events. 210/2811 cut-off events. For 1677/1834 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 21185 event pairs, 80 based on Foata normal form. 0/2369 useless extension candidates. Maximal degree in co-relation 2815. Up to 276 conditions per place. [2025-03-15 02:28:13,152 INFO L140 encePairwiseOnDemand]: 650/668 looper letters, 46 selfloop transitions, 23 changer transitions 25/651 dead transitions. [2025-03-15 02:28:13,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 646 places, 651 transitions, 2372 flow [2025-03-15 02:28:13,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:28:13,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:28:13,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 4245 transitions. [2025-03-15 02:28:13,159 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9078272027373824 [2025-03-15 02:28:13,161 INFO L298 CegarLoopForPetriNet]: 637 programPoint places, 9 predicate places. [2025-03-15 02:28:13,161 INFO L471 AbstractCegarLoop]: Abstraction has has 646 places, 651 transitions, 2372 flow [2025-03-15 02:28:13,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 598.1666666666666) internal successors, (3589), 6 states have internal predecessors, (3589), 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:28:13,163 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:13,163 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:28:13,170 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:28:13,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-15 02:28:13,364 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-15 02:28:13,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:13,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1638192076, now seen corresponding path program 1 times [2025-03-15 02:28:13,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:13,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061151066] [2025-03-15 02:28:13,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:13,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:13,460 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:28:13,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:13,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061151066] [2025-03-15 02:28:13,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061151066] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:28:13,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877653289] [2025-03-15 02:28:13,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:13,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:13,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:28:13,463 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:28:13,465 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:28:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:13,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 02:28:13,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:28:13,610 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:28:13,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:28:13,669 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:28:13,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877653289] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:28:13,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:28:13,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-15 02:28:13,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836735770] [2025-03-15 02:28:13,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:28:13,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-15 02:28:13,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:13,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-15 02:28:13,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-15 02:28:13,675 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 668 [2025-03-15 02:28:13,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 646 places, 651 transitions, 2372 flow. Second operand has 12 states, 12 states have (on average 598.8333333333334) internal successors, (7186), 12 states have internal predecessors, (7186), 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:28:13,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:13,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 668 [2025-03-15 02:28:13,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:14,455 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1744] thread2EXIT-->L105: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][716], [1112#true, 681#true, 662#(<= 0 (+ ~id_3~0 2147483648)), 650#(<= ~id_0~0 2147483646), 494#L105true, 483#L68-10true, thread2Thread1of1ForFork1NotInUse, 653#true, 643#(<= 0 (+ ~id_0~0 2147483648)), thread3Thread1of1ForFork2InUse, 669#(<= 0 ~id_0~0), thread1Thread1of1ForFork0NotInUse]) [2025-03-15 02:28:14,456 INFO L294 olderBase$Statistics]: this new event has 399 ancestors and is cut-off event [2025-03-15 02:28:14,456 INFO L297 olderBase$Statistics]: existing Event has 367 ancestors and is cut-off event [2025-03-15 02:28:14,456 INFO L297 olderBase$Statistics]: existing Event has 367 ancestors and is cut-off event [2025-03-15 02:28:14,456 INFO L297 olderBase$Statistics]: existing Event has 367 ancestors and is cut-off event [2025-03-15 02:28:14,456 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1744] thread2EXIT-->L105: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][716], [1112#true, 681#true, 662#(<= 0 (+ ~id_3~0 2147483648)), 391#L68-1true, 650#(<= ~id_0~0 2147483646), 494#L105true, thread2Thread1of1ForFork1NotInUse, 653#true, 643#(<= 0 (+ ~id_0~0 2147483648)), thread3Thread1of1ForFork2InUse, 669#(<= 0 ~id_0~0), thread1Thread1of1ForFork0NotInUse]) [2025-03-15 02:28:14,456 INFO L294 olderBase$Statistics]: this new event has 395 ancestors and is cut-off event [2025-03-15 02:28:14,456 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2025-03-15 02:28:14,456 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2025-03-15 02:28:14,456 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2025-03-15 02:28:14,457 INFO L124 PetriNetUnfolderBase]: 219/2916 cut-off events. [2025-03-15 02:28:14,457 INFO L125 PetriNetUnfolderBase]: For 2388/2545 co-relation queries the response was YES. [2025-03-15 02:28:14,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4566 conditions, 2916 events. 219/2916 cut-off events. For 2388/2545 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 21528 event pairs, 80 based on Foata normal form. 0/2465 useless extension candidates. Maximal degree in co-relation 2859. Up to 312 conditions per place. [2025-03-15 02:28:14,496 INFO L140 encePairwiseOnDemand]: 647/668 looper letters, 94 selfloop transitions, 53 changer transitions 25/729 dead transitions. [2025-03-15 02:28:14,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 729 transitions, 3244 flow [2025-03-15 02:28:14,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 02:28:14,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 02:28:14,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 8501 transitions. [2025-03-15 02:28:14,512 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9090034217279727 [2025-03-15 02:28:14,513 INFO L298 CegarLoopForPetriNet]: 637 programPoint places, 22 predicate places. [2025-03-15 02:28:14,513 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 729 transitions, 3244 flow [2025-03-15 02:28:14,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 598.8333333333334) internal successors, (7186), 12 states have internal predecessors, (7186), 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:28:14,517 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:14,517 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] [2025-03-15 02:28:14,525 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:28:14,722 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,SelfDestructingSolverStorable6 [2025-03-15 02:28:14,722 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-15 02:28:14,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:14,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1540610825, now seen corresponding path program 1 times [2025-03-15 02:28:14,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:14,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095081577] [2025-03-15 02:28:14,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:14,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:14,891 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:28:14,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:14,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095081577] [2025-03-15 02:28:14,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095081577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:28:14,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:28:14,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 02:28:14,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367122345] [2025-03-15 02:28:14,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:28:14,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 02:28:14,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:14,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 02:28:14,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-15 02:28:14,896 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 501 out of 668 [2025-03-15 02:28:14,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 729 transitions, 3244 flow. Second operand has 5 states, 5 states have (on average 509.0) internal successors, (2545), 5 states have internal predecessors, (2545), 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:28:14,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:14,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 501 of 668 [2025-03-15 02:28:14,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:15,561 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1744] thread2EXIT-->L105: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][714], [662#(<= 0 (+ ~id_3~0 2147483648)), 650#(<= ~id_0~0 2147483646), 494#L105true, 643#(<= 0 (+ ~id_0~0 2147483648)), 1982#(<= ~id_3~0 2147483646), 1112#true, 681#true, 391#L68-1true, thread2Thread1of1ForFork1NotInUse, 653#true, 669#(<= 0 ~id_0~0), thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0NotInUse]) [2025-03-15 02:28:15,562 INFO L294 olderBase$Statistics]: this new event has 395 ancestors and is cut-off event [2025-03-15 02:28:15,562 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2025-03-15 02:28:15,562 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2025-03-15 02:28:15,562 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2025-03-15 02:28:15,562 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1744] thread2EXIT-->L105: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][714], [662#(<= 0 (+ ~id_3~0 2147483648)), 650#(<= ~id_0~0 2147483646), 494#L105true, 643#(<= 0 (+ ~id_0~0 2147483648)), 1982#(<= ~id_3~0 2147483646), 1112#true, 681#true, 483#L68-10true, thread2Thread1of1ForFork1NotInUse, 653#true, thread3Thread1of1ForFork2InUse, 669#(<= 0 ~id_0~0), thread1Thread1of1ForFork0NotInUse]) [2025-03-15 02:28:15,562 INFO L294 olderBase$Statistics]: this new event has 399 ancestors and is cut-off event [2025-03-15 02:28:15,562 INFO L297 olderBase$Statistics]: existing Event has 367 ancestors and is cut-off event [2025-03-15 02:28:15,562 INFO L297 olderBase$Statistics]: existing Event has 367 ancestors and is cut-off event [2025-03-15 02:28:15,562 INFO L297 olderBase$Statistics]: existing Event has 367 ancestors and is cut-off event [2025-03-15 02:28:15,563 INFO L124 PetriNetUnfolderBase]: 219/2914 cut-off events. [2025-03-15 02:28:15,563 INFO L125 PetriNetUnfolderBase]: For 2981/3220 co-relation queries the response was YES. [2025-03-15 02:28:15,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4829 conditions, 2914 events. 219/2914 cut-off events. For 2981/3220 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 21537 event pairs, 80 based on Foata normal form. 0/2465 useless extension candidates. Maximal degree in co-relation 2972. Up to 312 conditions per place. [2025-03-15 02:28:15,588 INFO L140 encePairwiseOnDemand]: 659/668 looper letters, 110 selfloop transitions, 5 changer transitions 25/727 dead transitions. [2025-03-15 02:28:15,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 662 places, 727 transitions, 3514 flow [2025-03-15 02:28:15,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 02:28:15,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 02:28:15,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3147 transitions. [2025-03-15 02:28:15,593 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7851796407185628 [2025-03-15 02:28:15,594 INFO L298 CegarLoopForPetriNet]: 637 programPoint places, 25 predicate places. [2025-03-15 02:28:15,594 INFO L471 AbstractCegarLoop]: Abstraction has has 662 places, 727 transitions, 3514 flow [2025-03-15 02:28:15,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 509.0) internal successors, (2545), 5 states have internal predecessors, (2545), 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:28:15,595 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:15,595 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:28:15,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 02:28:15,596 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-15 02:28:15,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:15,596 INFO L85 PathProgramCache]: Analyzing trace with hash 666671788, now seen corresponding path program 2 times [2025-03-15 02:28:15,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:15,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732770289] [2025-03-15 02:28:15,597 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:28:15,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:15,614 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:28:15,614 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:28:15,677 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:28:15,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:15,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732770289] [2025-03-15 02:28:15,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732770289] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:28:15,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711379002] [2025-03-15 02:28:15,678 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:28:15,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:15,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:28:15,680 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:28:15,687 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:28:15,767 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:28:15,767 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:28:15,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-15 02:28:15,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:28:15,858 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:28:15,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:28:15,946 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:28:15,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711379002] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:28:15,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:28:15,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-15 02:28:15,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041867487] [2025-03-15 02:28:15,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:28:15,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 02:28:15,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:15,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 02:28:15,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-15 02:28:15,953 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 668 [2025-03-15 02:28:15,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 662 places, 727 transitions, 3514 flow. Second operand has 7 states, 7 states have (on average 562.5714285714286) internal successors, (3938), 7 states have internal predecessors, (3938), 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:28:15,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:15,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 668 [2025-03-15 02:28:15,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:16,676 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1744] thread2EXIT-->L105: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][715], [662#(<= 0 (+ ~id_3~0 2147483648)), 650#(<= ~id_0~0 2147483646), 494#L105true, 643#(<= 0 (+ ~id_0~0 2147483648)), 1982#(<= ~id_3~0 2147483646), 1112#true, 681#true, 483#L68-10true, thread2Thread1of1ForFork1NotInUse, 653#true, 669#(<= 0 ~id_0~0), thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0NotInUse, 1987#(<= ~id_0~0 2147483646)]) [2025-03-15 02:28:16,677 INFO L294 olderBase$Statistics]: this new event has 399 ancestors and is cut-off event [2025-03-15 02:28:16,677 INFO L297 olderBase$Statistics]: existing Event has 367 ancestors and is cut-off event [2025-03-15 02:28:16,677 INFO L297 olderBase$Statistics]: existing Event has 367 ancestors and is cut-off event [2025-03-15 02:28:16,677 INFO L297 olderBase$Statistics]: existing Event has 367 ancestors and is cut-off event [2025-03-15 02:28:16,677 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1744] thread2EXIT-->L105: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][715], [662#(<= 0 (+ ~id_3~0 2147483648)), 650#(<= ~id_0~0 2147483646), 494#L105true, 643#(<= 0 (+ ~id_0~0 2147483648)), 1982#(<= ~id_3~0 2147483646), 1112#true, 681#true, 391#L68-1true, thread2Thread1of1ForFork1NotInUse, 653#true, 669#(<= 0 ~id_0~0), thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0NotInUse, 1987#(<= ~id_0~0 2147483646)]) [2025-03-15 02:28:16,677 INFO L294 olderBase$Statistics]: this new event has 395 ancestors and is cut-off event [2025-03-15 02:28:16,677 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2025-03-15 02:28:16,677 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2025-03-15 02:28:16,677 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2025-03-15 02:28:16,678 INFO L124 PetriNetUnfolderBase]: 219/2919 cut-off events. [2025-03-15 02:28:16,678 INFO L125 PetriNetUnfolderBase]: For 3470/3785 co-relation queries the response was YES. [2025-03-15 02:28:16,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5140 conditions, 2919 events. 219/2919 cut-off events. For 3470/3785 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 21577 event pairs, 80 based on Foata normal form. 0/2471 useless extension candidates. Maximal degree in co-relation 3079. Up to 314 conditions per place. [2025-03-15 02:28:16,725 INFO L140 encePairwiseOnDemand]: 639/668 looper letters, 127 selfloop transitions, 54 changer transitions 25/728 dead transitions. [2025-03-15 02:28:16,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 673 places, 728 transitions, 3890 flow [2025-03-15 02:28:16,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 02:28:16,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 02:28:16,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 7364 transitions. [2025-03-15 02:28:16,737 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8479963150621833 [2025-03-15 02:28:16,738 INFO L298 CegarLoopForPetriNet]: 637 programPoint places, 36 predicate places. [2025-03-15 02:28:16,738 INFO L471 AbstractCegarLoop]: Abstraction has has 673 places, 728 transitions, 3890 flow [2025-03-15 02:28:16,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 562.5714285714286) internal successors, (3938), 7 states have internal predecessors, (3938), 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:28:16,740 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:16,740 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:28:16,746 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:28:16,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:16,944 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-15 02:28:16,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:16,945 INFO L85 PathProgramCache]: Analyzing trace with hash -335490185, now seen corresponding path program 1 times [2025-03-15 02:28:16,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:16,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034772989] [2025-03-15 02:28:16,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:16,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:17,048 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:28:17,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:17,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034772989] [2025-03-15 02:28:17,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034772989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:28:17,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:28:17,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:28:17,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743476094] [2025-03-15 02:28:17,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:28:17,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:28:17,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:17,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:28:17,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:28:17,051 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 668 [2025-03-15 02:28:17,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 673 places, 728 transitions, 3890 flow. Second operand has 4 states, 4 states have (on average 615.25) internal successors, (2461), 4 states have internal predecessors, (2461), 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:28:17,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:17,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 668 [2025-03-15 02:28:17,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:17,711 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1743] thread1EXIT-->L104-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[][645], [662#(<= 0 (+ ~id_3~0 2147483648)), 3035#(<= 0 (+ ~id_6~0 2147483648)), 650#(<= ~id_0~0 2147483646), 643#(<= 0 (+ ~id_0~0 2147483648)), 1982#(<= ~id_3~0 2147483646), 305#L104-1true, 1112#true, 400#L60-1true, 681#true, 391#L68-1true, thread2Thread1of1ForFork1InUse, 653#true, 669#(<= 0 ~id_0~0), thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0NotInUse, 1987#(<= ~id_0~0 2147483646)]) [2025-03-15 02:28:17,712 INFO L294 olderBase$Statistics]: this new event has 348 ancestors and is cut-off event [2025-03-15 02:28:17,712 INFO L297 olderBase$Statistics]: existing Event has 348 ancestors and is cut-off event [2025-03-15 02:28:17,712 INFO L297 olderBase$Statistics]: existing Event has 348 ancestors and is cut-off event [2025-03-15 02:28:17,712 INFO L297 olderBase$Statistics]: existing Event has 350 ancestors and is cut-off event [2025-03-15 02:28:17,865 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1743] thread1EXIT-->L104-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[][645], [662#(<= 0 (+ ~id_3~0 2147483648)), 3035#(<= 0 (+ ~id_6~0 2147483648)), 650#(<= ~id_0~0 2147483646), 643#(<= 0 (+ ~id_0~0 2147483648)), 1982#(<= ~id_3~0 2147483646), 305#L104-1true, 1112#true, 400#L60-1true, 681#true, 509#L68-4true, 653#true, thread2Thread1of1ForFork1InUse, 669#(<= 0 ~id_0~0), thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0NotInUse, 1987#(<= ~id_0~0 2147483646)]) [2025-03-15 02:28:17,865 INFO L294 olderBase$Statistics]: this new event has 351 ancestors and is cut-off event [2025-03-15 02:28:17,865 INFO L297 olderBase$Statistics]: existing Event has 351 ancestors and is cut-off event [2025-03-15 02:28:17,865 INFO L297 olderBase$Statistics]: existing Event has 353 ancestors and is cut-off event [2025-03-15 02:28:17,865 INFO L297 olderBase$Statistics]: existing Event has 351 ancestors and is cut-off event [2025-03-15 02:28:17,880 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1743] thread1EXIT-->L104-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[][645], [662#(<= 0 (+ ~id_3~0 2147483648)), 3035#(<= 0 (+ ~id_6~0 2147483648)), 650#(<= ~id_0~0 2147483646), 643#(<= 0 (+ ~id_0~0 2147483648)), 1982#(<= ~id_3~0 2147483646), 305#L104-1true, 1112#true, 681#true, 483#L68-10true, 653#true, thread2Thread1of1ForFork1InUse, 669#(<= 0 ~id_0~0), thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0NotInUse, 393#L60-10true, 1987#(<= ~id_0~0 2147483646)]) [2025-03-15 02:28:17,880 INFO L294 olderBase$Statistics]: this new event has 358 ancestors and is cut-off event [2025-03-15 02:28:17,880 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-03-15 02:28:17,880 INFO L297 olderBase$Statistics]: existing Event has 356 ancestors and is cut-off event [2025-03-15 02:28:17,880 INFO L297 olderBase$Statistics]: existing Event has 356 ancestors and is cut-off event [2025-03-15 02:28:17,881 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1743] thread1EXIT-->L104-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[][645], [662#(<= 0 (+ ~id_3~0 2147483648)), 3035#(<= 0 (+ ~id_6~0 2147483648)), 650#(<= ~id_0~0 2147483646), 643#(<= 0 (+ ~id_0~0 2147483648)), 1982#(<= ~id_3~0 2147483646), 305#L104-1true, 1112#true, 681#true, 391#L68-1true, 653#true, thread2Thread1of1ForFork1InUse, 669#(<= 0 ~id_0~0), thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0NotInUse, 393#L60-10true, 1987#(<= ~id_0~0 2147483646)]) [2025-03-15 02:28:17,881 INFO L294 olderBase$Statistics]: this new event has 354 ancestors and is cut-off event [2025-03-15 02:28:17,881 INFO L297 olderBase$Statistics]: existing Event has 354 ancestors and is cut-off event [2025-03-15 02:28:17,881 INFO L297 olderBase$Statistics]: existing Event has 352 ancestors and is cut-off event [2025-03-15 02:28:17,881 INFO L297 olderBase$Statistics]: existing Event has 352 ancestors and is cut-off event [2025-03-15 02:28:17,883 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1743] thread1EXIT-->L104-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[][645], [662#(<= 0 (+ ~id_3~0 2147483648)), 3035#(<= 0 (+ ~id_6~0 2147483648)), 650#(<= ~id_0~0 2147483646), 643#(<= 0 (+ ~id_0~0 2147483648)), 1982#(<= ~id_3~0 2147483646), 305#L104-1true, 1112#true, 400#L60-1true, 681#true, 483#L68-10true, 653#true, thread2Thread1of1ForFork1InUse, 669#(<= 0 ~id_0~0), thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0NotInUse, 1987#(<= ~id_0~0 2147483646)]) [2025-03-15 02:28:17,883 INFO L294 olderBase$Statistics]: this new event has 352 ancestors and is cut-off event [2025-03-15 02:28:17,883 INFO L297 olderBase$Statistics]: existing Event has 354 ancestors and is cut-off event [2025-03-15 02:28:17,883 INFO L297 olderBase$Statistics]: existing Event has 352 ancestors and is cut-off event [2025-03-15 02:28:17,884 INFO L297 olderBase$Statistics]: existing Event has 352 ancestors and is cut-off event [2025-03-15 02:28:17,897 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1743] thread1EXIT-->L104-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[][645], [662#(<= 0 (+ ~id_3~0 2147483648)), 3035#(<= 0 (+ ~id_6~0 2147483648)), 650#(<= ~id_0~0 2147483646), 447#L60-11true, 643#(<= 0 (+ ~id_0~0 2147483648)), 1982#(<= ~id_3~0 2147483646), 305#L104-1true, 1112#true, 681#true, 391#L68-1true, 653#true, thread2Thread1of1ForFork1InUse, 669#(<= 0 ~id_0~0), thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0NotInUse, 1987#(<= ~id_0~0 2147483646)]) [2025-03-15 02:28:17,898 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2025-03-15 02:28:17,898 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is cut-off event [2025-03-15 02:28:17,898 INFO L297 olderBase$Statistics]: existing Event has 353 ancestors and is cut-off event [2025-03-15 02:28:17,898 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is cut-off event [2025-03-15 02:28:17,898 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1743] thread1EXIT-->L104-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[][645], [662#(<= 0 (+ ~id_3~0 2147483648)), 3035#(<= 0 (+ ~id_6~0 2147483648)), 650#(<= ~id_0~0 2147483646), 643#(<= 0 (+ ~id_0~0 2147483648)), 1982#(<= ~id_3~0 2147483646), 305#L104-1true, 1112#true, 681#true, 391#L68-1true, 653#true, thread2Thread1of1ForFork1InUse, 669#(<= 0 ~id_0~0), thread3Thread1of1ForFork2InUse, 393#L60-10true, thread1Thread1of1ForFork0NotInUse, 1987#(<= ~id_0~0 2147483646)]) [2025-03-15 02:28:17,899 INFO L294 olderBase$Statistics]: this new event has 352 ancestors and is not cut-off event [2025-03-15 02:28:17,899 INFO L297 olderBase$Statistics]: existing Event has 354 ancestors and is not cut-off event [2025-03-15 02:28:17,899 INFO L297 olderBase$Statistics]: existing Event has 354 ancestors and is not cut-off event [2025-03-15 02:28:17,899 INFO L297 olderBase$Statistics]: existing Event has 352 ancestors and is not cut-off event [2025-03-15 02:28:17,899 INFO L297 olderBase$Statistics]: existing Event has 352 ancestors and is not cut-off event [2025-03-15 02:28:17,899 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1743] thread1EXIT-->L104-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[][645], [662#(<= 0 (+ ~id_3~0 2147483648)), 3035#(<= 0 (+ ~id_6~0 2147483648)), 650#(<= ~id_0~0 2147483646), 643#(<= 0 (+ ~id_0~0 2147483648)), 1982#(<= ~id_3~0 2147483646), 305#L104-1true, 1112#true, 681#true, 483#L68-10true, thread2Thread1of1ForFork1InUse, 653#true, 669#(<= 0 ~id_0~0), thread3Thread1of1ForFork2InUse, 393#L60-10true, thread1Thread1of1ForFork0NotInUse, 1987#(<= ~id_0~0 2147483646)]) [2025-03-15 02:28:17,899 INFO L294 olderBase$Statistics]: this new event has 356 ancestors and is cut-off event [2025-03-15 02:28:17,899 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-03-15 02:28:17,899 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-03-15 02:28:17,899 INFO L297 olderBase$Statistics]: existing Event has 356 ancestors and is cut-off event [2025-03-15 02:28:17,899 INFO L297 olderBase$Statistics]: existing Event has 356 ancestors and is cut-off event [2025-03-15 02:28:17,900 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1743] thread1EXIT-->L104-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[][645], [662#(<= 0 (+ ~id_3~0 2147483648)), 3035#(<= 0 (+ ~id_6~0 2147483648)), 650#(<= ~id_0~0 2147483646), 643#(<= 0 (+ ~id_0~0 2147483648)), 1982#(<= ~id_3~0 2147483646), 305#L104-1true, 1112#true, 400#L60-1true, 681#true, 332#L68-11true, 653#true, thread2Thread1of1ForFork1InUse, 669#(<= 0 ~id_0~0), thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0NotInUse, 1987#(<= ~id_0~0 2147483646)]) [2025-03-15 02:28:17,900 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2025-03-15 02:28:17,900 INFO L297 olderBase$Statistics]: existing Event has 353 ancestors and is cut-off event [2025-03-15 02:28:17,900 INFO L297 olderBase$Statistics]: existing Event has 353 ancestors and is cut-off event [2025-03-15 02:28:17,900 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is cut-off event [2025-03-15 02:28:17,900 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1743] thread1EXIT-->L104-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[][645], [662#(<= 0 (+ ~id_3~0 2147483648)), 3035#(<= 0 (+ ~id_6~0 2147483648)), 650#(<= ~id_0~0 2147483646), 643#(<= 0 (+ ~id_0~0 2147483648)), 1982#(<= ~id_3~0 2147483646), 305#L104-1true, 1112#true, 681#true, 509#L68-4true, 653#true, thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, 669#(<= 0 ~id_0~0), thread1Thread1of1ForFork0NotInUse, 393#L60-10true, 1987#(<= ~id_0~0 2147483646)]) [2025-03-15 02:28:17,900 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is cut-off event [2025-03-15 02:28:17,901 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is cut-off event [2025-03-15 02:28:17,901 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is cut-off event [2025-03-15 02:28:17,901 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2025-03-15 02:28:17,955 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1743] thread1EXIT-->L104-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[][645], [662#(<= 0 (+ ~id_3~0 2147483648)), 3035#(<= 0 (+ ~id_6~0 2147483648)), 650#(<= ~id_0~0 2147483646), 447#L60-11true, 643#(<= 0 (+ ~id_0~0 2147483648)), 1982#(<= ~id_3~0 2147483646), 305#L104-1true, 1112#true, 681#true, 483#L68-10true, thread2Thread1of1ForFork1InUse, 653#true, 669#(<= 0 ~id_0~0), thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0NotInUse, 1987#(<= ~id_0~0 2147483646)]) [2025-03-15 02:28:17,955 INFO L294 olderBase$Statistics]: this new event has 357 ancestors and is cut-off event [2025-03-15 02:28:17,955 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-03-15 02:28:17,955 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-03-15 02:28:17,955 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2025-03-15 02:28:17,956 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1743] thread1EXIT-->L104-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[][645], [662#(<= 0 (+ ~id_3~0 2147483648)), 3035#(<= 0 (+ ~id_6~0 2147483648)), 650#(<= ~id_0~0 2147483646), 643#(<= 0 (+ ~id_0~0 2147483648)), 1982#(<= ~id_3~0 2147483646), 305#L104-1true, 1112#true, 681#true, 332#L68-11true, thread2Thread1of1ForFork1InUse, 653#true, 669#(<= 0 ~id_0~0), thread3Thread1of1ForFork2InUse, 393#L60-10true, thread1Thread1of1ForFork0NotInUse, 1987#(<= ~id_0~0 2147483646)]) [2025-03-15 02:28:17,956 INFO L294 olderBase$Statistics]: this new event has 357 ancestors and is cut-off event [2025-03-15 02:28:17,956 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2025-03-15 02:28:17,956 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-03-15 02:28:17,956 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2025-03-15 02:28:18,101 INFO L124 PetriNetUnfolderBase]: 640/5413 cut-off events. [2025-03-15 02:28:18,101 INFO L125 PetriNetUnfolderBase]: For 11735/12741 co-relation queries the response was YES. [2025-03-15 02:28:18,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9695 conditions, 5413 events. 640/5413 cut-off events. For 11735/12741 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 53398 event pairs, 355 based on Foata normal form. 0/4452 useless extension candidates. Maximal degree in co-relation 7572. Up to 507 conditions per place. [2025-03-15 02:28:18,162 INFO L140 encePairwiseOnDemand]: 663/668 looper letters, 24 selfloop transitions, 3 changer transitions 25/726 dead transitions. [2025-03-15 02:28:18,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 674 places, 726 transitions, 3942 flow [2025-03-15 02:28:18,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:28:18,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:28:18,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2482 transitions. [2025-03-15 02:28:18,165 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9288922155688623 [2025-03-15 02:28:18,166 INFO L298 CegarLoopForPetriNet]: 637 programPoint places, 37 predicate places. [2025-03-15 02:28:18,166 INFO L471 AbstractCegarLoop]: Abstraction has has 674 places, 726 transitions, 3942 flow [2025-03-15 02:28:18,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 615.25) internal successors, (2461), 4 states have internal predecessors, (2461), 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:28:18,167 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:18,167 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:28:18,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 02:28:18,167 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-15 02:28:18,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:18,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1810260157, now seen corresponding path program 1 times [2025-03-15 02:28:18,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:18,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128680012] [2025-03-15 02:28:18,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:18,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:18,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:18,317 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:28:18,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:18,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128680012] [2025-03-15 02:28:18,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128680012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:28:18,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:28:18,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:28:18,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849304312] [2025-03-15 02:28:18,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:28:18,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:28:18,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:18,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:28:18,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:28:18,321 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 465 out of 668 [2025-03-15 02:28:18,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 674 places, 726 transitions, 3942 flow. Second operand has 6 states, 6 states have (on average 475.3333333333333) internal successors, (2852), 6 states have internal predecessors, (2852), 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:28:18,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:18,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 465 of 668 [2025-03-15 02:28:18,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:20,015 INFO L124 PetriNetUnfolderBase]: 1204/11217 cut-off events. [2025-03-15 02:28:20,015 INFO L125 PetriNetUnfolderBase]: For 14662/15742 co-relation queries the response was YES. [2025-03-15 02:28:20,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17994 conditions, 11217 events. 1204/11217 cut-off events. For 14662/15742 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 134322 event pairs, 720 based on Foata normal form. 0/9361 useless extension candidates. Maximal degree in co-relation 15773. Up to 1331 conditions per place. [2025-03-15 02:28:20,097 INFO L140 encePairwiseOnDemand]: 658/668 looper letters, 138 selfloop transitions, 5 changer transitions 25/724 dead transitions. [2025-03-15 02:28:20,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 679 places, 724 transitions, 4268 flow [2025-03-15 02:28:20,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 02:28:20,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 02:28:20,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 3889 transitions. [2025-03-15 02:28:20,101 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7277320359281437 [2025-03-15 02:28:20,102 INFO L298 CegarLoopForPetriNet]: 637 programPoint places, 42 predicate places. [2025-03-15 02:28:20,102 INFO L471 AbstractCegarLoop]: Abstraction has has 679 places, 724 transitions, 4268 flow [2025-03-15 02:28:20,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 475.3333333333333) internal successors, (2852), 6 states have internal predecessors, (2852), 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:28:20,102 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:20,103 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:20,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 02:28:20,103 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-15 02:28:20,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:20,103 INFO L85 PathProgramCache]: Analyzing trace with hash -334908225, now seen corresponding path program 1 times [2025-03-15 02:28:20,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:20,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916302396] [2025-03-15 02:28:20,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:20,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:20,327 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:28:20,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:20,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916302396] [2025-03-15 02:28:20,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916302396] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:28:20,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377564144] [2025-03-15 02:28:20,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:20,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:20,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:28:20,329 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:28:20,331 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:28:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:20,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-15 02:28:20,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:28:20,500 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:28:20,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:28:20,657 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:28:20,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377564144] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:28:20,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:28:20,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-15 02:28:20,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361381588] [2025-03-15 02:28:20,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:28:20,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-15 02:28:20,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:20,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-15 02:28:20,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-15 02:28:20,664 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 668 [2025-03-15 02:28:20,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 679 places, 724 transitions, 4268 flow. Second operand has 24 states, 24 states have (on average 599.6666666666666) internal successors, (14392), 24 states have internal predecessors, (14392), 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:28:20,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:20,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 668 [2025-03-15 02:28:20,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:23,398 INFO L124 PetriNetUnfolderBase]: 1222/11433 cut-off events. [2025-03-15 02:28:23,398 INFO L125 PetriNetUnfolderBase]: For 18225/19305 co-relation queries the response was YES. [2025-03-15 02:28:23,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19429 conditions, 11433 events. 1222/11433 cut-off events. For 18225/19305 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 135242 event pairs, 720 based on Foata normal form. 0/9559 useless extension candidates. Maximal degree in co-relation 15913. Up to 1331 conditions per place. [2025-03-15 02:28:23,473 INFO L140 encePairwiseOnDemand]: 648/668 looper letters, 185 selfloop transitions, 125 changer transitions 25/886 dead transitions. [2025-03-15 02:28:23,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 710 places, 886 transitions, 6726 flow [2025-03-15 02:28:23,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-15 02:28:23,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-15 02:28:23,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 19393 transitions. [2025-03-15 02:28:23,493 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9072324101796407 [2025-03-15 02:28:23,494 INFO L298 CegarLoopForPetriNet]: 637 programPoint places, 73 predicate places. [2025-03-15 02:28:23,494 INFO L471 AbstractCegarLoop]: Abstraction has has 710 places, 886 transitions, 6726 flow [2025-03-15 02:28:23,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 599.6666666666666) internal successors, (14392), 24 states have internal predecessors, (14392), 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:28:23,497 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:23,497 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:28:23,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-15 02:28:23,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:23,698 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-15 02:28:23,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:23,699 INFO L85 PathProgramCache]: Analyzing trace with hash -373020842, now seen corresponding path program 1 times [2025-03-15 02:28:23,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:23,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368352950] [2025-03-15 02:28:23,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:23,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:23,772 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:28:23,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:23,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368352950] [2025-03-15 02:28:23,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368352950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:28:23,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:28:23,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:28:23,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515169036] [2025-03-15 02:28:23,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:28:23,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:28:23,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:23,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:28:23,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:28:23,774 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 668 [2025-03-15 02:28:23,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 710 places, 886 transitions, 6726 flow. Second operand has 4 states, 4 states have (on average 597.5) internal successors, (2390), 4 states have internal predecessors, (2390), 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:28:23,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:23,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 668 [2025-03-15 02:28:23,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:25,857 INFO L124 PetriNetUnfolderBase]: 1225/11469 cut-off events. [2025-03-15 02:28:25,857 INFO L125 PetriNetUnfolderBase]: For 21136/22216 co-relation queries the response was YES. [2025-03-15 02:28:25,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19692 conditions, 11469 events. 1225/11469 cut-off events. For 21136/22216 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 135480 event pairs, 720 based on Foata normal form. 0/9592 useless extension candidates. Maximal degree in co-relation 16053. Up to 1331 conditions per place. [2025-03-15 02:28:25,924 INFO L140 encePairwiseOnDemand]: 647/668 looper letters, 59 selfloop transitions, 15 changer transitions 25/913 dead transitions. [2025-03-15 02:28:25,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 714 places, 913 transitions, 6930 flow [2025-03-15 02:28:25,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 02:28:25,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 02:28:25,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3061 transitions. [2025-03-15 02:28:25,926 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9164670658682634 [2025-03-15 02:28:25,927 INFO L298 CegarLoopForPetriNet]: 637 programPoint places, 77 predicate places. [2025-03-15 02:28:25,927 INFO L471 AbstractCegarLoop]: Abstraction has has 714 places, 913 transitions, 6930 flow [2025-03-15 02:28:25,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 597.5) internal successors, (2390), 4 states have internal predecessors, (2390), 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:28:25,928 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:25,928 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:25,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 02:28:25,928 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-15 02:28:25,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:25,929 INFO L85 PathProgramCache]: Analyzing trace with hash 617805703, now seen corresponding path program 1 times [2025-03-15 02:28:25,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:25,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239875668] [2025-03-15 02:28:25,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:25,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:26,018 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:28:26,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:26,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239875668] [2025-03-15 02:28:26,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239875668] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:28:26,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17382487] [2025-03-15 02:28:26,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:26,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:26,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:28:26,021 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:28:26,022 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:28:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:26,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-15 02:28:26,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:28:26,408 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:28:26,408 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:28:26,724 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:28:26,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17382487] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:28:26,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:28:26,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13, 13] total 25 [2025-03-15 02:28:26,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642198455] [2025-03-15 02:28:26,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:28:26,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-15 02:28:26,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:26,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-15 02:28:26,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2025-03-15 02:28:26,731 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 668 [2025-03-15 02:28:26,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 714 places, 913 transitions, 6930 flow. Second operand has 25 states, 25 states have (on average 508.92) internal successors, (12723), 25 states have internal predecessors, (12723), 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:28:26,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:26,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 668 [2025-03-15 02:28:26,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:31,552 INFO L124 PetriNetUnfolderBase]: 2348/20992 cut-off events. [2025-03-15 02:28:31,552 INFO L125 PetriNetUnfolderBase]: For 40966/43465 co-relation queries the response was YES. [2025-03-15 02:28:31,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37744 conditions, 20992 events. 2348/20992 cut-off events. For 40966/43465 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 279613 event pairs, 1440 based on Foata normal form. 0/17584 useless extension candidates. Maximal degree in co-relation 16550. Up to 2600 conditions per place. [2025-03-15 02:28:31,780 INFO L140 encePairwiseOnDemand]: 623/668 looper letters, 591 selfloop transitions, 143 changer transitions 26/1222 dead transitions. [2025-03-15 02:28:31,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 747 places, 1222 transitions, 11876 flow [2025-03-15 02:28:31,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-15 02:28:31,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-03-15 02:28:31,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 18921 transitions. [2025-03-15 02:28:31,788 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7655364945784108 [2025-03-15 02:28:31,789 INFO L298 CegarLoopForPetriNet]: 637 programPoint places, 110 predicate places. [2025-03-15 02:28:31,789 INFO L471 AbstractCegarLoop]: Abstraction has has 747 places, 1222 transitions, 11876 flow [2025-03-15 02:28:31,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 508.92) internal successors, (12723), 25 states have internal predecessors, (12723), 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:28:31,792 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:31,793 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:28:31,799 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:28:31,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-15 02:28:31,993 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-15 02:28:31,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:31,994 INFO L85 PathProgramCache]: Analyzing trace with hash 198038793, now seen corresponding path program 1 times [2025-03-15 02:28:31,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:31,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368033984] [2025-03-15 02:28:31,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:31,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:32,116 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-15 02:28:32,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:32,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368033984] [2025-03-15 02:28:32,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368033984] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:28:32,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674589871] [2025-03-15 02:28:32,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:32,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:32,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:28:32,121 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:28:32,123 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:28:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:32,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 02:28:32,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:28:32,374 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-15 02:28:32,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:28:32,415 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-15 02:28:32,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674589871] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:28:32,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:28:32,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-15 02:28:32,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98669663] [2025-03-15 02:28:32,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:28:32,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-15 02:28:32,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:32,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-15 02:28:32,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-15 02:28:32,420 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 668 [2025-03-15 02:28:32,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 747 places, 1222 transitions, 11876 flow. Second operand has 12 states, 12 states have (on average 598.8333333333334) internal successors, (7186), 12 states have internal predecessors, (7186), 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:28:32,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:32,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 668 [2025-03-15 02:28:32,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:36,760 INFO L124 PetriNetUnfolderBase]: 2363/21167 cut-off events. [2025-03-15 02:28:36,760 INFO L125 PetriNetUnfolderBase]: For 47102/49601 co-relation queries the response was YES. [2025-03-15 02:28:36,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38711 conditions, 21167 events. 2363/21167 cut-off events. For 47102/49601 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 281379 event pairs, 1440 based on Foata normal form. 0/17744 useless extension candidates. Maximal degree in co-relation 16690. Up to 2600 conditions per place. [2025-03-15 02:28:37,042 INFO L140 encePairwiseOnDemand]: 647/668 looper letters, 173 selfloop transitions, 96 changer transitions 26/1352 dead transitions. [2025-03-15 02:28:37,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 760 places, 1352 transitions, 13198 flow [2025-03-15 02:28:37,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 02:28:37,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 02:28:37,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 8503 transitions. [2025-03-15 02:28:37,047 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9092172797262618 [2025-03-15 02:28:37,047 INFO L298 CegarLoopForPetriNet]: 637 programPoint places, 123 predicate places. [2025-03-15 02:28:37,047 INFO L471 AbstractCegarLoop]: Abstraction has has 760 places, 1352 transitions, 13198 flow [2025-03-15 02:28:37,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 598.8333333333334) internal successors, (7186), 12 states have internal predecessors, (7186), 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:28:37,052 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:37,052 INFO L221 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:37,059 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:28:37,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-15 02:28:37,253 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-15 02:28:37,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:37,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1998731977, now seen corresponding path program 2 times [2025-03-15 02:28:37,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:37,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125946917] [2025-03-15 02:28:37,254 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:28:37,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:37,277 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:28:37,277 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:28:37,487 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2025-03-15 02:28:37,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:37,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125946917] [2025-03-15 02:28:37,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125946917] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:28:37,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493232868] [2025-03-15 02:28:37,488 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:28:37,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:37,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:28:37,490 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:28:37,491 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:28:37,576 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:28:37,577 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:28:37,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-15 02:28:37,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:28:37,690 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2025-03-15 02:28:37,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:28:37,805 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2025-03-15 02:28:37,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493232868] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:28:37,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:28:37,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-15 02:28:37,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749684989] [2025-03-15 02:28:37,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:28:37,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 02:28:37,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:37,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 02:28:37,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-15 02:28:37,808 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 668 [2025-03-15 02:28:37,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 760 places, 1352 transitions, 13198 flow. Second operand has 7 states, 7 states have (on average 565.1428571428571) internal successors, (3956), 7 states have internal predecessors, (3956), 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:28:37,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:37,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 668 [2025-03-15 02:28:37,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:41,806 INFO L124 PetriNetUnfolderBase]: 2363/21165 cut-off events. [2025-03-15 02:28:41,806 INFO L125 PetriNetUnfolderBase]: For 55374/57899 co-relation queries the response was YES. [2025-03-15 02:28:41,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40209 conditions, 21165 events. 2363/21165 cut-off events. For 55374/57899 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 281379 event pairs, 1440 based on Foata normal form. 0/17744 useless extension candidates. Maximal degree in co-relation 17166. Up to 2600 conditions per place. [2025-03-15 02:28:41,988 INFO L140 encePairwiseOnDemand]: 641/668 looper letters, 391 selfloop transitions, 176 changer transitions 26/1350 dead transitions. [2025-03-15 02:28:41,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 774 places, 1350 transitions, 14308 flow [2025-03-15 02:28:41,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-15 02:28:41,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-15 02:28:41,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 9039 transitions. [2025-03-15 02:28:41,992 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8457148203592815 [2025-03-15 02:28:41,992 INFO L298 CegarLoopForPetriNet]: 637 programPoint places, 137 predicate places. [2025-03-15 02:28:41,992 INFO L471 AbstractCegarLoop]: Abstraction has has 774 places, 1350 transitions, 14308 flow [2025-03-15 02:28:41,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 565.1428571428571) internal successors, (3956), 7 states have internal predecessors, (3956), 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:28:41,993 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:41,993 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:28:42,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-15 02:28:42,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:42,194 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-15 02:28:42,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:42,195 INFO L85 PathProgramCache]: Analyzing trace with hash 976373846, now seen corresponding path program 2 times [2025-03-15 02:28:42,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:42,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783266684] [2025-03-15 02:28:42,195 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:28:42,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:42,218 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:28:42,218 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:28:42,334 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-15 02:28:42,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:42,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783266684] [2025-03-15 02:28:42,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783266684] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:28:42,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753127439] [2025-03-15 02:28:42,335 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:28:42,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:42,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:28:42,339 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:28:42,348 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:28:42,442 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:28:42,443 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:28:42,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-15 02:28:42,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:28:42,590 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-15 02:28:42,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:28:42,758 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-15 02:28:42,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753127439] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:28:42,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:28:42,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-15 02:28:42,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803644438] [2025-03-15 02:28:42,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:28:42,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 02:28:42,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:42,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 02:28:42,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-15 02:28:42,762 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 668 [2025-03-15 02:28:42,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 774 places, 1350 transitions, 14308 flow. Second operand has 7 states, 7 states have (on average 565.8571428571429) internal successors, (3961), 7 states have internal predecessors, (3961), 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:28:42,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:42,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 668 [2025-03-15 02:28:42,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:47,288 INFO L124 PetriNetUnfolderBase]: 2363/21164 cut-off events. [2025-03-15 02:28:47,289 INFO L125 PetriNetUnfolderBase]: For 58746/61483 co-relation queries the response was YES. [2025-03-15 02:28:47,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41497 conditions, 21164 events. 2363/21164 cut-off events. For 58746/61483 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 281324 event pairs, 1440 based on Foata normal form. 0/17744 useless extension candidates. Maximal degree in co-relation 17663. Up to 2600 conditions per place. [2025-03-15 02:28:47,468 INFO L140 encePairwiseOnDemand]: 638/668 looper letters, 228 selfloop transitions, 93 changer transitions 26/1349 dead transitions. [2025-03-15 02:28:47,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 785 places, 1349 transitions, 14946 flow [2025-03-15 02:28:47,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 02:28:47,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 02:28:47,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 7402 transitions. [2025-03-15 02:28:47,471 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8523721787194841 [2025-03-15 02:28:47,472 INFO L298 CegarLoopForPetriNet]: 637 programPoint places, 148 predicate places. [2025-03-15 02:28:47,472 INFO L471 AbstractCegarLoop]: Abstraction has has 785 places, 1349 transitions, 14946 flow [2025-03-15 02:28:47,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 565.8571428571429) internal successors, (3961), 7 states have internal predecessors, (3961), 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:28:47,473 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:47,473 INFO L221 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:47,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-15 02:28:47,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-15 02:28:47,674 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-15 02:28:47,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:47,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1030509972, now seen corresponding path program 1 times [2025-03-15 02:28:47,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:47,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544796006] [2025-03-15 02:28:47,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:47,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:48,271 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 0 proven. 530 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:28:48,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:48,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544796006] [2025-03-15 02:28:48,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544796006] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:28:48,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293138500] [2025-03-15 02:28:48,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:48,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:48,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:28:48,275 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:28:48,276 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:28:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:48,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-15 02:28:48,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:28:48,492 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 0 proven. 530 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:28:48,492 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:28:48,856 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 0 proven. 530 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:28:48,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293138500] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:28:48,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:28:48,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 47 [2025-03-15 02:28:48,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249526437] [2025-03-15 02:28:48,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:28:48,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-15 02:28:48,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:48,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-15 02:28:48,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2025-03-15 02:28:48,866 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 668 [2025-03-15 02:28:48,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 785 places, 1349 transitions, 14946 flow. Second operand has 48 states, 48 states have (on average 599.6875) internal successors, (28785), 48 states have internal predecessors, (28785), 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:28:48,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:48,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 668 [2025-03-15 02:28:48,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:54,681 INFO L124 PetriNetUnfolderBase]: 2423/21884 cut-off events. [2025-03-15 02:28:54,682 INFO L125 PetriNetUnfolderBase]: For 70810/73547 co-relation queries the response was YES. [2025-03-15 02:28:54,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47680 conditions, 21884 events. 2423/21884 cut-off events. For 70810/73547 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 290083 event pairs, 1440 based on Foata normal form. 0/18404 useless extension candidates. Maximal degree in co-relation 17803. Up to 2600 conditions per place. [2025-03-15 02:28:54,964 INFO L140 encePairwiseOnDemand]: 649/668 looper letters, 611 selfloop transitions, 449 changer transitions 26/1889 dead transitions. [2025-03-15 02:28:54,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 852 places, 1889 transitions, 26430 flow [2025-03-15 02:28:54,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-03-15 02:28:54,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2025-03-15 02:28:54,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 41172 transitions. [2025-03-15 02:28:54,985 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9063930961606199 [2025-03-15 02:28:54,985 INFO L298 CegarLoopForPetriNet]: 637 programPoint places, 215 predicate places. [2025-03-15 02:28:54,985 INFO L471 AbstractCegarLoop]: Abstraction has has 852 places, 1889 transitions, 26430 flow [2025-03-15 02:28:54,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 599.6875) internal successors, (28785), 48 states have internal predecessors, (28785), 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:28:54,988 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:54,989 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:54,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-15 02:28:55,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-15 02:28:55,189 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-15 02:28:55,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:55,190 INFO L85 PathProgramCache]: Analyzing trace with hash -985494783, now seen corresponding path program 1 times [2025-03-15 02:28:55,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:55,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900618078] [2025-03-15 02:28:55,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:55,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:55,500 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-03-15 02:28:55,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:55,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900618078] [2025-03-15 02:28:55,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900618078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:28:55,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:28:55,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 02:28:55,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262163830] [2025-03-15 02:28:55,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:28:55,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 02:28:55,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:55,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 02:28:55,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 02:28:55,503 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 668 [2025-03-15 02:28:55,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 852 places, 1889 transitions, 26430 flow. Second operand has 9 states, 9 states have (on average 540.3333333333334) internal successors, (4863), 9 states have internal predecessors, (4863), 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:28:55,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:55,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 668 [2025-03-15 02:28:55,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:29:05,606 INFO L124 PetriNetUnfolderBase]: 4857/44308 cut-off events. [2025-03-15 02:29:05,606 INFO L125 PetriNetUnfolderBase]: For 165514/171007 co-relation queries the response was YES. [2025-03-15 02:29:05,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93814 conditions, 44308 events. 4857/44308 cut-off events. For 165514/171007 co-relation queries the response was YES. Maximal size of possible extension queue 979. Compared 673727 event pairs, 2880 based on Foata normal form. 0/37130 useless extension candidates. Maximal degree in co-relation 27365. Up to 5188 conditions per place. [2025-03-15 02:29:06,186 INFO L140 encePairwiseOnDemand]: 653/668 looper letters, 1411 selfloop transitions, 32 changer transitions 28/2360 dead transitions. [2025-03-15 02:29:06,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 863 places, 2360 transitions, 37250 flow [2025-03-15 02:29:06,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-15 02:29:06,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-15 02:29:06,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6579 transitions. [2025-03-15 02:29:06,191 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8207335329341318 [2025-03-15 02:29:06,191 INFO L298 CegarLoopForPetriNet]: 637 programPoint places, 226 predicate places. [2025-03-15 02:29:06,191 INFO L471 AbstractCegarLoop]: Abstraction has has 863 places, 2360 transitions, 37250 flow [2025-03-15 02:29:06,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 540.3333333333334) internal successors, (4863), 9 states have internal predecessors, (4863), 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:29:06,192 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:29:06,192 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:06,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 02:29:06,192 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-15 02:29:06,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:29:06,193 INFO L85 PathProgramCache]: Analyzing trace with hash -2076811144, now seen corresponding path program 1 times [2025-03-15 02:29:06,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:29:06,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193502488] [2025-03-15 02:29:06,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:29:06,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:29:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:29:06,410 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-03-15 02:29:06,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:29:06,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193502488] [2025-03-15 02:29:06,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193502488] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:29:06,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320329449] [2025-03-15 02:29:06,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:29:06,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:29:06,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:29:06,412 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:29:06,414 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:29:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:29:06,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-15 02:29:06,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:29:06,663 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-03-15 02:29:06,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:29:06,840 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-03-15 02:29:06,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320329449] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-15 02:29:06,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-15 02:29:06,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 16 [2025-03-15 02:29:06,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181765628] [2025-03-15 02:29:06,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:29:06,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 02:29:06,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:29:06,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 02:29:06,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-03-15 02:29:06,845 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 668 [2025-03-15 02:29:06,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 863 places, 2360 transitions, 37250 flow. Second operand has 9 states, 9 states have (on average 540.6666666666666) internal successors, (4866), 9 states have internal predecessors, (4866), 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:29:06,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:29:06,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 668 [2025-03-15 02:29:06,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:29:17,333 INFO L124 PetriNetUnfolderBase]: 4853/44294 cut-off events. [2025-03-15 02:29:17,334 INFO L125 PetriNetUnfolderBase]: For 178800/184717 co-relation queries the response was YES. [2025-03-15 02:29:17,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97182 conditions, 44294 events. 4853/44294 cut-off events. For 178800/184717 co-relation queries the response was YES. Maximal size of possible extension queue 979. Compared 673243 event pairs, 2880 based on Foata normal form. 0/37120 useless extension candidates. Maximal degree in co-relation 28918. Up to 5188 conditions per place. [2025-03-15 02:29:18,012 INFO L140 encePairwiseOnDemand]: 650/668 looper letters, 1327 selfloop transitions, 106 changer transitions 28/2350 dead transitions. [2025-03-15 02:29:18,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 871 places, 2350 transitions, 40004 flow [2025-03-15 02:29:18,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 02:29:18,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 02:29:18,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5440 transitions. [2025-03-15 02:29:18,016 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8143712574850299 [2025-03-15 02:29:18,016 INFO L298 CegarLoopForPetriNet]: 637 programPoint places, 234 predicate places. [2025-03-15 02:29:18,016 INFO L471 AbstractCegarLoop]: Abstraction has has 871 places, 2350 transitions, 40004 flow [2025-03-15 02:29:18,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 540.6666666666666) internal successors, (4866), 9 states have internal predecessors, (4866), 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:29:18,017 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:29:18,017 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:18,023 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:29:18,218 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:29:18,218 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-15 02:29:18,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:29:18,220 INFO L85 PathProgramCache]: Analyzing trace with hash 468911719, now seen corresponding path program 1 times [2025-03-15 02:29:18,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:29:18,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861362509] [2025-03-15 02:29:18,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:29:18,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:29:18,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:29:18,509 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-15 02:29:18,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:29:18,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861362509] [2025-03-15 02:29:18,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861362509] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:29:18,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823371546] [2025-03-15 02:29:18,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:29:18,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:29:18,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:29:18,511 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:29:18,514 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:29:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:29:18,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-15 02:29:18,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:29:18,840 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 41 proven. 1 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-15 02:29:18,841 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:29:19,050 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 41 proven. 1 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-15 02:29:19,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823371546] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:29:19,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:29:19,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 26 [2025-03-15 02:29:19,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480410851] [2025-03-15 02:29:19,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:29:19,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-15 02:29:19,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:29:19,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-15 02:29:19,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2025-03-15 02:29:19,055 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 668 [2025-03-15 02:29:19,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 871 places, 2350 transitions, 40004 flow. Second operand has 26 states, 26 states have (on average 508.15384615384613) internal successors, (13212), 26 states have internal predecessors, (13212), 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:29:19,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:29:19,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 668 [2025-03-15 02:29:19,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:29:35,918 INFO L124 PetriNetUnfolderBase]: 7289/66749 cut-off events. [2025-03-15 02:29:35,919 INFO L125 PetriNetUnfolderBase]: For 306349/315242 co-relation queries the response was YES. [2025-03-15 02:29:36,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148682 conditions, 66749 events. 7289/66749 cut-off events. For 306349/315242 co-relation queries the response was YES. Maximal size of possible extension queue 1388. Compared 1080981 event pairs, 4320 based on Foata normal form. 0/55889 useless extension candidates. Maximal degree in co-relation 42207. Up to 7778 conditions per place. [2025-03-15 02:29:37,067 INFO L140 encePairwiseOnDemand]: 636/668 looper letters, 1933 selfloop transitions, 590 changer transitions 30/3023 dead transitions. [2025-03-15 02:29:37,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 895 places, 3023 transitions, 58044 flow [2025-03-15 02:29:37,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-15 02:29:37,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-15 02:29:37,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 12810 transitions. [2025-03-15 02:29:37,079 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.767065868263473 [2025-03-15 02:29:37,079 INFO L298 CegarLoopForPetriNet]: 637 programPoint places, 258 predicate places. [2025-03-15 02:29:37,080 INFO L471 AbstractCegarLoop]: Abstraction has has 895 places, 3023 transitions, 58044 flow [2025-03-15 02:29:37,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 508.15384615384613) internal successors, (13212), 26 states have internal predecessors, (13212), 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:29:37,081 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:29:37,081 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:29:37,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-15 02:29:37,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-15 02:29:37,282 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-15 02:29:37,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:29:37,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1531393360, now seen corresponding path program 1 times [2025-03-15 02:29:37,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:29:37,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090653286] [2025-03-15 02:29:37,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:29:37,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:29:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:29:37,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 02:29:37,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:29:37,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090653286] [2025-03-15 02:29:37,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090653286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:29:37,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:29:37,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:29:37,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434343809] [2025-03-15 02:29:37,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:29:37,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:29:37,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:29:37,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:29:37,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:29:37,433 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 614 out of 668 [2025-03-15 02:29:37,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 895 places, 3023 transitions, 58044 flow. Second operand has 4 states, 4 states have (on average 615.5) internal successors, (2462), 4 states have internal predecessors, (2462), 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:29:37,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:29:37,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 614 of 668 [2025-03-15 02:29:37,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:04,527 INFO L124 PetriNetUnfolderBase]: 9362/79379 cut-off events. [2025-03-15 02:30:04,528 INFO L125 PetriNetUnfolderBase]: For 723964/733931 co-relation queries the response was YES. [2025-03-15 02:30:05,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209759 conditions, 79379 events. 9362/79379 cut-off events. For 723964/733931 co-relation queries the response was YES. Maximal size of possible extension queue 1776. Compared 1335223 event pairs, 5041 based on Foata normal form. 0/66708 useless extension candidates. Maximal degree in co-relation 49711. Up to 9595 conditions per place. [2025-03-15 02:30:06,018 INFO L140 encePairwiseOnDemand]: 660/668 looper letters, 83 selfloop transitions, 5 changer transitions 30/3057 dead transitions. [2025-03-15 02:30:06,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 897 places, 3057 transitions, 59380 flow [2025-03-15 02:30:06,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:30:06,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:30:06,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2503 transitions. [2025-03-15 02:30:06,020 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.936751497005988 [2025-03-15 02:30:06,020 INFO L298 CegarLoopForPetriNet]: 637 programPoint places, 260 predicate places. [2025-03-15 02:30:06,020 INFO L471 AbstractCegarLoop]: Abstraction has has 897 places, 3057 transitions, 59380 flow [2025-03-15 02:30:06,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 615.5) internal successors, (2462), 4 states have internal predecessors, (2462), 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:30:06,021 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:06,021 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:30:06,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-15 02:30:06,021 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-15 02:30:06,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:06,022 INFO L85 PathProgramCache]: Analyzing trace with hash 228555481, now seen corresponding path program 1 times [2025-03-15 02:30:06,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:06,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777388277] [2025-03-15 02:30:06,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:06,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:06,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:06,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 02:30:06,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:06,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777388277] [2025-03-15 02:30:06,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777388277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:30:06,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:30:06,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 02:30:06,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940880700] [2025-03-15 02:30:06,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:30:06,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:30:06,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:06,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:30:06,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:30:06,220 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 463 out of 668 [2025-03-15 02:30:06,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 897 places, 3057 transitions, 59380 flow. Second operand has 8 states, 8 states have (on average 479.875) internal successors, (3839), 8 states have internal predecessors, (3839), 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:30:06,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:06,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 463 of 668 [2025-03-15 02:30:06,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:29,453 INFO L124 PetriNetUnfolderBase]: 9356/79349 cut-off events. [2025-03-15 02:30:29,453 INFO L125 PetriNetUnfolderBase]: For 788567/802369 co-relation queries the response was YES. [2025-03-15 02:30:30,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216048 conditions, 79349 events. 9356/79349 cut-off events. For 788567/802369 co-relation queries the response was YES. Maximal size of possible extension queue 1776. Compared 1334326 event pairs, 5041 based on Foata normal form. 0/66684 useless extension candidates. Maximal degree in co-relation 51564. Up to 9595 conditions per place. [2025-03-15 02:30:31,215 INFO L140 encePairwiseOnDemand]: 656/668 looper letters, 1455 selfloop transitions, 41 changer transitions 30/3039 dead transitions. [2025-03-15 02:30:31,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 902 places, 3039 transitions, 61962 flow [2025-03-15 02:30:31,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 02:30:31,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 02:30:31,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 3886 transitions. [2025-03-15 02:30:31,217 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7271706586826348 [2025-03-15 02:30:31,217 INFO L298 CegarLoopForPetriNet]: 637 programPoint places, 265 predicate places. [2025-03-15 02:30:31,217 INFO L471 AbstractCegarLoop]: Abstraction has has 902 places, 3039 transitions, 61962 flow [2025-03-15 02:30:31,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 479.875) internal successors, (3839), 8 states have internal predecessors, (3839), 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:30:31,218 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:31,218 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:30:31,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-15 02:30:31,218 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-15 02:30:31,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:31,219 INFO L85 PathProgramCache]: Analyzing trace with hash 73516458, now seen corresponding path program 1 times [2025-03-15 02:30:31,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:31,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373785003] [2025-03-15 02:30:31,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:31,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:31,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 02:30:31,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:31,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373785003] [2025-03-15 02:30:31,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373785003] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:30:31,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901566894] [2025-03-15 02:30:31,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:31,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:30:31,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:30:31,358 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:30:31,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-15 02:30:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:31,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-15 02:30:31,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:30:31,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 02:30:31,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:30:31,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 02:30:31,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901566894] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-15 02:30:31,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-15 02:30:31,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 16 [2025-03-15 02:30:31,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941257593] [2025-03-15 02:30:31,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:30:31,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 02:30:31,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:31,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 02:30:31,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-03-15 02:30:31,767 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 668 [2025-03-15 02:30:31,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 902 places, 3039 transitions, 61962 flow. Second operand has 9 states, 9 states have (on average 542.3333333333334) internal successors, (4881), 9 states have internal predecessors, (4881), 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:30:31,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:31,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 668 [2025-03-15 02:30:31,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:55,587 INFO L124 PetriNetUnfolderBase]: 9350/79319 cut-off events. [2025-03-15 02:30:55,587 INFO L125 PetriNetUnfolderBase]: For 862145/877539 co-relation queries the response was YES. [2025-03-15 02:30:56,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222491 conditions, 79319 events. 9350/79319 cut-off events. For 862145/877539 co-relation queries the response was YES. Maximal size of possible extension queue 1773. Compared 1332333 event pairs, 5041 based on Foata normal form. 0/66660 useless extension candidates. Maximal degree in co-relation 53613. Up to 9595 conditions per place. [2025-03-15 02:30:57,048 INFO L140 encePairwiseOnDemand]: 646/668 looper letters, 1579 selfloop transitions, 306 changer transitions 30/3021 dead transitions. [2025-03-15 02:30:57,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 912 places, 3021 transitions, 65456 flow [2025-03-15 02:30:57,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-15 02:30:57,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-15 02:30:57,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 5973 transitions. [2025-03-15 02:30:57,052 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.812874251497006 [2025-03-15 02:30:57,052 INFO L298 CegarLoopForPetriNet]: 637 programPoint places, 275 predicate places. [2025-03-15 02:30:57,052 INFO L471 AbstractCegarLoop]: Abstraction has has 912 places, 3021 transitions, 65456 flow [2025-03-15 02:30:57,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 542.3333333333334) internal successors, (4881), 9 states have internal predecessors, (4881), 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:30:57,053 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:57,053 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:30:57,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-15 02:30:57,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-15 02:30:57,254 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-15 02:30:57,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:57,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1354368431, now seen corresponding path program 1 times [2025-03-15 02:30:57,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:57,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572180401] [2025-03-15 02:30:57,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:57,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:57,608 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 64 proven. 40 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-15 02:30:57,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:57,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572180401] [2025-03-15 02:30:57,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572180401] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:30:57,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707528672] [2025-03-15 02:30:57,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:57,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:30:57,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:30:57,612 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:30:57,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-15 02:30:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:57,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-15 02:30:57,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:30:58,090 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 68 proven. 12 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-15 02:30:58,090 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:30:58,437 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 68 proven. 12 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-15 02:30:58,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707528672] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:30:58,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:30:58,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 40 [2025-03-15 02:30:58,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52659790] [2025-03-15 02:30:58,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:30:58,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-15 02:30:58,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:58,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-15 02:30:58,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1378, Unknown=0, NotChecked=0, Total=1560 [2025-03-15 02:30:58,447 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 668 [2025-03-15 02:30:58,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 912 places, 3021 transitions, 65456 flow. Second operand has 40 states, 40 states have (on average 507.775) internal successors, (20311), 40 states have internal predecessors, (20311), 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:30:58,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:58,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 668 [2025-03-15 02:30:58,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:31:32,309 INFO L124 PetriNetUnfolderBase]: 12394/105352 cut-off events. [2025-03-15 02:31:32,309 INFO L125 PetriNetUnfolderBase]: For 1256834/1276916 co-relation queries the response was YES. [2025-03-15 02:31:33,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303033 conditions, 105352 events. 12394/105352 cut-off events. For 1256834/1276916 co-relation queries the response was YES. Maximal size of possible extension queue 2139. Compared 1827381 event pairs, 6689 based on Foata normal form. 0/88553 useless extension candidates. Maximal degree in co-relation 72230. Up to 12681 conditions per place. [2025-03-15 02:31:34,740 INFO L140 encePairwiseOnDemand]: 632/668 looper letters, 2092 selfloop transitions, 1104 changer transitions 32/3708 dead transitions. [2025-03-15 02:31:34,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 948 places, 3708 transitions, 88228 flow [2025-03-15 02:31:34,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-15 02:31:34,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-03-15 02:31:34,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 18865 transitions. [2025-03-15 02:31:34,749 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7632707557857259 [2025-03-15 02:31:34,751 INFO L298 CegarLoopForPetriNet]: 637 programPoint places, 311 predicate places. [2025-03-15 02:31:34,751 INFO L471 AbstractCegarLoop]: Abstraction has has 948 places, 3708 transitions, 88228 flow [2025-03-15 02:31:34,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 507.775) internal successors, (20311), 40 states have internal predecessors, (20311), 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:31:34,753 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:31:34,754 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:31:34,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-15 02:31:34,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-15 02:31:34,954 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-15 02:31:34,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:31:34,956 INFO L85 PathProgramCache]: Analyzing trace with hash -434000690, now seen corresponding path program 1 times [2025-03-15 02:31:34,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:31:34,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692150263] [2025-03-15 02:31:34,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:31:34,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:31:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:31:35,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-15 02:31:35,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:31:35,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692150263] [2025-03-15 02:31:35,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692150263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:31:35,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:31:35,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 02:31:35,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80378300] [2025-03-15 02:31:35,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:31:35,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:31:35,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:31:35,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:31:35,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:31:35,301 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 463 out of 668 [2025-03-15 02:31:35,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 948 places, 3708 transitions, 88228 flow. Second operand has 8 states, 8 states have (on average 480.625) internal successors, (3845), 8 states have internal predecessors, (3845), 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:31:35,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:31:35,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 463 of 668 [2025-03-15 02:31:35,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:32:03,420 INFO L124 PetriNetUnfolderBase]: 9352/79369 cut-off events. [2025-03-15 02:32:03,420 INFO L125 PetriNetUnfolderBase]: For 1042814/1058604 co-relation queries the response was YES. [2025-03-15 02:32:04,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236354 conditions, 79369 events. 9352/79369 cut-off events. For 1042814/1058604 co-relation queries the response was YES. Maximal size of possible extension queue 1772. Compared 1332295 event pairs, 5041 based on Foata normal form. 0/66708 useless extension candidates. Maximal degree in co-relation 59024. Up to 9595 conditions per place. [2025-03-15 02:32:05,123 INFO L140 encePairwiseOnDemand]: 656/668 looper letters, 1483 selfloop transitions, 25 changer transitions 30/3240 dead transitions. [2025-03-15 02:32:05,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 944 places, 3240 transitions, 77818 flow [2025-03-15 02:32:05,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 02:32:05,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 02:32:05,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 3886 transitions. [2025-03-15 02:32:05,125 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7271706586826348 [2025-03-15 02:32:05,128 INFO L298 CegarLoopForPetriNet]: 637 programPoint places, 307 predicate places. [2025-03-15 02:32:05,128 INFO L471 AbstractCegarLoop]: Abstraction has has 944 places, 3240 transitions, 77818 flow [2025-03-15 02:32:05,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 480.625) internal successors, (3845), 8 states have internal predecessors, (3845), 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:32:05,128 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:32:05,128 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:32:05,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-15 02:32:05,129 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-15 02:32:05,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:32:05,130 INFO L85 PathProgramCache]: Analyzing trace with hash -2098669530, now seen corresponding path program 2 times [2025-03-15 02:32:05,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:32:05,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709570769] [2025-03-15 02:32:05,130 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:32:05,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:32:05,156 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:32:05,156 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:32:05,244 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-15 02:32:05,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:32:05,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709570769] [2025-03-15 02:32:05,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709570769] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:32:05,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112249059] [2025-03-15 02:32:05,244 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:32:05,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:32:05,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:32:05,255 INFO L229 MonitoredProcess]: Starting monitored process 15 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:32:05,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-15 02:32:05,448 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:32:05,448 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:32:05,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-15 02:32:05,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:32:05,637 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-15 02:32:05,637 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:32:05,805 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-15 02:32:05,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112249059] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:32:05,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:32:05,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-15 02:32:05,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424475950] [2025-03-15 02:32:05,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:32:05,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 02:32:05,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:32:05,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 02:32:05,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-15 02:32:05,808 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 668 [2025-03-15 02:32:05,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 944 places, 3240 transitions, 77818 flow. Second operand has 7 states, 7 states have (on average 568.2857142857143) internal successors, (3978), 7 states have internal predecessors, (3978), 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:32:05,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:32:05,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 668 [2025-03-15 02:32:05,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:32:34,380 INFO L124 PetriNetUnfolderBase]: 9352/79367 cut-off events. [2025-03-15 02:32:34,380 INFO L125 PetriNetUnfolderBase]: For 1133110/1149008 co-relation queries the response was YES. [2025-03-15 02:32:35,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241656 conditions, 79367 events. 9352/79367 cut-off events. For 1133110/1149008 co-relation queries the response was YES. Maximal size of possible extension queue 1772. Compared 1332143 event pairs, 5041 based on Foata normal form. 0/66708 useless extension candidates. Maximal degree in co-relation 60121. Up to 9595 conditions per place. [2025-03-15 02:32:36,203 INFO L140 encePairwiseOnDemand]: 644/668 looper letters, 585 selfloop transitions, 212 changer transitions 30/3238 dead transitions. [2025-03-15 02:32:36,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 953 places, 3238 transitions, 79396 flow [2025-03-15 02:32:36,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-15 02:32:36,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-15 02:32:36,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6271 transitions. [2025-03-15 02:32:36,206 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8534295046271094 [2025-03-15 02:32:36,206 INFO L298 CegarLoopForPetriNet]: 637 programPoint places, 316 predicate places. [2025-03-15 02:32:36,206 INFO L471 AbstractCegarLoop]: Abstraction has has 953 places, 3238 transitions, 79396 flow [2025-03-15 02:32:36,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 568.2857142857143) internal successors, (3978), 7 states have internal predecessors, (3978), 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:32:36,207 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:32:36,207 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:32:36,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-15 02:32:36,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:32:36,408 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-15 02:32:36,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:32:36,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1318024699, now seen corresponding path program 1 times [2025-03-15 02:32:36,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:32:36,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034316469] [2025-03-15 02:32:36,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:32:36,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:32:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:32:36,682 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-15 02:32:36,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:32:36,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034316469] [2025-03-15 02:32:36,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034316469] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:32:36,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811843822] [2025-03-15 02:32:36,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:32:36,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:32:36,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:32:36,684 INFO L229 MonitoredProcess]: Starting monitored process 16 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:32:36,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-15 02:32:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:32:36,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-15 02:32:36,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:32:37,146 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-15 02:32:37,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:32:37,354 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-15 02:32:37,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811843822] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-15 02:32:37,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-15 02:32:37,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 16 [2025-03-15 02:32:37,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682915634] [2025-03-15 02:32:37,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:32:37,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 02:32:37,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:32:37,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 02:32:37,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-03-15 02:32:37,359 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 668 [2025-03-15 02:32:37,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 953 places, 3238 transitions, 79396 flow. Second operand has 9 states, 9 states have (on average 543.4444444444445) internal successors, (4891), 9 states have internal predecessors, (4891), 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:32:37,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:32:37,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 668 [2025-03-15 02:32:37,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:33:08,162 INFO L124 PetriNetUnfolderBase]: 9346/79337 cut-off events. [2025-03-15 02:33:08,163 INFO L125 PetriNetUnfolderBase]: For 1237211/1253217 co-relation queries the response was YES. [2025-03-15 02:33:09,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247870 conditions, 79337 events. 9346/79337 cut-off events. For 1237211/1253217 co-relation queries the response was YES. Maximal size of possible extension queue 1772. Compared 1330580 event pairs, 5041 based on Foata normal form. 0/66684 useless extension candidates. Maximal degree in co-relation 62130. Up to 9595 conditions per place. [2025-03-15 02:33:10,078 INFO L140 encePairwiseOnDemand]: 648/668 looper letters, 1699 selfloop transitions, 206 changer transitions 30/3220 dead transitions. [2025-03-15 02:33:10,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 955 places, 3220 transitions, 82822 flow [2025-03-15 02:33:10,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-15 02:33:10,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-15 02:33:10,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 5973 transitions. [2025-03-15 02:33:10,081 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.812874251497006 [2025-03-15 02:33:10,082 INFO L298 CegarLoopForPetriNet]: 637 programPoint places, 318 predicate places. [2025-03-15 02:33:10,082 INFO L471 AbstractCegarLoop]: Abstraction has has 955 places, 3220 transitions, 82822 flow [2025-03-15 02:33:10,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 543.4444444444445) internal successors, (4891), 9 states have internal predecessors, (4891), 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:33:10,082 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:33:10,083 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:33:10,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-15 02:33:10,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-15 02:33:10,283 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-03-15 02:33:10,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:33:10,285 INFO L85 PathProgramCache]: Analyzing trace with hash 897003137, now seen corresponding path program 1 times [2025-03-15 02:33:10,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:33:10,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119279719] [2025-03-15 02:33:10,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:33:10,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:33:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:33:12,931 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:33:12,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:33:12,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119279719] [2025-03-15 02:33:12,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119279719] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:33:12,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257196653] [2025-03-15 02:33:12,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:33:12,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:33:12,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:33:12,933 INFO L229 MonitoredProcess]: Starting monitored process 17 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:33:12,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-15 02:33:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:33:13,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-15 02:33:13,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:33:13,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-15 02:33:13,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-15 02:33:13,654 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-15 02:33:13,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-15 02:33:13,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-15 02:33:13,944 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-15 02:33:13,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-15 02:33:14,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-15 02:33:14,231 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-15 02:33:14,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-15 02:33:14,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-15 02:33:14,433 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-15 02:33:14,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-15 02:33:14,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-15 02:33:14,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-15 02:33:14,651 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:33:14,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:33:14,869 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_771 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_#t~malloc55#1.base| v_ArrVal_771) c_~get_5~0.base) (+ (* c_~id_3~0 4) c_~get_5~0.offset)) 9223372039002259456)) is different from false [2025-03-15 02:33:17,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 02:33:17,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-03-15 02:33:17,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 02:33:17,069 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 42 treesize of output 34 [2025-03-15 02:33:17,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-03-15 02:33:17,742 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:33:17,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257196653] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:33:17,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:33:17,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25, 28] total 74 [2025-03-15 02:33:17,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570073678] [2025-03-15 02:33:17,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:33:17,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2025-03-15 02:33:17,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:33:17,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2025-03-15 02:33:17,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=431, Invalid=4937, Unknown=38, NotChecked=144, Total=5550 [2025-03-15 02:33:17,763 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 668 [2025-03-15 02:33:17,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 955 places, 3220 transitions, 82822 flow. Second operand has 75 states, 75 states have (on average 364.50666666666666) internal successors, (27338), 75 states have internal predecessors, (27338), 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:33:17,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:33:17,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 668 [2025-03-15 02:33:17,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:33:37,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 02:33:39,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 02:33:41,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 02:34:03,079 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~id_3~0 4) c_~get_5~0.offset))) (and (forall ((|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc55#1.base_76| Int)) (or (forall ((v_ArrVal_771 (Array Int Int))) (< (select (select (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc55#1.base_76| v_ArrVal_771) c_~get_5~0.base) .cse0) 9223372039002259456)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc55#1.base_76|) 0)))) (forall ((v_ArrVal_771 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_#t~malloc55#1.base| v_ArrVal_771) c_~get_5~0.base) .cse0) 9223372039002259456)) (forall ((|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc55#1.base_76| Int) (v_ArrVal_771 (Array Int Int)) (v_ArrVal_770 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc55#1.base_76|) 0)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_#t~malloc55#1.base| v_ArrVal_770) |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc55#1.base_76| v_ArrVal_771) c_~get_5~0.base) .cse0) 9223372039002259456))))) is different from false [2025-03-15 02:35:49,678 INFO L124 PetriNetUnfolderBase]: 46311/199329 cut-off events. [2025-03-15 02:35:49,679 INFO L125 PetriNetUnfolderBase]: For 2782419/2791296 co-relation queries the response was YES. [2025-03-15 02:35:53,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 724463 conditions, 199329 events. 46311/199329 cut-off events. For 2782419/2791296 co-relation queries the response was YES. Maximal size of possible extension queue 4152. Compared 3360971 event pairs, 13782 based on Foata normal form. 0/171777 useless extension candidates. Maximal degree in co-relation 107820. Up to 44880 conditions per place.