/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.positions.where.we.compute.the.hoare.annotation All --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows ASSERTandASSUME -i ../../../trunk/examples/svcomp/pthread-complex/safestack_relacy.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:40:56,667 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:40:56,752 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-15 01:40:56,779 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:40:56,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:40:56,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:40:56,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:40:56,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:40:56,780 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:40:56,780 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:40:56,781 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:40:56,781 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:40:56,781 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:40:56,781 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:40:56,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:40:56,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:40:56,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:40:56,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:40:56,782 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:40:56,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:40:56,782 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:40:56,782 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:40:56,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:40:56,783 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:40:56,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:40:56,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:40:56,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:40:56,783 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:40:56,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:40:56,783 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:40:56,783 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:40:56,783 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:40:56,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 01:40:57,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:40:57,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:40:57,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:40:57,061 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:40:57,061 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:40:57,062 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-complex/safestack_relacy.i [2025-03-15 01:40:58,247 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2905cc768/5f1db82448884359a1958c90ef467d43/FLAGd4c6d6d30 [2025-03-15 01:40:58,568 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:40:58,571 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/safestack_relacy.i [2025-03-15 01:40:58,593 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2905cc768/5f1db82448884359a1958c90ef467d43/FLAGd4c6d6d30 [2025-03-15 01:40:58,609 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2905cc768/5f1db82448884359a1958c90ef467d43 [2025-03-15 01:40:58,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:40:58,614 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:40:58,615 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:40:58,615 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:40:58,618 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:40:58,618 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:40:58" (1/1) ... [2025-03-15 01:40:58,619 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24ef790c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:40:58, skipping insertion in model container [2025-03-15 01:40:58,619 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:40:58" (1/1) ... [2025-03-15 01:40:58,665 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:40:59,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:40:59,039 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:40:59,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:40:59,191 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:40:59,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:40:59 WrapperNode [2025-03-15 01:40:59,192 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:40:59,192 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:40:59,192 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:40:59,192 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:40:59,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:40:59" (1/1) ... [2025-03-15 01:40:59,210 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:40:59" (1/1) ... [2025-03-15 01:40:59,228 INFO L138 Inliner]: procedures = 458, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 176 [2025-03-15 01:40:59,228 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:40:59,229 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:40:59,229 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:40:59,229 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:40:59,235 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:40:59" (1/1) ... [2025-03-15 01:40:59,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:40:59" (1/1) ... [2025-03-15 01:40:59,239 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:40:59" (1/1) ... [2025-03-15 01:40:59,239 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:40:59" (1/1) ... [2025-03-15 01:40:59,246 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:40:59" (1/1) ... [2025-03-15 01:40:59,247 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:40:59" (1/1) ... [2025-03-15 01:40:59,249 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:40:59" (1/1) ... [2025-03-15 01:40:59,251 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:40:59" (1/1) ... [2025-03-15 01:40:59,251 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:40:59" (1/1) ... [2025-03-15 01:40:59,254 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:40:59,255 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:40:59,255 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:40:59,255 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:40:59,255 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:40:59" (1/1) ... [2025-03-15 01:40:59,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:40:59,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:40:59,283 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-15 01:40:59,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-15 01:40:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 01:40:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:40:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-15 01:40:59,301 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-15 01:40:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:40:59,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:40:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 01:40:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:40:59,302 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-15 01:40:59,483 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:40:59,484 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:40:59,699 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:40:59,700 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:40:59,756 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:40:59,757 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-03-15 01:40:59,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:40:59 BoogieIcfgContainer [2025-03-15 01:40:59,757 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:40:59,761 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:40:59,761 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:40:59,765 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:40:59,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:40:58" (1/3) ... [2025-03-15 01:40:59,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dce55fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:40:59, skipping insertion in model container [2025-03-15 01:40:59,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:40:59" (2/3) ... [2025-03-15 01:40:59,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dce55fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:40:59, skipping insertion in model container [2025-03-15 01:40:59,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:40:59" (3/3) ... [2025-03-15 01:40:59,767 INFO L128 eAbstractionObserver]: Analyzing ICFG safestack_relacy.i [2025-03-15 01:40:59,778 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:40:59,779 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG safestack_relacy.i that has 2 procedures, 164 locations, 1 initial locations, 7 loop locations, and 12 error locations. [2025-03-15 01:40:59,780 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:40:59,838 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-15 01:40:59,870 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:40:59,877 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;@51ce4946, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:40:59,878 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-15 01:40:59,899 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:40:59,899 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2025-03-15 01:40:59,902 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:40:59,903 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:40:59,903 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] [2025-03-15 01:40:59,903 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:40:59,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:40:59,907 INFO L85 PathProgramCache]: Analyzing trace with hash -2041559281, now seen corresponding path program 1 times [2025-03-15 01:40:59,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:40:59,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374402799] [2025-03-15 01:40:59,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:40:59,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:41:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:41:00,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:41:00,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:41:00,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374402799] [2025-03-15 01:41:00,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374402799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:41:00,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:41:00,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:41:00,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195839193] [2025-03-15 01:41:00,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:41:00,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:41:00,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:41:00,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:41:00,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:41:00,363 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 178 [2025-03-15 01:41:00,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 178 transitions, 363 flow. Second operand has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:00,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:41:00,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 178 [2025-03-15 01:41:00,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:41:00,465 INFO L124 PetriNetUnfolderBase]: 8/180 cut-off events. [2025-03-15 01:41:00,466 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-03-15 01:41:00,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 180 events. 8/180 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 306 event pairs, 0 based on Foata normal form. 3/163 useless extension candidates. Maximal degree in co-relation 113. Up to 14 conditions per place. [2025-03-15 01:41:00,471 INFO L140 encePairwiseOnDemand]: 164/178 looper letters, 23 selfloop transitions, 4 changer transitions 4/167 dead transitions. [2025-03-15 01:41:00,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 167 transitions, 395 flow [2025-03-15 01:41:00,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:41:00,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:41:00,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 601 transitions. [2025-03-15 01:41:00,481 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8441011235955056 [2025-03-15 01:41:00,485 INFO L298 CegarLoopForPetriNet]: 167 programPoint places, -2 predicate places. [2025-03-15 01:41:00,485 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 167 transitions, 395 flow [2025-03-15 01:41:00,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:00,486 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:41:00,486 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] [2025-03-15 01:41:00,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:41:00,486 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:41:00,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:41:00,487 INFO L85 PathProgramCache]: Analyzing trace with hash 939755337, now seen corresponding path program 1 times [2025-03-15 01:41:00,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:41:00,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117295667] [2025-03-15 01:41:00,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:41:00,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:41:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:41:00,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:41:00,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:41:00,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117295667] [2025-03-15 01:41:00,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117295667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:41:00,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:41:00,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:41:00,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646140990] [2025-03-15 01:41:00,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:41:00,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:41:00,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:41:00,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:41:00,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:41:00,605 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 178 [2025-03-15 01:41:00,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 167 transitions, 395 flow. Second operand has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:00,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:41:00,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 178 [2025-03-15 01:41:00,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:41:00,703 INFO L124 PetriNetUnfolderBase]: 9/197 cut-off events. [2025-03-15 01:41:00,703 INFO L125 PetriNetUnfolderBase]: For 21/24 co-relation queries the response was YES. [2025-03-15 01:41:00,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 197 events. 9/197 cut-off events. For 21/24 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 407 event pairs, 0 based on Foata normal form. 0/174 useless extension candidates. Maximal degree in co-relation 132. Up to 30 conditions per place. [2025-03-15 01:41:00,704 INFO L140 encePairwiseOnDemand]: 173/178 looper letters, 34 selfloop transitions, 3 changer transitions 4/176 dead transitions. [2025-03-15 01:41:00,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 176 transitions, 497 flow [2025-03-15 01:41:00,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:41:00,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:41:00,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2025-03-15 01:41:00,708 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8820224719101124 [2025-03-15 01:41:00,708 INFO L298 CegarLoopForPetriNet]: 167 programPoint places, 0 predicate places. [2025-03-15 01:41:00,708 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 176 transitions, 497 flow [2025-03-15 01:41:00,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:00,709 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:41:00,709 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] [2025-03-15 01:41:00,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:41:00,709 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:41:00,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:41:00,711 INFO L85 PathProgramCache]: Analyzing trace with hash -237717033, now seen corresponding path program 1 times [2025-03-15 01:41:00,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:41:00,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364067275] [2025-03-15 01:41:00,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:41:00,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:41:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:41:00,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:41:00,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:41:00,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364067275] [2025-03-15 01:41:00,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364067275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:41:00,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:41:00,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:41:00,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557578687] [2025-03-15 01:41:00,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:41:00,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:41:00,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:41:00,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:41:00,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:41:00,868 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 178 [2025-03-15 01:41:00,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 176 transitions, 497 flow. Second operand has 4 states, 4 states have (on average 141.75) internal successors, (567), 4 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:00,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:41:00,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 178 [2025-03-15 01:41:00,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:41:00,974 INFO L124 PetriNetUnfolderBase]: 9/196 cut-off events. [2025-03-15 01:41:00,974 INFO L125 PetriNetUnfolderBase]: For 55/60 co-relation queries the response was YES. [2025-03-15 01:41:00,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 196 events. 9/196 cut-off events. For 55/60 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 407 event pairs, 0 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 164. Up to 35 conditions per place. [2025-03-15 01:41:00,976 INFO L140 encePairwiseOnDemand]: 171/178 looper letters, 40 selfloop transitions, 5 changer transitions 4/179 dead transitions. [2025-03-15 01:41:00,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 179 transitions, 593 flow [2025-03-15 01:41:00,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:41:00,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:41:00,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 742 transitions. [2025-03-15 01:41:00,979 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8337078651685393 [2025-03-15 01:41:00,980 INFO L298 CegarLoopForPetriNet]: 167 programPoint places, 4 predicate places. [2025-03-15 01:41:00,980 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 179 transitions, 593 flow [2025-03-15 01:41:00,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 141.75) internal successors, (567), 4 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:00,981 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:41:00,981 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 01:41:00,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:41:00,982 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:41:00,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:41:00,982 INFO L85 PathProgramCache]: Analyzing trace with hash -79861403, now seen corresponding path program 1 times [2025-03-15 01:41:00,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:41:00,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380760518] [2025-03-15 01:41:00,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:41:00,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:41:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:41:01,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:41:01,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:41:01,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380760518] [2025-03-15 01:41:01,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380760518] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:41:01,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795243882] [2025-03-15 01:41:01,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:41:01,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:41:01,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:41:01,142 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:41:01,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-15 01:41:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:41:01,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-15 01:41:01,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:41:01,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:41:01,264 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:41:01,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795243882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:41:01,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:41:01,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-15 01:41:01,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939024003] [2025-03-15 01:41:01,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:41:01,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:41:01,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:41:01,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:41:01,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-15 01:41:01,266 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 178 [2025-03-15 01:41:01,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 179 transitions, 593 flow. Second operand has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:01,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:41:01,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 178 [2025-03-15 01:41:01,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:41:01,357 INFO L124 PetriNetUnfolderBase]: 9/194 cut-off events. [2025-03-15 01:41:01,357 INFO L125 PetriNetUnfolderBase]: For 107/114 co-relation queries the response was YES. [2025-03-15 01:41:01,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 194 events. 9/194 cut-off events. For 107/114 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 393 event pairs, 0 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 190. Up to 33 conditions per place. [2025-03-15 01:41:01,359 INFO L140 encePairwiseOnDemand]: 172/178 looper letters, 36 selfloop transitions, 7 changer transitions 4/177 dead transitions. [2025-03-15 01:41:01,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 177 transitions, 669 flow [2025-03-15 01:41:01,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:41:01,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:41:01,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 589 transitions. [2025-03-15 01:41:01,361 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.827247191011236 [2025-03-15 01:41:01,361 INFO L298 CegarLoopForPetriNet]: 167 programPoint places, 5 predicate places. [2025-03-15 01:41:01,362 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 177 transitions, 669 flow [2025-03-15 01:41:01,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:01,362 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:41:01,362 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 01:41:01,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-15 01:41:01,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:41:01,563 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:41:01,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:41:01,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1819264299, now seen corresponding path program 1 times [2025-03-15 01:41:01,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:41:01,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89302766] [2025-03-15 01:41:01,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:41:01,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:41:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:41:01,682 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:41:01,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:41:01,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89302766] [2025-03-15 01:41:01,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89302766] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:41:01,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322510368] [2025-03-15 01:41:01,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:41:01,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:41:01,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:41:01,685 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:41:01,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-15 01:41:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:41:01,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-15 01:41:01,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:41:01,801 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:41:01,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:41:01,842 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:41:01,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322510368] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:41:01,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:41:01,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-15 01:41:01,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76607038] [2025-03-15 01:41:01,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:41:01,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 01:41:01,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:41:01,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 01:41:01,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-15 01:41:01,847 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 178 [2025-03-15 01:41:01,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 177 transitions, 669 flow. Second operand has 10 states, 10 states have (on average 142.9) internal successors, (1429), 10 states have internal predecessors, (1429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:01,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:41:01,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 178 [2025-03-15 01:41:01,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:41:02,020 INFO L124 PetriNetUnfolderBase]: 11/220 cut-off events. [2025-03-15 01:41:02,021 INFO L125 PetriNetUnfolderBase]: For 201/210 co-relation queries the response was YES. [2025-03-15 01:41:02,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 220 events. 11/220 cut-off events. For 201/210 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 552 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 333. Up to 51 conditions per place. [2025-03-15 01:41:02,023 INFO L140 encePairwiseOnDemand]: 170/178 looper letters, 49 selfloop transitions, 12 changer transitions 4/195 dead transitions. [2025-03-15 01:41:02,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 195 transitions, 947 flow [2025-03-15 01:41:02,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 01:41:02,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 01:41:02,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1315 transitions. [2025-03-15 01:41:02,027 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8208489388264669 [2025-03-15 01:41:02,029 INFO L298 CegarLoopForPetriNet]: 167 programPoint places, 13 predicate places. [2025-03-15 01:41:02,029 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 195 transitions, 947 flow [2025-03-15 01:41:02,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 142.9) internal successors, (1429), 10 states have internal predecessors, (1429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:02,030 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:41:02,030 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] [2025-03-15 01:41:02,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-15 01:41:02,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:41:02,231 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:41:02,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:41:02,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1255397276, now seen corresponding path program 1 times [2025-03-15 01:41:02,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:41:02,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379127472] [2025-03-15 01:41:02,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:41:02,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:41:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:41:02,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:41:02,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:41:02,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379127472] [2025-03-15 01:41:02,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379127472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:41:02,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:41:02,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:41:02,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839298428] [2025-03-15 01:41:02,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:41:02,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:41:02,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:41:02,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:41:02,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-15 01:41:02,378 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 178 [2025-03-15 01:41:02,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 195 transitions, 947 flow. Second operand has 5 states, 5 states have (on average 136.2) internal successors, (681), 5 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:02,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:41:02,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 178 [2025-03-15 01:41:02,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:41:02,490 INFO L124 PetriNetUnfolderBase]: 10/215 cut-off events. [2025-03-15 01:41:02,490 INFO L125 PetriNetUnfolderBase]: For 266/277 co-relation queries the response was YES. [2025-03-15 01:41:02,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 561 conditions, 215 events. 10/215 cut-off events. For 266/277 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 452 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 364. Up to 50 conditions per place. [2025-03-15 01:41:02,491 INFO L140 encePairwiseOnDemand]: 171/178 looper letters, 49 selfloop transitions, 8 changer transitions 4/194 dead transitions. [2025-03-15 01:41:02,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 194 transitions, 1033 flow [2025-03-15 01:41:02,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:41:02,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:41:02,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 708 transitions. [2025-03-15 01:41:02,497 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7955056179775281 [2025-03-15 01:41:02,497 INFO L298 CegarLoopForPetriNet]: 167 programPoint places, 17 predicate places. [2025-03-15 01:41:02,497 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 194 transitions, 1033 flow [2025-03-15 01:41:02,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.2) internal successors, (681), 5 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:02,498 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:41:02,498 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:41:02,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:41:02,498 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:41:02,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:41:02,500 INFO L85 PathProgramCache]: Analyzing trace with hash 919835592, now seen corresponding path program 1 times [2025-03-15 01:41:02,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:41:02,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823076948] [2025-03-15 01:41:02,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:41:02,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:41:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:41:02,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-15 01:41:02,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:41:02,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823076948] [2025-03-15 01:41:02,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823076948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:41:02,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:41:02,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:41:02,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258056081] [2025-03-15 01:41:02,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:41:02,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:41:02,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:41:02,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:41:02,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:41:02,571 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 178 [2025-03-15 01:41:02,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 194 transitions, 1033 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:02,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:41:02,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 178 [2025-03-15 01:41:02,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:41:02,708 INFO L124 PetriNetUnfolderBase]: 149/834 cut-off events. [2025-03-15 01:41:02,712 INFO L125 PetriNetUnfolderBase]: For 2913/2913 co-relation queries the response was YES. [2025-03-15 01:41:02,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2200 conditions, 834 events. 149/834 cut-off events. For 2913/2913 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4673 event pairs, 78 based on Foata normal form. 0/737 useless extension candidates. Maximal degree in co-relation 1765. Up to 175 conditions per place. [2025-03-15 01:41:02,718 INFO L140 encePairwiseOnDemand]: 168/178 looper letters, 41 selfloop transitions, 3 changer transitions 14/204 dead transitions. [2025-03-15 01:41:02,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 204 transitions, 1279 flow [2025-03-15 01:41:02,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:41:02,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:41:02,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 454 transitions. [2025-03-15 01:41:02,720 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.850187265917603 [2025-03-15 01:41:02,721 INFO L298 CegarLoopForPetriNet]: 167 programPoint places, 15 predicate places. [2025-03-15 01:41:02,721 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 204 transitions, 1279 flow [2025-03-15 01:41:02,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:02,721 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:41:02,721 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-15 01:41:02,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:41:02,721 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:41:02,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:41:02,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1912060954, now seen corresponding path program 1 times [2025-03-15 01:41:02,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:41:02,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542589240] [2025-03-15 01:41:02,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:41:02,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:41:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:41:02,802 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-15 01:41:02,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:41:02,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542589240] [2025-03-15 01:41:02,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542589240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:41:02,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:41:02,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:41:02,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185151898] [2025-03-15 01:41:02,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:41:02,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:41:02,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:41:02,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:41:02,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:41:02,804 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 178 [2025-03-15 01:41:02,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 204 transitions, 1279 flow. Second operand has 4 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:02,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:41:02,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 178 [2025-03-15 01:41:02,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:41:02,956 INFO L124 PetriNetUnfolderBase]: 130/675 cut-off events. [2025-03-15 01:41:02,956 INFO L125 PetriNetUnfolderBase]: For 3697/3697 co-relation queries the response was YES. [2025-03-15 01:41:02,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2181 conditions, 675 events. 130/675 cut-off events. For 3697/3697 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3581 event pairs, 66 based on Foata normal form. 0/609 useless extension candidates. Maximal degree in co-relation 1701. Up to 169 conditions per place. [2025-03-15 01:41:02,961 INFO L140 encePairwiseOnDemand]: 172/178 looper letters, 53 selfloop transitions, 13 changer transitions 14/203 dead transitions. [2025-03-15 01:41:02,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 203 transitions, 1405 flow [2025-03-15 01:41:02,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:41:02,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:41:02,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 729 transitions. [2025-03-15 01:41:02,964 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8191011235955056 [2025-03-15 01:41:02,964 INFO L298 CegarLoopForPetriNet]: 167 programPoint places, 18 predicate places. [2025-03-15 01:41:02,964 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 203 transitions, 1405 flow [2025-03-15 01:41:02,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:02,965 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:41:02,965 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] [2025-03-15 01:41:02,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:41:02,965 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:41:02,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:41:02,967 INFO L85 PathProgramCache]: Analyzing trace with hash 754611540, now seen corresponding path program 1 times [2025-03-15 01:41:02,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:41:02,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62766673] [2025-03-15 01:41:02,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:41:02,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:41:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:41:03,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:41:03,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:41:03,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62766673] [2025-03-15 01:41:03,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62766673] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:41:03,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951853137] [2025-03-15 01:41:03,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:41:03,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:41:03,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:41:03,131 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:41:03,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-15 01:41:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:41:03,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-15 01:41:03,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:41:03,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:41:03,314 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:41:03,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:41:03,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951853137] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:41:03,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:41:03,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-15 01:41:03,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993272338] [2025-03-15 01:41:03,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:41:03,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-15 01:41:03,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:41:03,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-15 01:41:03,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-03-15 01:41:03,376 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 178 [2025-03-15 01:41:03,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 203 transitions, 1405 flow. Second operand has 15 states, 15 states have (on average 132.2) internal successors, (1983), 15 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:03,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:41:03,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 178 [2025-03-15 01:41:03,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:41:03,609 INFO L124 PetriNetUnfolderBase]: 148/827 cut-off events. [2025-03-15 01:41:03,609 INFO L125 PetriNetUnfolderBase]: For 4920/4920 co-relation queries the response was YES. [2025-03-15 01:41:03,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2535 conditions, 827 events. 148/827 cut-off events. For 4920/4920 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4590 event pairs, 78 based on Foata normal form. 0/733 useless extension candidates. Maximal degree in co-relation 2033. Up to 170 conditions per place. [2025-03-15 01:41:03,613 INFO L140 encePairwiseOnDemand]: 167/178 looper letters, 60 selfloop transitions, 13 changer transitions 14/201 dead transitions. [2025-03-15 01:41:03,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 201 transitions, 1501 flow [2025-03-15 01:41:03,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 01:41:03,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 01:41:03,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1076 transitions. [2025-03-15 01:41:03,615 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7556179775280899 [2025-03-15 01:41:03,615 INFO L298 CegarLoopForPetriNet]: 167 programPoint places, 24 predicate places. [2025-03-15 01:41:03,616 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 201 transitions, 1501 flow [2025-03-15 01:41:03,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 132.2) internal successors, (1983), 15 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:03,616 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:41:03,617 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 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] [2025-03-15 01:41:03,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-15 01:41:03,817 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 01:41:03,817 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:41:03,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:41:03,818 INFO L85 PathProgramCache]: Analyzing trace with hash 796804792, now seen corresponding path program 2 times [2025-03-15 01:41:03,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:41:03,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295024015] [2025-03-15 01:41:03,818 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:41:03,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:41:03,845 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:41:03,846 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2025-03-15 01:41:03,846 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-15 01:41:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 01:41:03,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-15 01:41:03,889 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-15 01:41:03,890 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-15 01:41:03,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-03-15 01:41:03,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-03-15 01:41:03,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-03-15 01:41:03,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-03-15 01:41:03,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-03-15 01:41:03,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-03-15 01:41:03,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-03-15 01:41:03,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-03-15 01:41:03,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-03-15 01:41:03,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-03-15 01:41:03,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-03-15 01:41:03,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-03-15 01:41:03,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 01:41:03,893 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:41:03,895 WARN L336 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-15 01:41:03,895 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-15 01:41:03,935 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 01:41:03,937 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:41:03,938 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;@51ce4946, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:41:03,938 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-15 01:41:03,939 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:41:03,939 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2025-03-15 01:41:03,940 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:41:03,940 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:41:03,940 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] [2025-03-15 01:41:03,940 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:41:03,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:41:03,940 INFO L85 PathProgramCache]: Analyzing trace with hash 857545999, now seen corresponding path program 1 times [2025-03-15 01:41:03,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:41:03,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65131718] [2025-03-15 01:41:03,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:41:03,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:41:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:41:03,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:41:03,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:41:03,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65131718] [2025-03-15 01:41:03,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65131718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:41:03,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:41:03,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:41:03,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264268449] [2025-03-15 01:41:03,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:41:03,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:41:03,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:41:03,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:41:03,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:41:03,996 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 267 [2025-03-15 01:41:03,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 267 transitions, 550 flow. Second operand has 4 states, 4 states have (on average 214.5) internal successors, (858), 4 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:03,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:41:03,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 267 [2025-03-15 01:41:03,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:41:04,195 INFO L124 PetriNetUnfolderBase]: 256/1582 cut-off events. [2025-03-15 01:41:04,195 INFO L125 PetriNetUnfolderBase]: For 174/177 co-relation queries the response was YES. [2025-03-15 01:41:04,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2023 conditions, 1582 events. 256/1582 cut-off events. For 174/177 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 11557 event pairs, 130 based on Foata normal form. 87/1518 useless extension candidates. Maximal degree in co-relation 1599. Up to 343 conditions per place. [2025-03-15 01:41:04,209 INFO L140 encePairwiseOnDemand]: 248/267 looper letters, 35 selfloop transitions, 4 changer transitions 0/250 dead transitions. [2025-03-15 01:41:04,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 250 transitions, 594 flow [2025-03-15 01:41:04,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:41:04,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:41:04,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 906 transitions. [2025-03-15 01:41:04,212 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.848314606741573 [2025-03-15 01:41:04,212 INFO L298 CegarLoopForPetriNet]: 246 programPoint places, -3 predicate places. [2025-03-15 01:41:04,212 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 250 transitions, 594 flow [2025-03-15 01:41:04,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 214.5) internal successors, (858), 4 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:04,213 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:41:04,213 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] [2025-03-15 01:41:04,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 01:41:04,213 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:41:04,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:41:04,214 INFO L85 PathProgramCache]: Analyzing trace with hash 688061684, now seen corresponding path program 1 times [2025-03-15 01:41:04,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:41:04,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043245036] [2025-03-15 01:41:04,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:41:04,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:41:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:41:04,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:41:04,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:41:04,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043245036] [2025-03-15 01:41:04,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043245036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:41:04,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:41:04,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:41:04,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150582087] [2025-03-15 01:41:04,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:41:04,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:41:04,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:41:04,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:41:04,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:41:04,285 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 267 [2025-03-15 01:41:04,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 250 transitions, 594 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:04,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:41:04,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 267 [2025-03-15 01:41:04,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:41:04,490 INFO L124 PetriNetUnfolderBase]: 257/1599 cut-off events. [2025-03-15 01:41:04,490 INFO L125 PetriNetUnfolderBase]: For 430/489 co-relation queries the response was YES. [2025-03-15 01:41:04,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2416 conditions, 1599 events. 257/1599 cut-off events. For 430/489 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 11635 event pairs, 130 based on Foata normal form. 0/1445 useless extension candidates. Maximal degree in co-relation 1883. Up to 359 conditions per place. [2025-03-15 01:41:04,506 INFO L140 encePairwiseOnDemand]: 262/267 looper letters, 46 selfloop transitions, 3 changer transitions 0/259 dead transitions. [2025-03-15 01:41:04,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 259 transitions, 720 flow [2025-03-15 01:41:04,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:41:04,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:41:04,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 699 transitions. [2025-03-15 01:41:04,508 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8726591760299626 [2025-03-15 01:41:04,509 INFO L298 CegarLoopForPetriNet]: 246 programPoint places, -1 predicate places. [2025-03-15 01:41:04,509 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 259 transitions, 720 flow [2025-03-15 01:41:04,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:04,510 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:41:04,510 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] [2025-03-15 01:41:04,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 01:41:04,510 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:41:04,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:41:04,510 INFO L85 PathProgramCache]: Analyzing trace with hash -973550398, now seen corresponding path program 1 times [2025-03-15 01:41:04,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:41:04,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139815039] [2025-03-15 01:41:04,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:41:04,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:41:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:41:04,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:41:04,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:41:04,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139815039] [2025-03-15 01:41:04,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139815039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:41:04,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:41:04,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:41:04,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459420262] [2025-03-15 01:41:04,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:41:04,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:41:04,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:41:04,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:41:04,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:41:04,585 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 267 [2025-03-15 01:41:04,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 259 transitions, 720 flow. Second operand has 4 states, 4 states have (on average 213.75) internal successors, (855), 4 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:04,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:41:04,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 267 [2025-03-15 01:41:04,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:41:04,797 INFO L124 PetriNetUnfolderBase]: 257/1598 cut-off events. [2025-03-15 01:41:04,797 INFO L125 PetriNetUnfolderBase]: For 886/1001 co-relation queries the response was YES. [2025-03-15 01:41:04,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2790 conditions, 1598 events. 257/1598 cut-off events. For 886/1001 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 11653 event pairs, 130 based on Foata normal form. 0/1446 useless extension candidates. Maximal degree in co-relation 2167. Up to 364 conditions per place. [2025-03-15 01:41:04,813 INFO L140 encePairwiseOnDemand]: 260/267 looper letters, 52 selfloop transitions, 5 changer transitions 0/262 dead transitions. [2025-03-15 01:41:04,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 262 transitions, 840 flow [2025-03-15 01:41:04,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:41:04,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:41:04,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1114 transitions. [2025-03-15 01:41:04,816 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8344569288389513 [2025-03-15 01:41:04,816 INFO L298 CegarLoopForPetriNet]: 246 programPoint places, 3 predicate places. [2025-03-15 01:41:04,816 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 262 transitions, 840 flow [2025-03-15 01:41:04,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 213.75) internal successors, (855), 4 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:04,817 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:41:04,817 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 01:41:04,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 01:41:04,817 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:41:04,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:41:04,818 INFO L85 PathProgramCache]: Analyzing trace with hash 711127301, now seen corresponding path program 1 times [2025-03-15 01:41:04,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:41:04,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259556764] [2025-03-15 01:41:04,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:41:04,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:41:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:41:04,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:41:04,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:41:04,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259556764] [2025-03-15 01:41:04,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259556764] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:41:04,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835393887] [2025-03-15 01:41:04,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:41:04,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:41:04,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:41:04,894 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:41:04,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-15 01:41:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:41:04,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-15 01:41:04,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:41:04,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:41:04,992 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:41:04,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835393887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:41:04,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:41:04,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-15 01:41:04,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127305333] [2025-03-15 01:41:04,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:41:04,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:41:04,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:41:04,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:41:04,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-15 01:41:04,993 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 267 [2025-03-15 01:41:04,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 262 transitions, 840 flow. Second operand has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:04,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:41:04,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 267 [2025-03-15 01:41:04,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:41:05,213 INFO L124 PetriNetUnfolderBase]: 257/1596 cut-off events. [2025-03-15 01:41:05,214 INFO L125 PetriNetUnfolderBase]: For 1542/1713 co-relation queries the response was YES. [2025-03-15 01:41:05,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3158 conditions, 1596 events. 257/1596 cut-off events. For 1542/1713 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 11663 event pairs, 130 based on Foata normal form. 0/1446 useless extension candidates. Maximal degree in co-relation 2451. Up to 362 conditions per place. [2025-03-15 01:41:05,227 INFO L140 encePairwiseOnDemand]: 261/267 looper letters, 48 selfloop transitions, 7 changer transitions 0/260 dead transitions. [2025-03-15 01:41:05,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 260 transitions, 940 flow [2025-03-15 01:41:05,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:41:05,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:41:05,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 889 transitions. [2025-03-15 01:41:05,230 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8323970037453183 [2025-03-15 01:41:05,231 INFO L298 CegarLoopForPetriNet]: 246 programPoint places, 4 predicate places. [2025-03-15 01:41:05,231 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 260 transitions, 940 flow [2025-03-15 01:41:05,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:05,232 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:41:05,232 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 01:41:05,238 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 01:41:05,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:41:05,433 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:41:05,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:41:05,433 INFO L85 PathProgramCache]: Analyzing trace with hash 570110614, now seen corresponding path program 1 times [2025-03-15 01:41:05,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:41:05,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708096571] [2025-03-15 01:41:05,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:41:05,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:41:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:41:05,490 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:41:05,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:41:05,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708096571] [2025-03-15 01:41:05,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708096571] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:41:05,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946476843] [2025-03-15 01:41:05,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:41:05,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:41:05,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:41:05,493 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:41:05,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-15 01:41:05,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:41:05,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-15 01:41:05,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:41:05,592 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:41:05,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:41:05,627 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:41:05,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946476843] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:41:05,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:41:05,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-15 01:41:05,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053238520] [2025-03-15 01:41:05,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:41:05,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 01:41:05,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:41:05,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 01:41:05,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-15 01:41:05,631 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 267 [2025-03-15 01:41:05,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 260 transitions, 940 flow. Second operand has 10 states, 10 states have (on average 214.9) internal successors, (2149), 10 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:05,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:41:05,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 267 [2025-03-15 01:41:05,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:41:05,950 INFO L124 PetriNetUnfolderBase]: 259/1622 cut-off events. [2025-03-15 01:41:05,950 INFO L125 PetriNetUnfolderBase]: For 2422/2649 co-relation queries the response was YES. [2025-03-15 01:41:05,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3643 conditions, 1622 events. 259/1622 cut-off events. For 2422/2649 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 11869 event pairs, 130 based on Foata normal form. 0/1470 useless extension candidates. Maximal degree in co-relation 2735. Up to 380 conditions per place. [2025-03-15 01:41:05,971 INFO L140 encePairwiseOnDemand]: 259/267 looper letters, 61 selfloop transitions, 12 changer transitions 0/278 dead transitions. [2025-03-15 01:41:05,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 278 transitions, 1242 flow [2025-03-15 01:41:05,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 01:41:05,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 01:41:05,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1975 transitions. [2025-03-15 01:41:05,975 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8218893050353725 [2025-03-15 01:41:05,976 INFO L298 CegarLoopForPetriNet]: 246 programPoint places, 12 predicate places. [2025-03-15 01:41:05,976 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 278 transitions, 1242 flow [2025-03-15 01:41:05,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 214.9) internal successors, (2149), 10 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:05,976 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:41:05,977 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] [2025-03-15 01:41:05,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-15 01:41:06,177 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,SelfDestructingSolverStorable14 [2025-03-15 01:41:06,177 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:41:06,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:41:06,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1321863763, now seen corresponding path program 1 times [2025-03-15 01:41:06,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:41:06,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270312183] [2025-03-15 01:41:06,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:41:06,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:41:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:41:06,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:41:06,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:41:06,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270312183] [2025-03-15 01:41:06,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270312183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:41:06,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:41:06,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:41:06,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883915086] [2025-03-15 01:41:06,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:41:06,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:41:06,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:41:06,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:41:06,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-15 01:41:06,252 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 267 [2025-03-15 01:41:06,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 278 transitions, 1242 flow. Second operand has 5 states, 5 states have (on average 208.2) internal successors, (1041), 5 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:06,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:41:06,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 267 [2025-03-15 01:41:06,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:41:06,495 INFO L124 PetriNetUnfolderBase]: 258/1617 cut-off events. [2025-03-15 01:41:06,495 INFO L125 PetriNetUnfolderBase]: For 3455/3738 co-relation queries the response was YES. [2025-03-15 01:41:06,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4016 conditions, 1617 events. 258/1617 cut-off events. For 3455/3738 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 11666 event pairs, 130 based on Foata normal form. 0/1466 useless extension candidates. Maximal degree in co-relation 3019. Up to 379 conditions per place. [2025-03-15 01:41:06,512 INFO L140 encePairwiseOnDemand]: 260/267 looper letters, 61 selfloop transitions, 8 changer transitions 0/277 dead transitions. [2025-03-15 01:41:06,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 277 transitions, 1352 flow [2025-03-15 01:41:06,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:41:06,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:41:06,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1080 transitions. [2025-03-15 01:41:06,514 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8089887640449438 [2025-03-15 01:41:06,514 INFO L298 CegarLoopForPetriNet]: 246 programPoint places, 16 predicate places. [2025-03-15 01:41:06,514 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 277 transitions, 1352 flow [2025-03-15 01:41:06,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 208.2) internal successors, (1041), 5 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:06,515 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:41:06,515 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:41:06,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 01:41:06,515 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:41:06,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:41:06,515 INFO L85 PathProgramCache]: Analyzing trace with hash -2044926660, now seen corresponding path program 1 times [2025-03-15 01:41:06,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:41:06,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529435203] [2025-03-15 01:41:06,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:41:06,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:41:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:41:06,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-15 01:41:06,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:41:06,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529435203] [2025-03-15 01:41:06,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529435203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:41:06,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:41:06,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:41:06,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184062873] [2025-03-15 01:41:06,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:41:06,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:41:06,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:41:06,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:41:06,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:41:06,556 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 267 [2025-03-15 01:41:06,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 277 transitions, 1352 flow. Second operand has 3 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:06,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:41:06,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 267 [2025-03-15 01:41:06,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:41:08,052 INFO L124 PetriNetUnfolderBase]: 4009/13802 cut-off events. [2025-03-15 01:41:08,053 INFO L125 PetriNetUnfolderBase]: For 66500/73331 co-relation queries the response was YES. [2025-03-15 01:41:08,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43617 conditions, 13802 events. 4009/13802 cut-off events. For 66500/73331 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 156966 event pairs, 2457 based on Foata normal form. 3/12240 useless extension candidates. Maximal degree in co-relation 12941. Up to 4192 conditions per place. [2025-03-15 01:41:08,162 INFO L140 encePairwiseOnDemand]: 257/267 looper letters, 82 selfloop transitions, 4 changer transitions 3/311 dead transitions. [2025-03-15 01:41:08,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 311 transitions, 1868 flow [2025-03-15 01:41:08,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:41:08,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:41:08,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 706 transitions. [2025-03-15 01:41:08,164 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8813982521847691 [2025-03-15 01:41:08,165 INFO L298 CegarLoopForPetriNet]: 246 programPoint places, 18 predicate places. [2025-03-15 01:41:08,165 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 311 transitions, 1868 flow [2025-03-15 01:41:08,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:08,165 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:41:08,165 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-15 01:41:08,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 01:41:08,165 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:41:08,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:41:08,166 INFO L85 PathProgramCache]: Analyzing trace with hash 484142778, now seen corresponding path program 1 times [2025-03-15 01:41:08,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:41:08,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128075716] [2025-03-15 01:41:08,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:41:08,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:41:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:41:08,208 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-15 01:41:08,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:41:08,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128075716] [2025-03-15 01:41:08,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128075716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:41:08,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:41:08,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:41:08,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841491759] [2025-03-15 01:41:08,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:41:08,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:41:08,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:41:08,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:41:08,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:41:08,210 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 267 [2025-03-15 01:41:08,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 311 transitions, 1868 flow. Second operand has 4 states, 4 states have (on average 215.75) internal successors, (863), 4 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:08,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:41:08,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 267 [2025-03-15 01:41:08,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:41:09,878 INFO L124 PetriNetUnfolderBase]: 4009/13801 cut-off events. [2025-03-15 01:41:09,878 INFO L125 PetriNetUnfolderBase]: For 88558/96525 co-relation queries the response was YES. [2025-03-15 01:41:09,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47615 conditions, 13801 events. 4009/13801 cut-off events. For 88558/96525 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 156890 event pairs, 2457 based on Foata normal form. 3/12240 useless extension candidates. Maximal degree in co-relation 14141. Up to 4192 conditions per place. [2025-03-15 01:41:10,027 INFO L140 encePairwiseOnDemand]: 261/267 looper letters, 78 selfloop transitions, 13 changer transitions 3/310 dead transitions. [2025-03-15 01:41:10,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 310 transitions, 2042 flow [2025-03-15 01:41:10,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:41:10,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:41:10,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1101 transitions. [2025-03-15 01:41:10,030 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8247191011235955 [2025-03-15 01:41:10,031 INFO L298 CegarLoopForPetriNet]: 246 programPoint places, 21 predicate places. [2025-03-15 01:41:10,031 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 310 transitions, 2042 flow [2025-03-15 01:41:10,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 215.75) internal successors, (863), 4 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:10,031 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:41:10,032 INFO L221 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 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] [2025-03-15 01:41:10,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 01:41:10,032 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:41:10,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:41:10,032 INFO L85 PathProgramCache]: Analyzing trace with hash -506946058, now seen corresponding path program 2 times [2025-03-15 01:41:10,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:41:10,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153770685] [2025-03-15 01:41:10,033 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:41:10,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:41:10,045 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 01:41:10,045 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:41:10,073 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-15 01:41:10,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:41:10,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153770685] [2025-03-15 01:41:10,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153770685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:41:10,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:41:10,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:41:10,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908026644] [2025-03-15 01:41:10,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:41:10,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:41:10,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:41:10,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:41:10,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:41:10,075 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 267 [2025-03-15 01:41:10,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 310 transitions, 2042 flow. Second operand has 4 states, 4 states have (on average 211.5) internal successors, (846), 4 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:10,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:41:10,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 267 [2025-03-15 01:41:10,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:41:11,244 INFO L124 PetriNetUnfolderBase]: 3738/10990 cut-off events. [2025-03-15 01:41:11,244 INFO L125 PetriNetUnfolderBase]: For 119242/120491 co-relation queries the response was YES. [2025-03-15 01:41:11,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47482 conditions, 10990 events. 3738/10990 cut-off events. For 119242/120491 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 115126 event pairs, 1566 based on Foata normal form. 1/9717 useless extension candidates. Maximal degree in co-relation 6689. Up to 4066 conditions per place. [2025-03-15 01:41:11,363 INFO L140 encePairwiseOnDemand]: 261/267 looper letters, 77 selfloop transitions, 11 changer transitions 3/309 dead transitions. [2025-03-15 01:41:11,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 309 transitions, 2204 flow [2025-03-15 01:41:11,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:41:11,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:41:11,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1082 transitions. [2025-03-15 01:41:11,369 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8104868913857678 [2025-03-15 01:41:11,369 INFO L298 CegarLoopForPetriNet]: 246 programPoint places, 24 predicate places. [2025-03-15 01:41:11,369 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 309 transitions, 2204 flow [2025-03-15 01:41:11,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 211.5) internal successors, (846), 4 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:11,370 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:41:11,370 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:41:11,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 01:41:11,370 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:41:11,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:41:11,375 INFO L85 PathProgramCache]: Analyzing trace with hash 2014326790, now seen corresponding path program 1 times [2025-03-15 01:41:11,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:41:11,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804334454] [2025-03-15 01:41:11,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:41:11,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:41:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:41:11,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-15 01:41:11,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:41:11,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804334454] [2025-03-15 01:41:11,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804334454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:41:11,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:41:11,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:41:11,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027890909] [2025-03-15 01:41:11,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:41:11,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:41:11,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:41:11,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:41:11,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:41:11,480 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 267 [2025-03-15 01:41:11,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 309 transitions, 2204 flow. Second operand has 4 states, 4 states have (on average 209.5) internal successors, (838), 4 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:11,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:41:11,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 267 [2025-03-15 01:41:11,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:41:12,619 INFO L124 PetriNetUnfolderBase]: 3474/9657 cut-off events. [2025-03-15 01:41:12,619 INFO L125 PetriNetUnfolderBase]: For 126017/132427 co-relation queries the response was YES. [2025-03-15 01:41:12,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48930 conditions, 9657 events. 3474/9657 cut-off events. For 126017/132427 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 96532 event pairs, 1350 based on Foata normal form. 121/8734 useless extension candidates. Maximal degree in co-relation 7033. Up to 3680 conditions per place. [2025-03-15 01:41:12,753 INFO L140 encePairwiseOnDemand]: 260/267 looper letters, 99 selfloop transitions, 5 changer transitions 3/327 dead transitions. [2025-03-15 01:41:12,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 327 transitions, 2810 flow [2025-03-15 01:41:12,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:41:12,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:41:12,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 925 transitions. [2025-03-15 01:41:12,756 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8661048689138576 [2025-03-15 01:41:12,757 INFO L298 CegarLoopForPetriNet]: 246 programPoint places, 25 predicate places. [2025-03-15 01:41:12,757 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 327 transitions, 2810 flow [2025-03-15 01:41:12,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 209.5) internal successors, (838), 4 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:12,757 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:41:12,757 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 01:41:12,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-15 01:41:12,758 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:41:12,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:41:12,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1980378141, now seen corresponding path program 1 times [2025-03-15 01:41:12,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:41:12,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944921478] [2025-03-15 01:41:12,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:41:12,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:41:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:41:12,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-15 01:41:12,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:41:12,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944921478] [2025-03-15 01:41:12,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944921478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:41:12,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:41:12,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:41:12,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963945078] [2025-03-15 01:41:12,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:41:12,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:41:12,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:41:12,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:41:12,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:41:12,827 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 267 [2025-03-15 01:41:12,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 327 transitions, 2810 flow. Second operand has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:12,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:41:12,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 267 [2025-03-15 01:41:12,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:41:14,156 INFO L124 PetriNetUnfolderBase]: 3210/8529 cut-off events. [2025-03-15 01:41:14,156 INFO L125 PetriNetUnfolderBase]: For 126860/133805 co-relation queries the response was YES. [2025-03-15 01:41:14,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49730 conditions, 8529 events. 3210/8529 cut-off events. For 126860/133805 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 82128 event pairs, 1000 based on Foata normal form. 76/7852 useless extension candidates. Maximal degree in co-relation 7325. Up to 3843 conditions per place. [2025-03-15 01:41:14,245 INFO L140 encePairwiseOnDemand]: 259/267 looper letters, 112 selfloop transitions, 7 changer transitions 6/345 dead transitions. [2025-03-15 01:41:14,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 345 transitions, 3488 flow [2025-03-15 01:41:14,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:41:14,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:41:14,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 686 transitions. [2025-03-15 01:41:14,247 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8564294631710362 [2025-03-15 01:41:14,247 INFO L298 CegarLoopForPetriNet]: 246 programPoint places, 25 predicate places. [2025-03-15 01:41:14,248 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 345 transitions, 3488 flow [2025-03-15 01:41:14,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:14,248 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:41:14,248 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 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] [2025-03-15 01:41:14,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-15 01:41:14,248 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:41:14,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:41:14,249 INFO L85 PathProgramCache]: Analyzing trace with hash 2015230648, now seen corresponding path program 1 times [2025-03-15 01:41:14,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:41:14,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119190592] [2025-03-15 01:41:14,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:41:14,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:41:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:41:14,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:41:14,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:41:14,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119190592] [2025-03-15 01:41:14,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119190592] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:41:14,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425081810] [2025-03-15 01:41:14,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:41:14,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:41:14,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:41:14,365 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:41:14,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-15 01:41:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:41:14,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-15 01:41:14,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:41:14,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:41:14,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:41:14,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:41:14,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425081810] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:41:14,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:41:14,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-15 01:41:14,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572010449] [2025-03-15 01:41:14,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:41:14,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-15 01:41:14,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:41:14,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-15 01:41:14,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-03-15 01:41:14,607 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 267 [2025-03-15 01:41:14,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 345 transitions, 3488 flow. Second operand has 15 states, 15 states have (on average 204.26666666666668) internal successors, (3064), 15 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:14,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:41:14,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 267 [2025-03-15 01:41:14,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:41:16,005 INFO L124 PetriNetUnfolderBase]: 3381/11167 cut-off events. [2025-03-15 01:41:16,005 INFO L125 PetriNetUnfolderBase]: For 151767/166194 co-relation queries the response was YES. [2025-03-15 01:41:16,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56426 conditions, 11167 events. 3381/11167 cut-off events. For 151767/166194 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 121085 event pairs, 1195 based on Foata normal form. 69/10086 useless extension candidates. Maximal degree in co-relation 14980. Up to 3896 conditions per place. [2025-03-15 01:41:16,136 INFO L140 encePairwiseOnDemand]: 257/267 looper letters, 123 selfloop transitions, 13 changer transitions 6/344 dead transitions. [2025-03-15 01:41:16,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 344 transitions, 3720 flow [2025-03-15 01:41:16,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 01:41:16,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 01:41:16,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1663 transitions. [2025-03-15 01:41:16,138 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.778558052434457 [2025-03-15 01:41:16,139 INFO L298 CegarLoopForPetriNet]: 246 programPoint places, 32 predicate places. [2025-03-15 01:41:16,139 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 344 transitions, 3720 flow [2025-03-15 01:41:16,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 204.26666666666668) internal successors, (3064), 15 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:16,140 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:41:16,140 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2025-03-15 01:41:16,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-15 01:41:16,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:41:16,345 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:41:16,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:41:16,345 INFO L85 PathProgramCache]: Analyzing trace with hash -385159609, now seen corresponding path program 2 times [2025-03-15 01:41:16,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:41:16,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836836715] [2025-03-15 01:41:16,346 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:41:16,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:41:16,374 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:41:16,375 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2025-03-15 01:41:16,375 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-15 01:41:16,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 01:41:16,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-15 01:41:16,399 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-15 01:41:16,399 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-15 01:41:16,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-03-15 01:41:16,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-03-15 01:41:16,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-03-15 01:41:16,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-03-15 01:41:16,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-03-15 01:41:16,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-03-15 01:41:16,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-03-15 01:41:16,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-03-15 01:41:16,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-03-15 01:41:16,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-03-15 01:41:16,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-03-15 01:41:16,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-03-15 01:41:16,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-15 01:41:16,400 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:41:16,400 WARN L336 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-15 01:41:16,400 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-15 01:41:16,436 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-15 01:41:16,440 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:41:16,442 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;@51ce4946, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:41:16,442 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-15 01:41:16,444 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:41:16,444 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2025-03-15 01:41:16,444 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:41:16,444 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:41:16,444 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] [2025-03-15 01:41:16,444 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:41:16,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:41:16,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1859708175, now seen corresponding path program 1 times [2025-03-15 01:41:16,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:41:16,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297950255] [2025-03-15 01:41:16,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:41:16,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:41:16,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:41:16,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:41:16,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:41:16,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297950255] [2025-03-15 01:41:16,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297950255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:41:16,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:41:16,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:41:16,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123877853] [2025-03-15 01:41:16,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:41:16,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:41:16,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:41:16,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:41:16,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:41:16,483 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 356 [2025-03-15 01:41:16,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 356 transitions, 739 flow. Second operand has 4 states, 4 states have (on average 286.5) internal successors, (1146), 4 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:16,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:41:16,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 356 [2025-03-15 01:41:16,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:41:18,532 INFO L124 PetriNetUnfolderBase]: 5270/21126 cut-off events. [2025-03-15 01:41:18,533 INFO L125 PetriNetUnfolderBase]: For 3349/3355 co-relation queries the response was YES. [2025-03-15 01:41:18,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28964 conditions, 21126 events. 5270/21126 cut-off events. For 3349/3355 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 265928 event pairs, 3231 based on Foata normal form. 1718/20936 useless extension candidates. Maximal degree in co-relation 23945. Up to 6440 conditions per place. [2025-03-15 01:41:18,733 INFO L140 encePairwiseOnDemand]: 332/356 looper letters, 47 selfloop transitions, 4 changer transitions 0/333 dead transitions. [2025-03-15 01:41:18,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 333 transitions, 795 flow [2025-03-15 01:41:18,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:41:18,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:41:18,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1211 transitions. [2025-03-15 01:41:18,735 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8504213483146067 [2025-03-15 01:41:18,736 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, -4 predicate places. [2025-03-15 01:41:18,736 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 333 transitions, 795 flow [2025-03-15 01:41:18,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 286.5) internal successors, (1146), 4 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:18,736 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:41:18,736 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] [2025-03-15 01:41:18,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-15 01:41:18,736 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:41:18,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:41:18,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1784125912, now seen corresponding path program 1 times [2025-03-15 01:41:18,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:41:18,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295889571] [2025-03-15 01:41:18,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:41:18,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:41:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:41:18,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:41:18,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:41:18,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295889571] [2025-03-15 01:41:18,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295889571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:41:18,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:41:18,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:41:18,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262247506] [2025-03-15 01:41:18,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:41:18,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:41:18,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:41:18,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:41:18,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:41:18,774 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 356 [2025-03-15 01:41:18,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 333 transitions, 795 flow. Second operand has 3 states, 3 states have (on average 290.3333333333333) internal successors, (871), 3 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:18,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:41:18,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 356 [2025-03-15 01:41:18,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:41:21,156 INFO L124 PetriNetUnfolderBase]: 5271/21143 cut-off events. [2025-03-15 01:41:21,157 INFO L125 PetriNetUnfolderBase]: For 7003/8387 co-relation queries the response was YES. [2025-03-15 01:41:21,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35454 conditions, 21143 events. 5271/21143 cut-off events. For 7003/8387 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 266504 event pairs, 3231 based on Foata normal form. 0/19232 useless extension candidates. Maximal degree in co-relation 29368. Up to 6456 conditions per place. [2025-03-15 01:41:21,337 INFO L140 encePairwiseOnDemand]: 351/356 looper letters, 58 selfloop transitions, 3 changer transitions 0/342 dead transitions. [2025-03-15 01:41:21,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 342 transitions, 945 flow [2025-03-15 01:41:21,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:41:21,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:41:21,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 927 transitions. [2025-03-15 01:41:21,338 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8679775280898876 [2025-03-15 01:41:21,339 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, -2 predicate places. [2025-03-15 01:41:21,339 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 342 transitions, 945 flow [2025-03-15 01:41:21,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 290.3333333333333) internal successors, (871), 3 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:21,339 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:41:21,339 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] [2025-03-15 01:41:21,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-15 01:41:21,339 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:41:21,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:41:21,340 INFO L85 PathProgramCache]: Analyzing trace with hash -523005786, now seen corresponding path program 1 times [2025-03-15 01:41:21,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:41:21,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858866284] [2025-03-15 01:41:21,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:41:21,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:41:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:41:21,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:41:21,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:41:21,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858866284] [2025-03-15 01:41:21,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858866284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:41:21,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:41:21,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:41:21,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592424952] [2025-03-15 01:41:21,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:41:21,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:41:21,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:41:21,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:41:21,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:41:21,379 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 356 [2025-03-15 01:41:21,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 342 transitions, 945 flow. Second operand has 4 states, 4 states have (on average 285.75) internal successors, (1143), 4 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:21,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:41:21,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 356 [2025-03-15 01:41:21,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:41:23,772 INFO L124 PetriNetUnfolderBase]: 5271/21142 cut-off events. [2025-03-15 01:41:23,772 INFO L125 PetriNetUnfolderBase]: For 13422/16184 co-relation queries the response was YES. [2025-03-15 01:41:23,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41925 conditions, 21142 events. 5271/21142 cut-off events. For 13422/16184 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 266272 event pairs, 3231 based on Foata normal form. 0/19233 useless extension candidates. Maximal degree in co-relation 34791. Up to 6461 conditions per place. [2025-03-15 01:41:24,038 INFO L140 encePairwiseOnDemand]: 349/356 looper letters, 64 selfloop transitions, 5 changer transitions 0/345 dead transitions. [2025-03-15 01:41:24,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 345 transitions, 1089 flow [2025-03-15 01:41:24,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:41:24,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:41:24,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1486 transitions. [2025-03-15 01:41:24,040 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8348314606741573 [2025-03-15 01:41:24,040 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 2 predicate places. [2025-03-15 01:41:24,040 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 345 transitions, 1089 flow [2025-03-15 01:41:24,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 285.75) internal successors, (1143), 4 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:24,041 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:41:24,041 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 01:41:24,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-15 01:41:24,041 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:41:24,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:41:24,041 INFO L85 PathProgramCache]: Analyzing trace with hash 334123141, now seen corresponding path program 1 times [2025-03-15 01:41:24,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:41:24,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892501943] [2025-03-15 01:41:24,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:41:24,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:41:24,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:41:24,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:41:24,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:41:24,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892501943] [2025-03-15 01:41:24,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892501943] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:41:24,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719739829] [2025-03-15 01:41:24,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:41:24,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:41:24,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:41:24,108 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:41:24,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-15 01:41:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:41:24,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-15 01:41:24,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:41:24,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:41:24,211 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:41:24,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719739829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:41:24,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:41:24,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-15 01:41:24,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325880701] [2025-03-15 01:41:24,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:41:24,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:41:24,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:41:24,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:41:24,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-15 01:41:24,213 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 356 [2025-03-15 01:41:24,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 345 transitions, 1089 flow. Second operand has 4 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:24,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:41:24,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 356 [2025-03-15 01:41:24,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:41:26,949 INFO L124 PetriNetUnfolderBase]: 5271/21140 cut-off events. [2025-03-15 01:41:26,949 INFO L125 PetriNetUnfolderBase]: For 22606/26746 co-relation queries the response was YES. [2025-03-15 01:41:27,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48390 conditions, 21140 events. 5271/21140 cut-off events. For 22606/26746 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 266178 event pairs, 3231 based on Foata normal form. 0/19233 useless extension candidates. Maximal degree in co-relation 40214. Up to 6459 conditions per place. [2025-03-15 01:41:27,196 INFO L140 encePairwiseOnDemand]: 350/356 looper letters, 60 selfloop transitions, 7 changer transitions 0/343 dead transitions. [2025-03-15 01:41:27,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 343 transitions, 1213 flow [2025-03-15 01:41:27,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:41:27,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:41:27,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1189 transitions. [2025-03-15 01:41:27,197 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8349719101123596 [2025-03-15 01:41:27,198 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 3 predicate places. [2025-03-15 01:41:27,198 INFO L471 AbstractCegarLoop]: Abstraction has has 328 places, 343 transitions, 1213 flow [2025-03-15 01:41:27,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:27,198 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:41:27,198 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 01:41:27,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-15 01:41:27,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:41:27,399 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:41:27,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:41:27,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1767883898, now seen corresponding path program 1 times [2025-03-15 01:41:27,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:41:27,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746891245] [2025-03-15 01:41:27,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:41:27,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:41:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:41:27,443 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:41:27,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:41:27,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746891245] [2025-03-15 01:41:27,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746891245] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:41:27,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542365205] [2025-03-15 01:41:27,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:41:27,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:41:27,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:41:27,445 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:41:27,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-15 01:41:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:41:27,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-15 01:41:27,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:41:27,550 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:41:27,550 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:41:27,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:41:27,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542365205] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:41:27,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:41:27,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-15 01:41:27,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519017495] [2025-03-15 01:41:27,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:41:27,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 01:41:27,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:41:27,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 01:41:27,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-15 01:41:27,582 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 356 [2025-03-15 01:41:27,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 343 transitions, 1213 flow. Second operand has 10 states, 10 states have (on average 286.9) internal successors, (2869), 10 states have internal predecessors, (2869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:27,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:41:27,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 356 [2025-03-15 01:41:27,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:41:30,119 INFO L124 PetriNetUnfolderBase]: 5273/21166 cut-off events. [2025-03-15 01:41:30,119 INFO L125 PetriNetUnfolderBase]: For 34579/40097 co-relation queries the response was YES. [2025-03-15 01:41:30,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54972 conditions, 21166 events. 5273/21166 cut-off events. For 34579/40097 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 266138 event pairs, 3231 based on Foata normal form. 0/19257 useless extension candidates. Maximal degree in co-relation 45637. Up to 6477 conditions per place. [2025-03-15 01:41:30,598 INFO L140 encePairwiseOnDemand]: 348/356 looper letters, 73 selfloop transitions, 12 changer transitions 0/361 dead transitions. [2025-03-15 01:41:30,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 361 transitions, 1539 flow [2025-03-15 01:41:30,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 01:41:30,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 01:41:30,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2635 transitions. [2025-03-15 01:41:30,600 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8224094881398252 [2025-03-15 01:41:30,600 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 11 predicate places. [2025-03-15 01:41:30,601 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 361 transitions, 1539 flow [2025-03-15 01:41:30,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 286.9) internal successors, (2869), 10 states have internal predecessors, (2869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:30,601 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:41:30,601 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] [2025-03-15 01:41:30,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-15 01:41:30,802 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,SelfDestructingSolverStorable27 [2025-03-15 01:41:30,802 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:41:30,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:41:30,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1451961846, now seen corresponding path program 1 times [2025-03-15 01:41:30,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:41:30,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847745638] [2025-03-15 01:41:30,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:41:30,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:41:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:41:30,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:41:30,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:41:30,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847745638] [2025-03-15 01:41:30,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847745638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:41:30,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:41:30,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:41:30,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893812803] [2025-03-15 01:41:30,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:41:30,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:41:30,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:41:30,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:41:30,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-15 01:41:30,851 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 356 [2025-03-15 01:41:30,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 361 transitions, 1539 flow. Second operand has 5 states, 5 states have (on average 280.2) internal successors, (1401), 5 states have internal predecessors, (1401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:30,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:41:30,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 356 [2025-03-15 01:41:30,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:41:33,503 INFO L124 PetriNetUnfolderBase]: 5272/21161 cut-off events. [2025-03-15 01:41:33,503 INFO L125 PetriNetUnfolderBase]: For 49270/56166 co-relation queries the response was YES. [2025-03-15 01:41:33,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61442 conditions, 21161 events. 5272/21161 cut-off events. For 49270/56166 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 266390 event pairs, 3231 based on Foata normal form. 0/19253 useless extension candidates. Maximal degree in co-relation 51060. Up to 6476 conditions per place. [2025-03-15 01:41:33,821 INFO L140 encePairwiseOnDemand]: 349/356 looper letters, 73 selfloop transitions, 8 changer transitions 0/360 dead transitions. [2025-03-15 01:41:33,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 360 transitions, 1673 flow [2025-03-15 01:41:33,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:41:33,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:41:33,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1452 transitions. [2025-03-15 01:41:33,822 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8157303370786517 [2025-03-15 01:41:33,822 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 15 predicate places. [2025-03-15 01:41:33,823 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 360 transitions, 1673 flow [2025-03-15 01:41:33,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 280.2) internal successors, (1401), 5 states have internal predecessors, (1401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:33,823 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:41:33,823 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:41:33,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-15 01:41:33,823 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:41:33,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:41:33,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1703839639, now seen corresponding path program 1 times [2025-03-15 01:41:33,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:41:33,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698272288] [2025-03-15 01:41:33,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:41:33,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:41:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:41:33,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-15 01:41:33,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:41:33,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698272288] [2025-03-15 01:41:33,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698272288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:41:33,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:41:33,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:41:33,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062705513] [2025-03-15 01:41:33,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:41:33,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:41:33,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:41:33,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:41:33,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:41:33,853 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 356 [2025-03-15 01:41:33,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 360 transitions, 1673 flow. Second operand has 3 states, 3 states have (on average 280.6666666666667) internal successors, (842), 3 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:41:33,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:41:33,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 356 [2025-03-15 01:41:33,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:42:00,328 INFO L124 PetriNetUnfolderBase]: 70452/202198 cut-off events. [2025-03-15 01:42:00,329 INFO L125 PetriNetUnfolderBase]: For 1015417/1194929 co-relation queries the response was YES. [2025-03-15 01:42:02,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 715638 conditions, 202198 events. 70452/202198 cut-off events. For 1015417/1194929 co-relation queries the response was YES. Maximal size of possible extension queue 5624. Compared 3123309 event pairs, 43003 based on Foata normal form. 52/181653 useless extension candidates. Maximal degree in co-relation 58963. Up to 70160 conditions per place. [2025-03-15 01:42:04,215 INFO L140 encePairwiseOnDemand]: 346/356 looper letters, 108 selfloop transitions, 4 changer transitions 0/405 dead transitions. [2025-03-15 01:42:04,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 405 transitions, 2392 flow [2025-03-15 01:42:04,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:42:04,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:42:04,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 945 transitions. [2025-03-15 01:42:04,217 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8848314606741573 [2025-03-15 01:42:04,217 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 17 predicate places. [2025-03-15 01:42:04,217 INFO L471 AbstractCegarLoop]: Abstraction has has 342 places, 405 transitions, 2392 flow [2025-03-15 01:42:04,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.6666666666667) internal successors, (842), 3 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:42:04,217 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:42:04,217 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-15 01:42:04,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-15 01:42:04,218 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:42:04,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:42:04,218 INFO L85 PathProgramCache]: Analyzing trace with hash 11907642, now seen corresponding path program 1 times [2025-03-15 01:42:04,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:42:04,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934873966] [2025-03-15 01:42:04,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:42:04,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:42:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:42:04,256 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-15 01:42:04,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:42:04,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934873966] [2025-03-15 01:42:04,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934873966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:42:04,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:42:04,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:42:04,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050208248] [2025-03-15 01:42:04,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:42:04,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:42:04,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:42:04,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:42:04,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:42:04,257 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 356 [2025-03-15 01:42:04,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 405 transitions, 2392 flow. Second operand has 4 states, 4 states have (on average 287.75) internal successors, (1151), 4 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:42:04,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:42:04,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 356 [2025-03-15 01:42:04,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand