/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-lit/qw2004-2b.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:39:48,772 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:39:48,822 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:39:48,846 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:39:48,847 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:39:48,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:39:48,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:39:48,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:39:48,848 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:39:48,848 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:39:48,848 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:39:48,849 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:39:48,849 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:39:48,849 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:39:48,849 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:39:48,849 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:39:48,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:39:48,849 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:39:48,849 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:39:48,849 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:39:48,849 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:39:48,849 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:39:48,849 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:39:48,849 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:39:48,849 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:39:48,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:39:48,850 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:39:48,850 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:39:48,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:39:48,850 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:39:48,851 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:39:48,851 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:39:48,851 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:39:49,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:39:49,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:39:49,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:39:49,151 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:39:49,152 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:39:49,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-lit/qw2004-2b.i [2025-03-15 01:39:50,345 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a41695eaa/1f818997255e4c9b9504e17cc5d64f3c/FLAG6833b827c [2025-03-15 01:39:50,590 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:39:50,591 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/qw2004-2b.i [2025-03-15 01:39:50,603 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a41695eaa/1f818997255e4c9b9504e17cc5d64f3c/FLAG6833b827c [2025-03-15 01:39:50,615 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a41695eaa/1f818997255e4c9b9504e17cc5d64f3c [2025-03-15 01:39:50,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:39:50,618 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:39:50,619 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:39:50,619 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:39:50,622 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:39:50,623 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:39:50" (1/1) ... [2025-03-15 01:39:50,624 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45a3b146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:39:50, skipping insertion in model container [2025-03-15 01:39:50,624 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:39:50" (1/1) ... [2025-03-15 01:39:50,649 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:39:50,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:39:50,918 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:39:50,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:39:50,976 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:39:50,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:39:50 WrapperNode [2025-03-15 01:39:50,977 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:39:50,978 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:39:50,978 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:39:50,978 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:39:50,984 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:39:50" (1/1) ... [2025-03-15 01:39:50,992 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:39:50" (1/1) ... [2025-03-15 01:39:51,012 INFO L138 Inliner]: procedures = 174, calls = 33, calls flagged for inlining = 10, calls inlined = 11, statements flattened = 122 [2025-03-15 01:39:51,013 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:39:51,013 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:39:51,013 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:39:51,013 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:39:51,017 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:39:50" (1/1) ... [2025-03-15 01:39:51,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:39:50" (1/1) ... [2025-03-15 01:39:51,019 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:39:50" (1/1) ... [2025-03-15 01:39:51,019 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:39:50" (1/1) ... [2025-03-15 01:39:51,025 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:39:50" (1/1) ... [2025-03-15 01:39:51,026 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:39:50" (1/1) ... [2025-03-15 01:39:51,027 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:39:50" (1/1) ... [2025-03-15 01:39:51,032 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:39:50" (1/1) ... [2025-03-15 01:39:51,033 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:39:50" (1/1) ... [2025-03-15 01:39:51,034 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:39:51,035 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:39:51,035 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:39:51,035 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:39:51,036 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:39:50" (1/1) ... [2025-03-15 01:39:51,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:39:51,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:39:51,067 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:39:51,082 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:39:51,108 INFO L130 BoogieDeclarations]: Found specification of procedure BCSP_PnpStop [2025-03-15 01:39:51,108 INFO L138 BoogieDeclarations]: Found implementation of procedure BCSP_PnpStop [2025-03-15 01:39:51,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-15 01:39:51,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:39:51,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:39:51,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-15 01:39:51,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:39:51,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:39:51,110 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:39:51,211 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:39:51,212 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:39:51,367 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:39:51,367 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:39:51,412 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:39:51,413 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 01:39:51,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:39:51 BoogieIcfgContainer [2025-03-15 01:39:51,413 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:39:51,415 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:39:51,415 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:39:51,420 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:39:51,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:39:50" (1/3) ... [2025-03-15 01:39:51,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@466997c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:39:51, skipping insertion in model container [2025-03-15 01:39:51,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:39:50" (2/3) ... [2025-03-15 01:39:51,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@466997c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:39:51, skipping insertion in model container [2025-03-15 01:39:51,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:39:51" (3/3) ... [2025-03-15 01:39:51,421 INFO L128 eAbstractionObserver]: Analyzing ICFG qw2004-2b.i [2025-03-15 01:39:51,433 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:39:51,434 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG qw2004-2b.i that has 2 procedures, 114 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-15 01:39:51,434 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:39:51,474 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-15 01:39:51,509 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:39:51,517 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;@331f9194, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:39:51,517 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-15 01:39:51,548 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:39:51,548 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-03-15 01:39:51,551 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:39:51,552 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:39:51,552 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] [2025-03-15 01:39:51,553 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting BCSP_PnpStopErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [BCSP_PnpStopErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, BCSP_PnpStopErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-15 01:39:51,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:39:51,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1958679748, now seen corresponding path program 1 times [2025-03-15 01:39:51,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:39:51,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195268591] [2025-03-15 01:39:51,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:39:51,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:39:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:39:51,821 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:39:51,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:39:51,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195268591] [2025-03-15 01:39:51,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195268591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:39:51,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:39:51,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:39:51,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145265809] [2025-03-15 01:39:51,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:39:51,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:39:51,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:39:51,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:39:51,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:39:51,851 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 120 [2025-03-15 01:39:51,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 120 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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:39:51,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:39:51,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 120 [2025-03-15 01:39:51,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:39:51,956 INFO L124 PetriNetUnfolderBase]: 23/209 cut-off events. [2025-03-15 01:39:51,956 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-15 01:39:51,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 209 events. 23/209 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 752 event pairs, 4 based on Foata normal form. 12/186 useless extension candidates. Maximal degree in co-relation 228. Up to 39 conditions per place. [2025-03-15 01:39:51,964 INFO L140 encePairwiseOnDemand]: 109/120 looper letters, 15 selfloop transitions, 4 changer transitions 0/120 dead transitions. [2025-03-15 01:39:51,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 120 transitions, 281 flow [2025-03-15 01:39:51,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:39:51,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:39:51,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2025-03-15 01:39:51,973 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9361111111111111 [2025-03-15 01:39:51,975 INFO L298 CegarLoopForPetriNet]: 117 programPoint places, -1 predicate places. [2025-03-15 01:39:51,976 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 120 transitions, 281 flow [2025-03-15 01:39:51,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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:39:51,976 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:39:51,976 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] [2025-03-15 01:39:51,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:39:51,976 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [BCSP_PnpStopErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, BCSP_PnpStopErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-15 01:39:51,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:39:51,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1696538863, now seen corresponding path program 1 times [2025-03-15 01:39:51,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:39:51,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071085037] [2025-03-15 01:39:51,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:39:51,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:39:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:39:52,086 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:39:52,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:39:52,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071085037] [2025-03-15 01:39:52,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071085037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:39:52,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:39:52,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:39:52,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457972818] [2025-03-15 01:39:52,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:39:52,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:39:52,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:39:52,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:39:52,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:39:52,089 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 120 [2025-03-15 01:39:52,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 120 transitions, 281 flow. Second operand has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 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:39:52,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:39:52,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 120 [2025-03-15 01:39:52,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:39:52,206 INFO L124 PetriNetUnfolderBase]: 31/307 cut-off events. [2025-03-15 01:39:52,206 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-15 01:39:52,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 307 events. 31/307 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1514 event pairs, 0 based on Foata normal form. 0/265 useless extension candidates. Maximal degree in co-relation 382. Up to 47 conditions per place. [2025-03-15 01:39:52,211 INFO L140 encePairwiseOnDemand]: 112/120 looper letters, 21 selfloop transitions, 7 changer transitions 0/126 dead transitions. [2025-03-15 01:39:52,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 126 transitions, 355 flow [2025-03-15 01:39:52,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:39:52,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:39:52,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 532 transitions. [2025-03-15 01:39:52,214 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8866666666666667 [2025-03-15 01:39:52,215 INFO L298 CegarLoopForPetriNet]: 117 programPoint places, 3 predicate places. [2025-03-15 01:39:52,215 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 126 transitions, 355 flow [2025-03-15 01:39:52,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 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:39:52,219 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:39:52,219 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] [2025-03-15 01:39:52,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:39:52,219 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [BCSP_PnpStopErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, BCSP_PnpStopErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-15 01:39:52,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:39:52,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1289273554, now seen corresponding path program 1 times [2025-03-15 01:39:52,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:39:52,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688869263] [2025-03-15 01:39:52,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:39:52,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:39:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:39:52,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:39:52,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:39:52,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688869263] [2025-03-15 01:39:52,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688869263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:39:52,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:39:52,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 01:39:52,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776306805] [2025-03-15 01:39:52,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:39:52,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:39:52,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:39:52,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:39:52,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:39:52,334 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 120 [2025-03-15 01:39:52,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 126 transitions, 355 flow. Second operand has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 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:39:52,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:39:52,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 120 [2025-03-15 01:39:52,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:39:52,464 INFO L124 PetriNetUnfolderBase]: 54/501 cut-off events. [2025-03-15 01:39:52,464 INFO L125 PetriNetUnfolderBase]: For 77/85 co-relation queries the response was YES. [2025-03-15 01:39:52,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 501 events. 54/501 cut-off events. For 77/85 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3050 event pairs, 0 based on Foata normal form. 1/444 useless extension candidates. Maximal degree in co-relation 687. Up to 68 conditions per place. [2025-03-15 01:39:52,469 INFO L140 encePairwiseOnDemand]: 116/120 looper letters, 39 selfloop transitions, 4 changer transitions 0/141 dead transitions. [2025-03-15 01:39:52,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 141 transitions, 505 flow [2025-03-15 01:39:52,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:39:52,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:39:52,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 423 transitions. [2025-03-15 01:39:52,474 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.88125 [2025-03-15 01:39:52,475 INFO L298 CegarLoopForPetriNet]: 117 programPoint places, 6 predicate places. [2025-03-15 01:39:52,475 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 141 transitions, 505 flow [2025-03-15 01:39:52,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 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:39:52,475 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:39:52,476 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] [2025-03-15 01:39:52,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:39:52,476 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [BCSP_PnpStopErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, BCSP_PnpStopErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-15 01:39:52,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:39:52,478 INFO L85 PathProgramCache]: Analyzing trace with hash 2060071402, now seen corresponding path program 2 times [2025-03-15 01:39:52,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:39:52,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890997659] [2025-03-15 01:39:52,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:39:52,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:39:52,497 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 01:39:52,500 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:39:52,590 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:39:52,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:39:52,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890997659] [2025-03-15 01:39:52,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890997659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:39:52,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:39:52,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 01:39:52,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169328506] [2025-03-15 01:39:52,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:39:52,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:39:52,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:39:52,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:39:52,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-15 01:39:52,592 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 120 [2025-03-15 01:39:52,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 141 transitions, 505 flow. Second operand has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 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:39:52,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:39:52,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 120 [2025-03-15 01:39:52,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:39:52,714 INFO L124 PetriNetUnfolderBase]: 59/603 cut-off events. [2025-03-15 01:39:52,715 INFO L125 PetriNetUnfolderBase]: For 184/209 co-relation queries the response was YES. [2025-03-15 01:39:52,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 905 conditions, 603 events. 59/603 cut-off events. For 184/209 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3838 event pairs, 0 based on Foata normal form. 10/548 useless extension candidates. Maximal degree in co-relation 864. Up to 70 conditions per place. [2025-03-15 01:39:52,720 INFO L140 encePairwiseOnDemand]: 108/120 looper letters, 17 selfloop transitions, 12 changer transitions 16/143 dead transitions. [2025-03-15 01:39:52,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 143 transitions, 601 flow [2025-03-15 01:39:52,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:39:52,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:39:52,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 733 transitions. [2025-03-15 01:39:52,722 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8726190476190476 [2025-03-15 01:39:52,723 INFO L298 CegarLoopForPetriNet]: 117 programPoint places, 11 predicate places. [2025-03-15 01:39:52,723 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 143 transitions, 601 flow [2025-03-15 01:39:52,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 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:39:52,724 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:39:52,724 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:39:52,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:39:52,724 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [BCSP_PnpStopErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, BCSP_PnpStopErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-15 01:39:52,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:39:52,725 INFO L85 PathProgramCache]: Analyzing trace with hash 2060071403, now seen corresponding path program 1 times [2025-03-15 01:39:52,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:39:52,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215548267] [2025-03-15 01:39:52,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:39:52,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:39:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:39:52,797 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:39:52,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:39:52,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215548267] [2025-03-15 01:39:52,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215548267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:39:52,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:39:52,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 01:39:52,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624280900] [2025-03-15 01:39:52,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:39:52,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:39:52,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:39:52,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:39:52,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-15 01:39:52,799 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 120 [2025-03-15 01:39:52,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 143 transitions, 601 flow. Second operand has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 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:39:52,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:39:52,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 120 [2025-03-15 01:39:52,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:39:52,899 INFO L124 PetriNetUnfolderBase]: 59/598 cut-off events. [2025-03-15 01:39:52,899 INFO L125 PetriNetUnfolderBase]: For 288/305 co-relation queries the response was YES. [2025-03-15 01:39:52,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 970 conditions, 598 events. 59/598 cut-off events. For 288/305 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3780 event pairs, 0 based on Foata normal form. 5/541 useless extension candidates. Maximal degree in co-relation 925. Up to 69 conditions per place. [2025-03-15 01:39:52,904 INFO L140 encePairwiseOnDemand]: 112/120 looper letters, 18 selfloop transitions, 10 changer transitions 16/142 dead transitions. [2025-03-15 01:39:52,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 142 transitions, 671 flow [2025-03-15 01:39:52,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:39:52,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:39:52,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 626 transitions. [2025-03-15 01:39:52,906 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8694444444444445 [2025-03-15 01:39:52,907 INFO L298 CegarLoopForPetriNet]: 117 programPoint places, 15 predicate places. [2025-03-15 01:39:52,907 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 142 transitions, 671 flow [2025-03-15 01:39:52,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 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:39:52,908 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:39:52,908 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] [2025-03-15 01:39:52,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:39:52,908 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting BCSP_PnpStopErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [BCSP_PnpStopErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, BCSP_PnpStopErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-15 01:39:52,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:39:52,909 INFO L85 PathProgramCache]: Analyzing trace with hash 181921700, now seen corresponding path program 1 times [2025-03-15 01:39:52,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:39:52,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264106155] [2025-03-15 01:39:52,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:39:52,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:39:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:39:52,981 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:39:52,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:39:52,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264106155] [2025-03-15 01:39:52,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264106155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:39:52,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:39:52,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 01:39:52,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564654259] [2025-03-15 01:39:52,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:39:52,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:39:52,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:39:52,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:39:52,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-15 01:39:52,983 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 120 [2025-03-15 01:39:52,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 142 transitions, 671 flow. Second operand has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 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:39:52,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:39:52,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 120 [2025-03-15 01:39:52,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:39:53,097 INFO L124 PetriNetUnfolderBase]: 48/550 cut-off events. [2025-03-15 01:39:53,097 INFO L125 PetriNetUnfolderBase]: For 456/500 co-relation queries the response was YES. [2025-03-15 01:39:53,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 929 conditions, 550 events. 48/550 cut-off events. For 456/500 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3300 event pairs, 1 based on Foata normal form. 10/510 useless extension candidates. Maximal degree in co-relation 880. Up to 58 conditions per place. [2025-03-15 01:39:53,100 INFO L140 encePairwiseOnDemand]: 110/120 looper letters, 17 selfloop transitions, 15 changer transitions 16/146 dead transitions. [2025-03-15 01:39:53,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 146 transitions, 801 flow [2025-03-15 01:39:53,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:39:53,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:39:53,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 734 transitions. [2025-03-15 01:39:53,101 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8738095238095238 [2025-03-15 01:39:53,102 INFO L298 CegarLoopForPetriNet]: 117 programPoint places, 21 predicate places. [2025-03-15 01:39:53,102 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 146 transitions, 801 flow [2025-03-15 01:39:53,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 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:39:53,102 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:39:53,102 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] [2025-03-15 01:39:53,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:39:53,103 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting BCSP_PnpStopErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [BCSP_PnpStopErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, BCSP_PnpStopErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-15 01:39:53,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:39:53,103 INFO L85 PathProgramCache]: Analyzing trace with hash -2031675303, now seen corresponding path program 1 times [2025-03-15 01:39:53,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:39:53,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421824133] [2025-03-15 01:39:53,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:39:53,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:39:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:39:53,169 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:39:53,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:39:53,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421824133] [2025-03-15 01:39:53,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421824133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:39:53,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:39:53,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 01:39:53,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324476851] [2025-03-15 01:39:53,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:39:53,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:39:53,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:39:53,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:39:53,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-15 01:39:53,170 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 120 [2025-03-15 01:39:53,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 146 transitions, 801 flow. Second operand has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 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:39:53,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:39:53,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 120 [2025-03-15 01:39:53,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:39:53,277 INFO L124 PetriNetUnfolderBase]: 42/523 cut-off events. [2025-03-15 01:39:53,277 INFO L125 PetriNetUnfolderBase]: For 660/695 co-relation queries the response was YES. [2025-03-15 01:39:53,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 896 conditions, 523 events. 42/523 cut-off events. For 660/695 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3157 event pairs, 0 based on Foata normal form. 8/491 useless extension candidates. Maximal degree in co-relation 843. Up to 49 conditions per place. [2025-03-15 01:39:53,279 INFO L140 encePairwiseOnDemand]: 110/120 looper letters, 18 selfloop transitions, 10 changer transitions 18/144 dead transitions. [2025-03-15 01:39:53,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 144 transitions, 855 flow [2025-03-15 01:39:53,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:39:53,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:39:53,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 629 transitions. [2025-03-15 01:39:53,281 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8736111111111111 [2025-03-15 01:39:53,281 INFO L298 CegarLoopForPetriNet]: 117 programPoint places, 25 predicate places. [2025-03-15 01:39:53,281 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 144 transitions, 855 flow [2025-03-15 01:39:53,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 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:39:53,282 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:39:53,282 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:39:53,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:39:53,282 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [BCSP_PnpStopErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, BCSP_PnpStopErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-15 01:39:53,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:39:53,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1919564856, now seen corresponding path program 1 times [2025-03-15 01:39:53,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:39:53,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993572581] [2025-03-15 01:39:53,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:39:53,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:39:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:39:53,321 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:39:53,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:39:53,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993572581] [2025-03-15 01:39:53,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993572581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:39:53,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:39:53,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:39:53,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828358210] [2025-03-15 01:39:53,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:39:53,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:39:53,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:39:53,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:39:53,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-15 01:39:53,323 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 120 [2025-03-15 01:39:53,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 144 transitions, 855 flow. Second operand has 5 states, 5 states have (on average 96.6) internal successors, (483), 5 states have internal predecessors, (483), 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:39:53,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:39:53,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 120 [2025-03-15 01:39:53,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:39:53,475 INFO L124 PetriNetUnfolderBase]: 69/732 cut-off events. [2025-03-15 01:39:53,475 INFO L125 PetriNetUnfolderBase]: For 1528/1564 co-relation queries the response was YES. [2025-03-15 01:39:53,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1402 conditions, 732 events. 69/732 cut-off events. For 1528/1564 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4811 event pairs, 10 based on Foata normal form. 2/675 useless extension candidates. Maximal degree in co-relation 1347. Up to 72 conditions per place. [2025-03-15 01:39:53,479 INFO L140 encePairwiseOnDemand]: 113/120 looper letters, 29 selfloop transitions, 5 changer transitions 29/162 dead transitions. [2025-03-15 01:39:53,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 162 transitions, 1151 flow [2025-03-15 01:39:53,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:39:53,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:39:53,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 693 transitions. [2025-03-15 01:39:53,481 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.825 [2025-03-15 01:39:53,482 INFO L298 CegarLoopForPetriNet]: 117 programPoint places, 31 predicate places. [2025-03-15 01:39:53,482 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 162 transitions, 1151 flow [2025-03-15 01:39:53,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.6) internal successors, (483), 5 states have internal predecessors, (483), 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:39:53,482 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:39:53,483 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:39:53,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:39:53,483 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [BCSP_PnpStopErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, BCSP_PnpStopErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-15 01:39:53,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:39:53,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1403671361, now seen corresponding path program 1 times [2025-03-15 01:39:53,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:39:53,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458984462] [2025-03-15 01:39:53,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:39:53,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:39:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:39:53,570 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:39:53,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:39:53,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458984462] [2025-03-15 01:39:53,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458984462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:39:53,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:39:53,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:39:53,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809900259] [2025-03-15 01:39:53,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:39:53,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:39:53,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:39:53,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:39:53,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:39:53,572 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 120 [2025-03-15 01:39:53,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 162 transitions, 1151 flow. Second operand has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 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:39:53,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:39:53,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 120 [2025-03-15 01:39:53,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:39:53,696 INFO L124 PetriNetUnfolderBase]: 66/726 cut-off events. [2025-03-15 01:39:53,696 INFO L125 PetriNetUnfolderBase]: For 1989/2034 co-relation queries the response was YES. [2025-03-15 01:39:53,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1446 conditions, 726 events. 66/726 cut-off events. For 1989/2034 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4741 event pairs, 10 based on Foata normal form. 7/678 useless extension candidates. Maximal degree in co-relation 1387. Up to 69 conditions per place. [2025-03-15 01:39:53,699 INFO L140 encePairwiseOnDemand]: 111/120 looper letters, 9 selfloop transitions, 3 changer transitions 50/159 dead transitions. [2025-03-15 01:39:53,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 159 transitions, 1197 flow [2025-03-15 01:39:53,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 01:39:53,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 01:39:53,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 931 transitions. [2025-03-15 01:39:53,702 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.862037037037037 [2025-03-15 01:39:53,703 INFO L298 CegarLoopForPetriNet]: 117 programPoint places, 38 predicate places. [2025-03-15 01:39:53,703 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 159 transitions, 1197 flow [2025-03-15 01:39:53,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 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:39:53,716 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:39:53,716 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:39:53,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:39:53,716 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [BCSP_PnpStopErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, BCSP_PnpStopErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-15 01:39:53,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:39:53,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1383845271, now seen corresponding path program 2 times [2025-03-15 01:39:53,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:39:53,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327235584] [2025-03-15 01:39:53,717 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:39:53,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:39:53,729 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 01:39:53,729 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:39:53,819 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:39:53,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:39:53,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327235584] [2025-03-15 01:39:53,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327235584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:39:53,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:39:53,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:39:53,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195464980] [2025-03-15 01:39:53,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:39:53,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:39:53,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:39:53,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:39:53,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:39:53,821 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 120 [2025-03-15 01:39:53,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 159 transitions, 1197 flow. Second operand has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 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:39:53,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:39:53,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 120 [2025-03-15 01:39:53,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:39:53,942 INFO L124 PetriNetUnfolderBase]: 65/704 cut-off events. [2025-03-15 01:39:53,943 INFO L125 PetriNetUnfolderBase]: For 2527/2574 co-relation queries the response was YES. [2025-03-15 01:39:53,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1489 conditions, 704 events. 65/704 cut-off events. For 2527/2574 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4521 event pairs, 10 based on Foata normal form. 7/659 useless extension candidates. Maximal degree in co-relation 1426. Up to 68 conditions per place. [2025-03-15 01:39:53,949 INFO L140 encePairwiseOnDemand]: 112/120 looper letters, 4 selfloop transitions, 7 changer transitions 50/158 dead transitions. [2025-03-15 01:39:53,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 158 transitions, 1275 flow [2025-03-15 01:39:53,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 01:39:53,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 01:39:53,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 927 transitions. [2025-03-15 01:39:53,951 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8583333333333333 [2025-03-15 01:39:53,952 INFO L298 CegarLoopForPetriNet]: 117 programPoint places, 45 predicate places. [2025-03-15 01:39:53,952 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 158 transitions, 1275 flow [2025-03-15 01:39:53,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 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:39:53,952 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:39:53,952 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:39:53,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 01:39:53,952 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [BCSP_PnpStopErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, BCSP_PnpStopErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-15 01:39:53,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:39:53,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1305618682, now seen corresponding path program 1 times [2025-03-15 01:39:53,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:39:53,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219840029] [2025-03-15 01:39:53,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:39:53,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:39:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:39:54,046 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:39:54,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:39:54,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219840029] [2025-03-15 01:39:54,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219840029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:39:54,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:39:54,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:39:54,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93484289] [2025-03-15 01:39:54,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:39:54,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:39:54,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:39:54,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:39:54,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:39:54,048 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 120 [2025-03-15 01:39:54,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 158 transitions, 1275 flow. Second operand has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 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:39:54,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:39:54,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 120 [2025-03-15 01:39:54,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:39:54,154 INFO L124 PetriNetUnfolderBase]: 65/725 cut-off events. [2025-03-15 01:39:54,154 INFO L125 PetriNetUnfolderBase]: For 3046/3065 co-relation queries the response was YES. [2025-03-15 01:39:54,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1572 conditions, 725 events. 65/725 cut-off events. For 3046/3065 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4713 event pairs, 10 based on Foata normal form. 0/672 useless extension candidates. Maximal degree in co-relation 1505. Up to 67 conditions per place. [2025-03-15 01:39:54,158 INFO L140 encePairwiseOnDemand]: 112/120 looper letters, 0 selfloop transitions, 0 changer transitions 157/157 dead transitions. [2025-03-15 01:39:54,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 157 transitions, 1349 flow [2025-03-15 01:39:54,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:39:54,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:39:54,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 724 transitions. [2025-03-15 01:39:54,161 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.861904761904762 [2025-03-15 01:39:54,162 INFO L298 CegarLoopForPetriNet]: 117 programPoint places, 50 predicate places. [2025-03-15 01:39:54,162 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 157 transitions, 1349 flow [2025-03-15 01:39:54,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 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:39:54,169 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/qw2004-2b.i_petrified1_AllErrorsAtOnce [2025-03-15 01:39:54,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location BCSP_PnpStopErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 9 remaining) [2025-03-15 01:39:54,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location BCSP_PnpStopErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 9 remaining) [2025-03-15 01:39:54,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 9 remaining) [2025-03-15 01:39:54,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 9 remaining) [2025-03-15 01:39:54,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 9 remaining) [2025-03-15 01:39:54,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 9 remaining) [2025-03-15 01:39:54,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2025-03-15 01:39:54,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location BCSP_PnpStopErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 9 remaining) [2025-03-15 01:39:54,200 INFO L782 garLoopResultBuilder]: Registering result SAFE for location BCSP_PnpStopErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 9 remaining) [2025-03-15 01:39:54,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 01:39:54,200 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:39:54,204 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:39:54,204 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:39:54,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:39:54 BasicIcfg [2025-03-15 01:39:54,208 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:39:54,209 INFO L158 Benchmark]: Toolchain (without parser) took 3590.90ms. Allocated memory was 71.3MB in the beginning and 109.1MB in the end (delta: 37.7MB). Free memory was 43.3MB in the beginning and 35.1MB in the end (delta: 8.3MB). Peak memory consumption was 42.2MB. Max. memory is 8.0GB. [2025-03-15 01:39:54,209 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 71.3MB. Free memory was 36.9MB in the beginning and 36.9MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:39:54,209 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.00ms. Allocated memory is still 71.3MB. Free memory was 43.2MB in the beginning and 23.6MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-03-15 01:39:54,209 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.29ms. Allocated memory is still 71.3MB. Free memory was 23.6MB in the beginning and 21.8MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:39:54,209 INFO L158 Benchmark]: Boogie Preprocessor took 20.97ms. Allocated memory is still 71.3MB. Free memory was 21.8MB in the beginning and 20.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:39:54,210 INFO L158 Benchmark]: RCFGBuilder took 378.47ms. Allocated memory is still 71.3MB. Free memory was 20.7MB in the beginning and 30.3MB in the end (delta: -9.6MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. [2025-03-15 01:39:54,210 INFO L158 Benchmark]: TraceAbstraction took 2793.56ms. Allocated memory was 71.3MB in the beginning and 109.1MB in the end (delta: 37.7MB). Free memory was 29.4MB in the beginning and 35.1MB in the end (delta: -5.7MB). Peak memory consumption was 31.1MB. Max. memory is 8.0GB. [2025-03-15 01:39:54,213 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 71.3MB. Free memory was 36.9MB in the beginning and 36.9MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 358.00ms. Allocated memory is still 71.3MB. Free memory was 43.2MB in the beginning and 23.6MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.29ms. Allocated memory is still 71.3MB. Free memory was 23.6MB in the beginning and 21.8MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.97ms. Allocated memory is still 71.3MB. Free memory was 21.8MB in the beginning and 20.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 378.47ms. Allocated memory is still 71.3MB. Free memory was 20.7MB in the beginning and 30.3MB in the end (delta: -9.6MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. * TraceAbstraction took 2793.56ms. Allocated memory was 71.3MB in the beginning and 109.1MB in the end (delta: 37.7MB). Free memory was 29.4MB in the beginning and 35.1MB in the end (delta: -5.7MB). Peak memory consumption was 31.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 719]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 719]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 712]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 712]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 719]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 719]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 145 locations, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 111 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 111 mSDsluCounter, 187 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 105 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 506 IncrementalHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 82 mSDtfsCounter, 506 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1349occurred in iteration=11, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 507 NumberOfCodeBlocks, 507 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 496 ConstructedInterpolants, 0 QuantifiedInterpolants, 1112 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 01:39:54,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...