./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 66e52001defd7e771c0df8c73cdf4ec6b3d90072c8faf9f52fce6d45ff1a83e7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:50:48,574 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:50:48,627 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 15:50:48,633 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:50:48,633 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:50:48,651 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:50:48,651 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:50:48,651 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:50:48,652 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:50:48,652 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:50:48,652 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:50:48,652 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:50:48,652 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:50:48,652 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:50:48,652 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:50:48,652 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:50:48,653 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:50:48,653 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:50:48,653 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:50:48,653 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:50:48,653 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:50:48,653 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:50:48,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:50:48,653 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:50:48,653 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:50:48,653 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:50:48,653 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:50:48,654 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:50:48,654 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:50:48,654 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:50:48,654 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:50:48,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:50:48,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:50:48,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:50:48,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:50:48,654 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:50:48,655 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:50:48,655 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:50:48,655 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:50:48,655 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:50:48,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:50:48,655 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:50:48,655 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:50:48,655 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:50:48,655 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:50:48,655 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 66e52001defd7e771c0df8c73cdf4ec6b3d90072c8faf9f52fce6d45ff1a83e7 [2025-03-17 15:50:48,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:50:48,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:50:48,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:50:48,880 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:50:48,880 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:50:48,881 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2025-03-17 15:50:49,977 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2de64fa14/e6a9fa27dcb74542a7159a1c66b761de/FLAG6836be0c1 [2025-03-17 15:50:50,226 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:50:50,227 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2025-03-17 15:50:50,235 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2de64fa14/e6a9fa27dcb74542a7159a1c66b761de/FLAG6836be0c1 [2025-03-17 15:50:50,549 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2de64fa14/e6a9fa27dcb74542a7159a1c66b761de [2025-03-17 15:50:50,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:50:50,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:50:50,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:50:50,554 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:50:50,557 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:50:50,557 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:50:50" (1/1) ... [2025-03-17 15:50:50,559 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@405d5fdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:50, skipping insertion in model container [2025-03-17 15:50:50,559 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:50:50" (1/1) ... [2025-03-17 15:50:50,579 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:50:50,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:50:50,704 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:50:50,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:50:50,744 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:50:50,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:50 WrapperNode [2025-03-17 15:50:50,745 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:50:50,746 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:50:50,746 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:50:50,746 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:50:50,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:50" (1/1) ... [2025-03-17 15:50:50,756 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:50" (1/1) ... [2025-03-17 15:50:50,778 INFO L138 Inliner]: procedures = 23, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 235 [2025-03-17 15:50:50,778 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:50:50,779 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:50:50,779 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:50:50,779 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:50:50,787 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:50" (1/1) ... [2025-03-17 15:50:50,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:50" (1/1) ... [2025-03-17 15:50:50,789 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:50" (1/1) ... [2025-03-17 15:50:50,806 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 15:50:50,806 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:50" (1/1) ... [2025-03-17 15:50:50,806 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:50" (1/1) ... [2025-03-17 15:50:50,812 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:50" (1/1) ... [2025-03-17 15:50:50,813 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:50" (1/1) ... [2025-03-17 15:50:50,813 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:50" (1/1) ... [2025-03-17 15:50:50,814 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:50" (1/1) ... [2025-03-17 15:50:50,815 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:50:50,820 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:50:50,820 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:50:50,820 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:50:50,823 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:50" (1/1) ... [2025-03-17 15:50:50,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:50:50,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:50:50,849 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 15:50:50,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 15:50:50,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:50:50,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:50:50,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:50:50,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:50:50,934 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:50:50,936 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:50:51,213 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-03-17 15:50:51,213 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:50:51,221 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:50:51,221 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:50:51,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:50:51 BoogieIcfgContainer [2025-03-17 15:50:51,222 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:50:51,223 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:50:51,223 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:50:51,226 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:50:51,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:50:50" (1/3) ... [2025-03-17 15:50:51,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a329cf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:50:51, skipping insertion in model container [2025-03-17 15:50:51,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:50:50" (2/3) ... [2025-03-17 15:50:51,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a329cf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:50:51, skipping insertion in model container [2025-03-17 15:50:51,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:50:51" (3/3) ... [2025-03-17 15:50:51,228 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2025-03-17 15:50:51,238 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:50:51,240 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c that has 1 procedures, 78 locations, 1 initial locations, 1 loop locations, and 14 error locations. [2025-03-17 15:50:51,287 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:50:51,298 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=LoopHeads, 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;@5d61e55e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:50:51,298 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-17 15:50:51,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 63 states have (on average 1.8095238095238095) internal successors, (114), 77 states have internal predecessors, (114), 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-17 15:50:51,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 15:50:51,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:51,306 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:51,307 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 15:50:51,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:51,311 INFO L85 PathProgramCache]: Analyzing trace with hash -2104612210, now seen corresponding path program 1 times [2025-03-17 15:50:51,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:51,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900103769] [2025-03-17 15:50:51,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:51,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:51,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 15:50:51,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 15:50:51,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:51,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:51,451 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-17 15:50:51,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:51,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900103769] [2025-03-17 15:50:51,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900103769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:51,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:51,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:50:51,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750593078] [2025-03-17 15:50:51,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:51,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 15:50:51,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:51,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 15:50:51,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 15:50:51,472 INFO L87 Difference]: Start difference. First operand has 78 states, 63 states have (on average 1.8095238095238095) internal successors, (114), 77 states have internal predecessors, (114), 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) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-17 15:50:51,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:51,486 INFO L93 Difference]: Finished difference Result 133 states and 191 transitions. [2025-03-17 15:50:51,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 15:50:51,489 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) Word has length 9 [2025-03-17 15:50:51,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:51,495 INFO L225 Difference]: With dead ends: 133 [2025-03-17 15:50:51,496 INFO L226 Difference]: Without dead ends: 74 [2025-03-17 15:50:51,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 15:50:51,502 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:51,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:50:51,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-17 15:50:51,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-17 15:50:51,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 62 states have (on average 1.7419354838709677) internal successors, (108), 73 states have internal predecessors, (108), 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-17 15:50:51,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 108 transitions. [2025-03-17 15:50:51,533 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 108 transitions. Word has length 9 [2025-03-17 15:50:51,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:51,533 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 108 transitions. [2025-03-17 15:50:51,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-17 15:50:51,534 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 108 transitions. [2025-03-17 15:50:51,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 15:50:51,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:51,535 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:51,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 15:50:51,535 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 15:50:51,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:51,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1919836310, now seen corresponding path program 1 times [2025-03-17 15:50:51,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:51,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911581576] [2025-03-17 15:50:51,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:51,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:51,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 15:50:51,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 15:50:51,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:51,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:51,667 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-17 15:50:51,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:51,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911581576] [2025-03-17 15:50:51,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911581576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:51,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:51,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 15:50:51,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378081842] [2025-03-17 15:50:51,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:51,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:50:51,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:51,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:50:51,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:50:51,669 INFO L87 Difference]: Start difference. First operand 74 states and 108 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-17 15:50:51,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:51,759 INFO L93 Difference]: Finished difference Result 125 states and 180 transitions. [2025-03-17 15:50:51,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:50:51,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) Word has length 13 [2025-03-17 15:50:51,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:51,761 INFO L225 Difference]: With dead ends: 125 [2025-03-17 15:50:51,761 INFO L226 Difference]: Without dead ends: 122 [2025-03-17 15:50:51,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:50:51,762 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 91 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:51,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 117 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:51,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-17 15:50:51,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 116. [2025-03-17 15:50:51,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 104 states have (on average 1.7019230769230769) internal successors, (177), 115 states have internal predecessors, (177), 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-17 15:50:51,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 177 transitions. [2025-03-17 15:50:51,774 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 177 transitions. Word has length 13 [2025-03-17 15:50:51,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:51,774 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 177 transitions. [2025-03-17 15:50:51,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-17 15:50:51,774 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 177 transitions. [2025-03-17 15:50:51,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 15:50:51,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:51,775 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:51,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:50:51,775 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 15:50:51,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:51,776 INFO L85 PathProgramCache]: Analyzing trace with hash 614616540, now seen corresponding path program 1 times [2025-03-17 15:50:51,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:51,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990105915] [2025-03-17 15:50:51,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:51,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:51,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 15:50:51,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 15:50:51,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:51,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:51,868 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-17 15:50:51,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:51,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990105915] [2025-03-17 15:50:51,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990105915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:51,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:51,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:50:51,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506974762] [2025-03-17 15:50:51,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:51,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:50:51,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:51,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:50:51,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:50:51,870 INFO L87 Difference]: Start difference. First operand 116 states and 177 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-17 15:50:51,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:51,909 INFO L93 Difference]: Finished difference Result 215 states and 321 transitions. [2025-03-17 15:50:51,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:50:51,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) Word has length 14 [2025-03-17 15:50:51,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:51,910 INFO L225 Difference]: With dead ends: 215 [2025-03-17 15:50:51,910 INFO L226 Difference]: Without dead ends: 116 [2025-03-17 15:50:51,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:50:51,911 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:51,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 301 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:50:51,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-17 15:50:51,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-17 15:50:51,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 104 states have (on average 1.5480769230769231) internal successors, (161), 115 states have internal predecessors, (161), 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-17 15:50:51,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 161 transitions. [2025-03-17 15:50:51,916 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 161 transitions. Word has length 14 [2025-03-17 15:50:51,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:51,916 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 161 transitions. [2025-03-17 15:50:51,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-17 15:50:51,916 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 161 transitions. [2025-03-17 15:50:51,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 15:50:51,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:51,917 INFO L218 NwaCegarLoop]: 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] [2025-03-17 15:50:51,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 15:50:51,917 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 15:50:51,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:51,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1755561084, now seen corresponding path program 1 times [2025-03-17 15:50:51,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:51,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347480586] [2025-03-17 15:50:51,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:51,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:51,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 15:50:51,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 15:50:51,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:51,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:51,997 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-17 15:50:51,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:51,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347480586] [2025-03-17 15:50:51,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347480586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:51,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:51,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:50:51,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411878080] [2025-03-17 15:50:51,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:51,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:50:51,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:51,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:50:51,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:50:51,999 INFO L87 Difference]: Start difference. First operand 116 states and 161 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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-17 15:50:52,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:52,122 INFO L93 Difference]: Finished difference Result 179 states and 233 transitions. [2025-03-17 15:50:52,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:50:52,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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) Word has length 29 [2025-03-17 15:50:52,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:52,124 INFO L225 Difference]: With dead ends: 179 [2025-03-17 15:50:52,124 INFO L226 Difference]: Without dead ends: 176 [2025-03-17 15:50:52,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:50:52,125 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 205 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:52,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 159 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:52,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-17 15:50:52,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 116. [2025-03-17 15:50:52,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 104 states have (on average 1.5192307692307692) internal successors, (158), 115 states have internal predecessors, (158), 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-17 15:50:52,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 158 transitions. [2025-03-17 15:50:52,138 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 158 transitions. Word has length 29 [2025-03-17 15:50:52,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:52,138 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 158 transitions. [2025-03-17 15:50:52,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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-17 15:50:52,138 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 158 transitions. [2025-03-17 15:50:52,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 15:50:52,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:52,139 INFO L218 NwaCegarLoop]: 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] [2025-03-17 15:50:52,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 15:50:52,139 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 15:50:52,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:52,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1412181240, now seen corresponding path program 1 times [2025-03-17 15:50:52,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:52,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235559761] [2025-03-17 15:50:52,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:52,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:52,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 15:50:52,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 15:50:52,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:52,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:52,236 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-17 15:50:52,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:52,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235559761] [2025-03-17 15:50:52,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235559761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:52,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:52,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:50:52,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273626225] [2025-03-17 15:50:52,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:52,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:50:52,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:52,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:50:52,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:50:52,239 INFO L87 Difference]: Start difference. First operand 116 states and 158 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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-17 15:50:52,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:52,422 INFO L93 Difference]: Finished difference Result 260 states and 374 transitions. [2025-03-17 15:50:52,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:50:52,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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) Word has length 30 [2025-03-17 15:50:52,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:52,424 INFO L225 Difference]: With dead ends: 260 [2025-03-17 15:50:52,424 INFO L226 Difference]: Without dead ends: 254 [2025-03-17 15:50:52,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:50:52,425 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 461 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:52,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 190 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:50:52,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-17 15:50:52,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 242. [2025-03-17 15:50:52,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 230 states have (on average 1.5608695652173914) internal successors, (359), 241 states have internal predecessors, (359), 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-17 15:50:52,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 359 transitions. [2025-03-17 15:50:52,444 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 359 transitions. Word has length 30 [2025-03-17 15:50:52,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:52,444 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 359 transitions. [2025-03-17 15:50:52,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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-17 15:50:52,444 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 359 transitions. [2025-03-17 15:50:52,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 15:50:52,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:52,445 INFO L218 NwaCegarLoop]: 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] [2025-03-17 15:50:52,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 15:50:52,445 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 15:50:52,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:52,445 INFO L85 PathProgramCache]: Analyzing trace with hash -827945478, now seen corresponding path program 1 times [2025-03-17 15:50:52,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:52,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277050874] [2025-03-17 15:50:52,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:52,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:52,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 15:50:52,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 15:50:52,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:52,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:52,544 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-17 15:50:52,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:52,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277050874] [2025-03-17 15:50:52,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277050874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:52,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:52,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:50:52,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077946181] [2025-03-17 15:50:52,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:52,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:50:52,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:52,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:50:52,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:50:52,548 INFO L87 Difference]: Start difference. First operand 242 states and 359 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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-17 15:50:52,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:52,736 INFO L93 Difference]: Finished difference Result 737 states and 1097 transitions. [2025-03-17 15:50:52,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 15:50:52,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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) Word has length 31 [2025-03-17 15:50:52,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:52,739 INFO L225 Difference]: With dead ends: 737 [2025-03-17 15:50:52,740 INFO L226 Difference]: Without dead ends: 515 [2025-03-17 15:50:52,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:50:52,741 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 407 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:52,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 337 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:52,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-03-17 15:50:52,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 368. [2025-03-17 15:50:52,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 356 states have (on average 1.5224719101123596) internal successors, (542), 367 states have internal predecessors, (542), 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-17 15:50:52,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 542 transitions. [2025-03-17 15:50:52,759 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 542 transitions. Word has length 31 [2025-03-17 15:50:52,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:52,759 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 542 transitions. [2025-03-17 15:50:52,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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-17 15:50:52,759 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 542 transitions. [2025-03-17 15:50:52,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 15:50:52,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:52,760 INFO L218 NwaCegarLoop]: 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] [2025-03-17 15:50:52,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 15:50:52,762 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 15:50:52,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:52,762 INFO L85 PathProgramCache]: Analyzing trace with hash 2055170464, now seen corresponding path program 1 times [2025-03-17 15:50:52,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:52,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207697964] [2025-03-17 15:50:52,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:52,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:52,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 15:50:52,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 15:50:52,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:52,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:52,812 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-17 15:50:52,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:52,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207697964] [2025-03-17 15:50:52,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207697964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:52,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:52,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:50:52,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466254094] [2025-03-17 15:50:52,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:52,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:50:52,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:52,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:50:52,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:50:52,813 INFO L87 Difference]: Start difference. First operand 368 states and 542 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-17 15:50:52,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:52,830 INFO L93 Difference]: Finished difference Result 1032 states and 1530 transitions. [2025-03-17 15:50:52,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:50:52,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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) Word has length 33 [2025-03-17 15:50:52,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:52,833 INFO L225 Difference]: With dead ends: 1032 [2025-03-17 15:50:52,833 INFO L226 Difference]: Without dead ends: 684 [2025-03-17 15:50:52,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:50:52,838 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 60 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:52,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 216 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:50:52,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2025-03-17 15:50:52,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 672. [2025-03-17 15:50:52,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 660 states have (on average 1.5151515151515151) internal successors, (1000), 671 states have internal predecessors, (1000), 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-17 15:50:52,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1000 transitions. [2025-03-17 15:50:52,852 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1000 transitions. Word has length 33 [2025-03-17 15:50:52,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:52,853 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 1000 transitions. [2025-03-17 15:50:52,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-17 15:50:52,853 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1000 transitions. [2025-03-17 15:50:52,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 15:50:52,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:52,853 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:52,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 15:50:52,854 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 15:50:52,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:52,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1215929058, now seen corresponding path program 1 times [2025-03-17 15:50:52,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:52,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659276305] [2025-03-17 15:50:52,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:52,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:52,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 15:50:52,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 15:50:52,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:52,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:52,893 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-17 15:50:52,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:52,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659276305] [2025-03-17 15:50:52,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659276305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:52,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:52,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:50:52,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560490300] [2025-03-17 15:50:52,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:52,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:50:52,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:52,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:50:52,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:50:52,894 INFO L87 Difference]: Start difference. First operand 672 states and 1000 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-17 15:50:52,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:52,917 INFO L93 Difference]: Finished difference Result 1912 states and 2848 transitions. [2025-03-17 15:50:52,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:50:52,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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) Word has length 35 [2025-03-17 15:50:52,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:52,923 INFO L225 Difference]: With dead ends: 1912 [2025-03-17 15:50:52,923 INFO L226 Difference]: Without dead ends: 1260 [2025-03-17 15:50:52,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:50:52,924 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 58 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:52,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 218 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:50:52,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2025-03-17 15:50:52,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1248. [2025-03-17 15:50:52,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 1236 states have (on average 1.4983818770226538) internal successors, (1852), 1247 states have internal predecessors, (1852), 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-17 15:50:52,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1852 transitions. [2025-03-17 15:50:52,954 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1852 transitions. Word has length 35 [2025-03-17 15:50:52,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:52,954 INFO L471 AbstractCegarLoop]: Abstraction has 1248 states and 1852 transitions. [2025-03-17 15:50:52,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-17 15:50:52,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1852 transitions. [2025-03-17 15:50:52,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 15:50:52,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:52,958 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:52,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 15:50:52,958 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 15:50:52,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:52,959 INFO L85 PathProgramCache]: Analyzing trace with hash -369089198, now seen corresponding path program 1 times [2025-03-17 15:50:52,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:52,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153813622] [2025-03-17 15:50:52,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:52,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:52,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 15:50:52,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 15:50:52,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:52,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:52,997 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-17 15:50:52,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:52,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153813622] [2025-03-17 15:50:52,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153813622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:52,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:52,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:50:52,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305034616] [2025-03-17 15:50:52,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:52,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:50:52,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:52,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:50:52,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:50:52,998 INFO L87 Difference]: Start difference. First operand 1248 states and 1852 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-17 15:50:53,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:53,033 INFO L93 Difference]: Finished difference Result 3480 states and 5164 transitions. [2025-03-17 15:50:53,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:50:53,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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) Word has length 35 [2025-03-17 15:50:53,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:53,041 INFO L225 Difference]: With dead ends: 3480 [2025-03-17 15:50:53,041 INFO L226 Difference]: Without dead ends: 2252 [2025-03-17 15:50:53,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:50:53,046 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 58 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:53,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 219 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:50:53,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2025-03-17 15:50:53,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 2240. [2025-03-17 15:50:53,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2240 states, 2228 states have (on average 1.481149012567325) internal successors, (3300), 2239 states have internal predecessors, (3300), 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-17 15:50:53,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2240 states to 2240 states and 3300 transitions. [2025-03-17 15:50:53,112 INFO L78 Accepts]: Start accepts. Automaton has 2240 states and 3300 transitions. Word has length 35 [2025-03-17 15:50:53,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:53,112 INFO L471 AbstractCegarLoop]: Abstraction has 2240 states and 3300 transitions. [2025-03-17 15:50:53,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-17 15:50:53,113 INFO L276 IsEmpty]: Start isEmpty. Operand 2240 states and 3300 transitions. [2025-03-17 15:50:53,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 15:50:53,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:53,113 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:53,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 15:50:53,114 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 15:50:53,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:53,114 INFO L85 PathProgramCache]: Analyzing trace with hash -121754211, now seen corresponding path program 1 times [2025-03-17 15:50:53,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:53,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559515771] [2025-03-17 15:50:53,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:53,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:53,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 15:50:53,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 15:50:53,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:53,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:53,178 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:50:53,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:53,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559515771] [2025-03-17 15:50:53,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559515771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:53,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:53,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:50:53,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662858589] [2025-03-17 15:50:53,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:53,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:50:53,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:53,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:50:53,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:50:53,179 INFO L87 Difference]: Start difference. First operand 2240 states and 3300 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-17 15:50:53,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:53,236 INFO L93 Difference]: Finished difference Result 5036 states and 7386 transitions. [2025-03-17 15:50:53,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:50:53,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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) Word has length 50 [2025-03-17 15:50:53,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:53,245 INFO L225 Difference]: With dead ends: 5036 [2025-03-17 15:50:53,246 INFO L226 Difference]: Without dead ends: 2816 [2025-03-17 15:50:53,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:50:53,249 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 37 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:53,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 153 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:50:53,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2816 states. [2025-03-17 15:50:53,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2816 to 2770. [2025-03-17 15:50:53,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2770 states, 2758 states have (on average 1.4568527918781726) internal successors, (4018), 2769 states have internal predecessors, (4018), 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-17 15:50:53,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2770 states to 2770 states and 4018 transitions. [2025-03-17 15:50:53,331 INFO L78 Accepts]: Start accepts. Automaton has 2770 states and 4018 transitions. Word has length 50 [2025-03-17 15:50:53,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:53,331 INFO L471 AbstractCegarLoop]: Abstraction has 2770 states and 4018 transitions. [2025-03-17 15:50:53,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-17 15:50:53,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2770 states and 4018 transitions. [2025-03-17 15:50:53,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-17 15:50:53,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:53,332 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:53,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 15:50:53,332 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 15:50:53,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:53,333 INFO L85 PathProgramCache]: Analyzing trace with hash -977419188, now seen corresponding path program 1 times [2025-03-17 15:50:53,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:53,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118588659] [2025-03-17 15:50:53,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:53,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:53,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 15:50:53,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 15:50:53,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:53,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:53,489 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:50:53,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:53,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118588659] [2025-03-17 15:50:53,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118588659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:53,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:53,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:50:53,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541104409] [2025-03-17 15:50:53,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:53,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:50:53,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:53,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:50:53,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:50:53,490 INFO L87 Difference]: Start difference. First operand 2770 states and 4018 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-17 15:50:53,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:53,629 INFO L93 Difference]: Finished difference Result 5524 states and 8014 transitions. [2025-03-17 15:50:53,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:50:53,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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) Word has length 54 [2025-03-17 15:50:53,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:53,637 INFO L225 Difference]: With dead ends: 5524 [2025-03-17 15:50:53,637 INFO L226 Difference]: Without dead ends: 2776 [2025-03-17 15:50:53,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:50:53,640 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 133 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:53,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 164 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:53,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2776 states. [2025-03-17 15:50:53,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2776 to 2770. [2025-03-17 15:50:53,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2770 states, 2758 states have (on average 1.4452501812907905) internal successors, (3986), 2769 states have internal predecessors, (3986), 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-17 15:50:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2770 states to 2770 states and 3986 transitions. [2025-03-17 15:50:53,720 INFO L78 Accepts]: Start accepts. Automaton has 2770 states and 3986 transitions. Word has length 54 [2025-03-17 15:50:53,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:53,720 INFO L471 AbstractCegarLoop]: Abstraction has 2770 states and 3986 transitions. [2025-03-17 15:50:53,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-17 15:50:53,720 INFO L276 IsEmpty]: Start isEmpty. Operand 2770 states and 3986 transitions. [2025-03-17 15:50:53,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-17 15:50:53,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:53,721 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:53,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 15:50:53,722 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 15:50:53,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:53,723 INFO L85 PathProgramCache]: Analyzing trace with hash -337464685, now seen corresponding path program 1 times [2025-03-17 15:50:53,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:53,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37372264] [2025-03-17 15:50:53,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:53,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:53,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 15:50:53,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 15:50:53,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:53,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:53,808 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:50:53,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:53,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37372264] [2025-03-17 15:50:53,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37372264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:53,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:53,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:50:53,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630548365] [2025-03-17 15:50:53,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:53,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:50:53,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:53,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:50:53,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:50:53,810 INFO L87 Difference]: Start difference. First operand 2770 states and 3986 transitions. Second operand has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 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-17 15:50:53,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:53,915 INFO L93 Difference]: Finished difference Result 3610 states and 5210 transitions. [2025-03-17 15:50:53,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:50:53,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 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) Word has length 55 [2025-03-17 15:50:53,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:53,926 INFO L225 Difference]: With dead ends: 3610 [2025-03-17 15:50:53,926 INFO L226 Difference]: Without dead ends: 3607 [2025-03-17 15:50:53,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:50:53,928 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 105 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:53,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 211 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:53,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3607 states. [2025-03-17 15:50:53,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3607 to 2834. [2025-03-17 15:50:54,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2834 states, 2822 states have (on average 1.456413890857548) internal successors, (4110), 2833 states have internal predecessors, (4110), 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-17 15:50:54,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2834 states to 2834 states and 4110 transitions. [2025-03-17 15:50:54,009 INFO L78 Accepts]: Start accepts. Automaton has 2834 states and 4110 transitions. Word has length 55 [2025-03-17 15:50:54,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:54,010 INFO L471 AbstractCegarLoop]: Abstraction has 2834 states and 4110 transitions. [2025-03-17 15:50:54,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 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-17 15:50:54,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2834 states and 4110 transitions. [2025-03-17 15:50:54,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 15:50:54,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:54,010 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:54,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 15:50:54,011 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 15:50:54,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:54,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1871470639, now seen corresponding path program 1 times [2025-03-17 15:50:54,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:54,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056064087] [2025-03-17 15:50:54,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:54,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:54,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 15:50:54,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 15:50:54,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:54,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:54,118 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:50:54,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:54,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056064087] [2025-03-17 15:50:54,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056064087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:54,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:54,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:50:54,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806813623] [2025-03-17 15:50:54,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:54,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:50:54,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:54,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:50:54,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:50:54,119 INFO L87 Difference]: Start difference. First operand 2834 states and 4110 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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-17 15:50:54,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:54,299 INFO L93 Difference]: Finished difference Result 7976 states and 11666 transitions. [2025-03-17 15:50:54,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:50:54,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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) Word has length 56 [2025-03-17 15:50:54,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:54,315 INFO L225 Difference]: With dead ends: 7976 [2025-03-17 15:50:54,315 INFO L226 Difference]: Without dead ends: 5164 [2025-03-17 15:50:54,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:50:54,320 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 250 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:54,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 202 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:54,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5164 states. [2025-03-17 15:50:54,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5164 to 4490. [2025-03-17 15:50:54,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4490 states, 4478 states have (on average 1.4635998213488164) internal successors, (6554), 4489 states have internal predecessors, (6554), 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-17 15:50:54,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4490 states to 4490 states and 6554 transitions. [2025-03-17 15:50:54,452 INFO L78 Accepts]: Start accepts. Automaton has 4490 states and 6554 transitions. Word has length 56 [2025-03-17 15:50:54,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:54,452 INFO L471 AbstractCegarLoop]: Abstraction has 4490 states and 6554 transitions. [2025-03-17 15:50:54,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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-17 15:50:54,452 INFO L276 IsEmpty]: Start isEmpty. Operand 4490 states and 6554 transitions. [2025-03-17 15:50:54,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 15:50:54,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:54,453 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:54,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 15:50:54,453 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 15:50:54,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:54,454 INFO L85 PathProgramCache]: Analyzing trace with hash 2113952337, now seen corresponding path program 1 times [2025-03-17 15:50:54,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:54,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298293029] [2025-03-17 15:50:54,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:54,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:54,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 15:50:54,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 15:50:54,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:54,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:54,536 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:50:54,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:54,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298293029] [2025-03-17 15:50:54,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298293029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:54,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:54,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:50:54,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212802388] [2025-03-17 15:50:54,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:54,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:50:54,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:54,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:50:54,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:50:54,537 INFO L87 Difference]: Start difference. First operand 4490 states and 6554 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 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-17 15:50:54,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:54,695 INFO L93 Difference]: Finished difference Result 8961 states and 13074 transitions. [2025-03-17 15:50:54,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:50:54,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 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) Word has length 57 [2025-03-17 15:50:54,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:54,711 INFO L225 Difference]: With dead ends: 8961 [2025-03-17 15:50:54,711 INFO L226 Difference]: Without dead ends: 5257 [2025-03-17 15:50:54,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:50:54,716 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 205 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:54,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 289 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:54,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5257 states. [2025-03-17 15:50:54,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5257 to 5254. [2025-03-17 15:50:54,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5254 states, 5242 states have (on average 1.4311331552842426) internal successors, (7502), 5253 states have internal predecessors, (7502), 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-17 15:50:54,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5254 states to 5254 states and 7502 transitions. [2025-03-17 15:50:54,842 INFO L78 Accepts]: Start accepts. Automaton has 5254 states and 7502 transitions. Word has length 57 [2025-03-17 15:50:54,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:54,842 INFO L471 AbstractCegarLoop]: Abstraction has 5254 states and 7502 transitions. [2025-03-17 15:50:54,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 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-17 15:50:54,842 INFO L276 IsEmpty]: Start isEmpty. Operand 5254 states and 7502 transitions. [2025-03-17 15:50:54,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 15:50:54,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:54,843 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:54,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 15:50:54,843 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 15:50:54,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:54,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1564163409, now seen corresponding path program 1 times [2025-03-17 15:50:54,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:54,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929018922] [2025-03-17 15:50:54,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:54,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:54,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 15:50:54,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 15:50:54,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:54,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:54,910 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 15:50:54,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:54,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929018922] [2025-03-17 15:50:54,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929018922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:54,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:54,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:50:54,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255620933] [2025-03-17 15:50:54,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:54,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:50:54,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:54,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:50:54,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:50:54,911 INFO L87 Difference]: Start difference. First operand 5254 states and 7502 transitions. Second operand has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 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-17 15:50:55,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:55,063 INFO L93 Difference]: Finished difference Result 9725 states and 14034 transitions. [2025-03-17 15:50:55,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:50:55,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 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) Word has length 57 [2025-03-17 15:50:55,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:55,072 INFO L225 Difference]: With dead ends: 9725 [2025-03-17 15:50:55,073 INFO L226 Difference]: Without dead ends: 5257 [2025-03-17 15:50:55,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:50:55,078 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 212 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:55,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 275 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:55,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5257 states. [2025-03-17 15:50:55,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5257 to 5254. [2025-03-17 15:50:55,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5254 states, 5242 states have (on average 1.4227394124380008) internal successors, (7458), 5253 states have internal predecessors, (7458), 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-17 15:50:55,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5254 states to 5254 states and 7458 transitions. [2025-03-17 15:50:55,208 INFO L78 Accepts]: Start accepts. Automaton has 5254 states and 7458 transitions. Word has length 57 [2025-03-17 15:50:55,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:55,208 INFO L471 AbstractCegarLoop]: Abstraction has 5254 states and 7458 transitions. [2025-03-17 15:50:55,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 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-17 15:50:55,208 INFO L276 IsEmpty]: Start isEmpty. Operand 5254 states and 7458 transitions. [2025-03-17 15:50:55,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 15:50:55,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:55,209 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:55,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 15:50:55,209 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 15:50:55,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:55,210 INFO L85 PathProgramCache]: Analyzing trace with hash 2117600262, now seen corresponding path program 1 times [2025-03-17 15:50:55,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:55,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964466869] [2025-03-17 15:50:55,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:55,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:55,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 15:50:55,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 15:50:55,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:55,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:55,279 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 15:50:55,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:55,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964466869] [2025-03-17 15:50:55,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964466869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:55,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:55,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:50:55,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097611715] [2025-03-17 15:50:55,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:55,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:50:55,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:55,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:50:55,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:50:55,280 INFO L87 Difference]: Start difference. First operand 5254 states and 7458 transitions. Second operand has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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-17 15:50:55,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:55,375 INFO L93 Difference]: Finished difference Result 5257 states and 7458 transitions. [2025-03-17 15:50:55,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:50:55,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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) Word has length 57 [2025-03-17 15:50:55,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:55,384 INFO L225 Difference]: With dead ends: 5257 [2025-03-17 15:50:55,384 INFO L226 Difference]: Without dead ends: 5254 [2025-03-17 15:50:55,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:50:55,388 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 94 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:55,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 166 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:55,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5254 states. [2025-03-17 15:50:55,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5254 to 5251. [2025-03-17 15:50:55,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5251 states, 5242 states have (on average 1.3952689813048456) internal successors, (7314), 5250 states have internal predecessors, (7314), 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-17 15:50:55,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5251 states to 5251 states and 7314 transitions. [2025-03-17 15:50:55,499 INFO L78 Accepts]: Start accepts. Automaton has 5251 states and 7314 transitions. Word has length 57 [2025-03-17 15:50:55,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:55,499 INFO L471 AbstractCegarLoop]: Abstraction has 5251 states and 7314 transitions. [2025-03-17 15:50:55,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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-17 15:50:55,500 INFO L276 IsEmpty]: Start isEmpty. Operand 5251 states and 7314 transitions. [2025-03-17 15:50:55,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-17 15:50:55,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:55,501 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:55,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 15:50:55,501 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 15:50:55,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:55,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1221098688, now seen corresponding path program 1 times [2025-03-17 15:50:55,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:55,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824292691] [2025-03-17 15:50:55,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:55,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:55,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 15:50:55,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 15:50:55,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:55,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:55,568 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 15:50:55,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:55,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824292691] [2025-03-17 15:50:55,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824292691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:55,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:55,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:50:55,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101984643] [2025-03-17 15:50:55,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:55,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:50:55,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:55,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:50:55,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:50:55,570 INFO L87 Difference]: Start difference. First operand 5251 states and 7314 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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-17 15:50:55,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:55,722 INFO L93 Difference]: Finished difference Result 6916 states and 9762 transitions. [2025-03-17 15:50:55,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:50:55,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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) Word has length 58 [2025-03-17 15:50:55,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:55,735 INFO L225 Difference]: With dead ends: 6916 [2025-03-17 15:50:55,735 INFO L226 Difference]: Without dead ends: 6913 [2025-03-17 15:50:55,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:50:55,738 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 86 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:55,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 211 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:55,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6913 states. [2025-03-17 15:50:55,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6913 to 6907. [2025-03-17 15:50:55,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6907 states, 6898 states have (on average 1.3943171933893883) internal successors, (9618), 6906 states have internal predecessors, (9618), 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-17 15:50:55,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6907 states to 6907 states and 9618 transitions. [2025-03-17 15:50:55,905 INFO L78 Accepts]: Start accepts. Automaton has 6907 states and 9618 transitions. Word has length 58 [2025-03-17 15:50:55,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:55,906 INFO L471 AbstractCegarLoop]: Abstraction has 6907 states and 9618 transitions. [2025-03-17 15:50:55,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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-17 15:50:55,906 INFO L276 IsEmpty]: Start isEmpty. Operand 6907 states and 9618 transitions. [2025-03-17 15:50:55,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-17 15:50:55,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:55,907 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:55,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 15:50:55,907 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 15:50:55,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:55,907 INFO L85 PathProgramCache]: Analyzing trace with hash -800646332, now seen corresponding path program 1 times [2025-03-17 15:50:55,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:55,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669662359] [2025-03-17 15:50:55,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:55,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:55,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 15:50:55,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 15:50:55,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:55,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:55,973 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 15:50:55,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:55,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669662359] [2025-03-17 15:50:55,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669662359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:55,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:55,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:50:55,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695310451] [2025-03-17 15:50:55,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:55,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:50:55,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:55,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:50:55,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:50:55,974 INFO L87 Difference]: Start difference. First operand 6907 states and 9618 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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-17 15:50:56,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:56,153 INFO L93 Difference]: Finished difference Result 13107 states and 18738 transitions. [2025-03-17 15:50:56,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:50:56,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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) Word has length 59 [2025-03-17 15:50:56,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:56,167 INFO L225 Difference]: With dead ends: 13107 [2025-03-17 15:50:56,167 INFO L226 Difference]: Without dead ends: 8130 [2025-03-17 15:50:56,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:50:56,173 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 240 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:56,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 205 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:56,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8130 states. [2025-03-17 15:50:56,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8130 to 6735. [2025-03-17 15:50:56,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6735 states, 6726 states have (on average 1.4002378828427) internal successors, (9418), 6734 states have internal predecessors, (9418), 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-17 15:50:56,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6735 states to 6735 states and 9418 transitions. [2025-03-17 15:50:56,279 INFO L78 Accepts]: Start accepts. Automaton has 6735 states and 9418 transitions. Word has length 59 [2025-03-17 15:50:56,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:56,279 INFO L471 AbstractCegarLoop]: Abstraction has 6735 states and 9418 transitions. [2025-03-17 15:50:56,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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-17 15:50:56,280 INFO L276 IsEmpty]: Start isEmpty. Operand 6735 states and 9418 transitions. [2025-03-17 15:50:56,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-17 15:50:56,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:56,281 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:56,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 15:50:56,281 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 15:50:56,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:56,281 INFO L85 PathProgramCache]: Analyzing trace with hash 949767486, now seen corresponding path program 1 times [2025-03-17 15:50:56,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:56,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258781821] [2025-03-17 15:50:56,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:56,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:56,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 15:50:56,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 15:50:56,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:56,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:56,358 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 15:50:56,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:56,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258781821] [2025-03-17 15:50:56,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258781821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:56,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:56,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:50:56,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702132456] [2025-03-17 15:50:56,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:56,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:50:56,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:56,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:50:56,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:50:56,359 INFO L87 Difference]: Start difference. First operand 6735 states and 9418 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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-17 15:50:56,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:56,513 INFO L93 Difference]: Finished difference Result 11439 states and 16250 transitions. [2025-03-17 15:50:56,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:50:56,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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) Word has length 60 [2025-03-17 15:50:56,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:56,525 INFO L225 Difference]: With dead ends: 11439 [2025-03-17 15:50:56,525 INFO L226 Difference]: Without dead ends: 7014 [2025-03-17 15:50:56,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:50:56,531 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 202 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:56,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 290 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:56,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7014 states. [2025-03-17 15:50:56,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7014 to 7011. [2025-03-17 15:50:56,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7011 states, 7002 states have (on average 1.3953156241073978) internal successors, (9770), 7010 states have internal predecessors, (9770), 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-17 15:50:56,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7011 states to 7011 states and 9770 transitions. [2025-03-17 15:50:56,652 INFO L78 Accepts]: Start accepts. Automaton has 7011 states and 9770 transitions. Word has length 60 [2025-03-17 15:50:56,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:56,652 INFO L471 AbstractCegarLoop]: Abstraction has 7011 states and 9770 transitions. [2025-03-17 15:50:56,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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-17 15:50:56,652 INFO L276 IsEmpty]: Start isEmpty. Operand 7011 states and 9770 transitions. [2025-03-17 15:50:56,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 15:50:56,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:56,653 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:56,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 15:50:56,653 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 15:50:56,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:56,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1373908469, now seen corresponding path program 1 times [2025-03-17 15:50:56,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:56,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273436423] [2025-03-17 15:50:56,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:56,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:56,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 15:50:56,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 15:50:56,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:56,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:56,730 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:50:56,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:56,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273436423] [2025-03-17 15:50:56,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273436423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:56,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:56,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:50:56,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215612064] [2025-03-17 15:50:56,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:56,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:50:56,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:56,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:50:56,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:50:56,731 INFO L87 Difference]: Start difference. First operand 7011 states and 9770 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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-17 15:50:56,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:56,871 INFO L93 Difference]: Finished difference Result 7397 states and 10290 transitions. [2025-03-17 15:50:56,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:50:56,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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) Word has length 61 [2025-03-17 15:50:56,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:56,883 INFO L225 Difference]: With dead ends: 7397 [2025-03-17 15:50:56,883 INFO L226 Difference]: Without dead ends: 7394 [2025-03-17 15:50:56,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:50:56,886 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 162 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:56,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 269 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:56,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7394 states. [2025-03-17 15:50:57,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7394 to 7391. [2025-03-17 15:50:57,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7391 states, 7382 states have (on average 1.385261446762395) internal successors, (10226), 7390 states have internal predecessors, (10226), 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-17 15:50:57,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7391 states to 7391 states and 10226 transitions. [2025-03-17 15:50:57,025 INFO L78 Accepts]: Start accepts. Automaton has 7391 states and 10226 transitions. Word has length 61 [2025-03-17 15:50:57,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:57,025 INFO L471 AbstractCegarLoop]: Abstraction has 7391 states and 10226 transitions. [2025-03-17 15:50:57,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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-17 15:50:57,026 INFO L276 IsEmpty]: Start isEmpty. Operand 7391 states and 10226 transitions. [2025-03-17 15:50:57,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 15:50:57,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:57,027 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:57,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 15:50:57,027 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 15:50:57,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:57,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1040345060, now seen corresponding path program 1 times [2025-03-17 15:50:57,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:57,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939211373] [2025-03-17 15:50:57,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:57,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:57,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 15:50:57,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 15:50:57,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:57,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:57,086 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 15:50:57,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:57,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939211373] [2025-03-17 15:50:57,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939211373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:57,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:57,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:50:57,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050886351] [2025-03-17 15:50:57,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:57,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:50:57,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:57,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:50:57,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:50:57,087 INFO L87 Difference]: Start difference. First operand 7391 states and 10226 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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-17 15:50:57,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:57,224 INFO L93 Difference]: Finished difference Result 9611 states and 13490 transitions. [2025-03-17 15:50:57,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:50:57,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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) Word has length 62 [2025-03-17 15:50:57,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:57,240 INFO L225 Difference]: With dead ends: 9611 [2025-03-17 15:50:57,240 INFO L226 Difference]: Without dead ends: 9608 [2025-03-17 15:50:57,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:50:57,244 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 121 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:57,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 308 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:57,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9608 states. [2025-03-17 15:50:57,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9608 to 9047. [2025-03-17 15:50:57,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9047 states, 9038 states have (on average 1.3704359371542376) internal successors, (12386), 9046 states have internal predecessors, (12386), 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-17 15:50:57,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9047 states to 9047 states and 12386 transitions. [2025-03-17 15:50:57,405 INFO L78 Accepts]: Start accepts. Automaton has 9047 states and 12386 transitions. Word has length 62 [2025-03-17 15:50:57,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:57,405 INFO L471 AbstractCegarLoop]: Abstraction has 9047 states and 12386 transitions. [2025-03-17 15:50:57,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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-17 15:50:57,405 INFO L276 IsEmpty]: Start isEmpty. Operand 9047 states and 12386 transitions. [2025-03-17 15:50:57,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-17 15:50:57,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:57,406 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:57,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 15:50:57,406 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 15:50:57,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:57,407 INFO L85 PathProgramCache]: Analyzing trace with hash -2109041504, now seen corresponding path program 1 times [2025-03-17 15:50:57,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:57,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054733882] [2025-03-17 15:50:57,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:57,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:57,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 15:50:57,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 15:50:57,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:57,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:57,499 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 15:50:57,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:57,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054733882] [2025-03-17 15:50:57,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054733882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:57,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:57,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:50:57,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129173285] [2025-03-17 15:50:57,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:57,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:50:57,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:57,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:50:57,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:50:57,500 INFO L87 Difference]: Start difference. First operand 9047 states and 12386 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 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-17 15:50:57,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:57,664 INFO L93 Difference]: Finished difference Result 11001 states and 15082 transitions. [2025-03-17 15:50:57,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:50:57,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 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) Word has length 63 [2025-03-17 15:50:57,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:57,678 INFO L225 Difference]: With dead ends: 11001 [2025-03-17 15:50:57,678 INFO L226 Difference]: Without dead ends: 7131 [2025-03-17 15:50:57,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:50:57,687 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 141 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:57,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 243 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:57,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7131 states. [2025-03-17 15:50:57,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7131 to 5363. [2025-03-17 15:50:57,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5363 states, 5354 states have (on average 1.3556219648860666) internal successors, (7258), 5362 states have internal predecessors, (7258), 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-17 15:50:57,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5363 states to 5363 states and 7258 transitions. [2025-03-17 15:50:57,806 INFO L78 Accepts]: Start accepts. Automaton has 5363 states and 7258 transitions. Word has length 63 [2025-03-17 15:50:57,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:57,806 INFO L471 AbstractCegarLoop]: Abstraction has 5363 states and 7258 transitions. [2025-03-17 15:50:57,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 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-17 15:50:57,807 INFO L276 IsEmpty]: Start isEmpty. Operand 5363 states and 7258 transitions. [2025-03-17 15:50:57,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-17 15:50:57,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:57,808 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:57,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 15:50:57,808 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 15:50:57,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:57,808 INFO L85 PathProgramCache]: Analyzing trace with hash -955777182, now seen corresponding path program 1 times [2025-03-17 15:50:57,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:57,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503196257] [2025-03-17 15:50:57,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:57,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:57,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 15:50:57,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 15:50:57,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:57,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:57,897 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 15:50:57,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:57,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503196257] [2025-03-17 15:50:57,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503196257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:57,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:57,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:50:57,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671105873] [2025-03-17 15:50:57,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:57,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:50:57,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:57,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:50:57,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:50:57,899 INFO L87 Difference]: Start difference. First operand 5363 states and 7258 transitions. Second operand has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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-17 15:50:58,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:58,022 INFO L93 Difference]: Finished difference Result 6381 states and 8722 transitions. [2025-03-17 15:50:58,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:50:58,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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) Word has length 64 [2025-03-17 15:50:58,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:58,033 INFO L225 Difference]: With dead ends: 6381 [2025-03-17 15:50:58,033 INFO L226 Difference]: Without dead ends: 6380 [2025-03-17 15:50:58,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:50:58,036 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 146 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:58,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 291 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:58,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6380 states. [2025-03-17 15:50:58,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6380 to 6371. [2025-03-17 15:50:58,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6371 states, 6362 states have (on average 1.369695064445143) internal successors, (8714), 6370 states have internal predecessors, (8714), 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-17 15:50:58,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6371 states to 6371 states and 8714 transitions. [2025-03-17 15:50:58,146 INFO L78 Accepts]: Start accepts. Automaton has 6371 states and 8714 transitions. Word has length 64 [2025-03-17 15:50:58,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:58,146 INFO L471 AbstractCegarLoop]: Abstraction has 6371 states and 8714 transitions. [2025-03-17 15:50:58,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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-17 15:50:58,147 INFO L276 IsEmpty]: Start isEmpty. Operand 6371 states and 8714 transitions. [2025-03-17 15:50:58,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-17 15:50:58,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:58,147 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:58,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 15:50:58,147 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 15:50:58,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:58,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1505566110, now seen corresponding path program 1 times [2025-03-17 15:50:58,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:58,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313006223] [2025-03-17 15:50:58,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:58,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:58,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 15:50:58,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 15:50:58,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:58,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:58,225 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 15:50:58,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:58,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313006223] [2025-03-17 15:50:58,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313006223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:58,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:58,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:50:58,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942576277] [2025-03-17 15:50:58,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:58,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:50:58,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:58,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:50:58,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:50:58,226 INFO L87 Difference]: Start difference. First operand 6371 states and 8714 transitions. Second operand has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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-17 15:50:58,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:58,368 INFO L93 Difference]: Finished difference Result 6653 states and 9098 transitions. [2025-03-17 15:50:58,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:50:58,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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) Word has length 64 [2025-03-17 15:50:58,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:58,380 INFO L225 Difference]: With dead ends: 6653 [2025-03-17 15:50:58,380 INFO L226 Difference]: Without dead ends: 6650 [2025-03-17 15:50:58,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:50:58,383 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 137 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:58,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 339 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:58,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6650 states. [2025-03-17 15:50:58,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6650 to 6647. [2025-03-17 15:50:58,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6647 states, 6638 states have (on average 1.3669780054233203) internal successors, (9074), 6646 states have internal predecessors, (9074), 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-17 15:50:58,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6647 states to 6647 states and 9074 transitions. [2025-03-17 15:50:58,477 INFO L78 Accepts]: Start accepts. Automaton has 6647 states and 9074 transitions. Word has length 64 [2025-03-17 15:50:58,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:58,477 INFO L471 AbstractCegarLoop]: Abstraction has 6647 states and 9074 transitions. [2025-03-17 15:50:58,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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-17 15:50:58,477 INFO L276 IsEmpty]: Start isEmpty. Operand 6647 states and 9074 transitions. [2025-03-17 15:50:58,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-17 15:50:58,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:58,478 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:58,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 15:50:58,478 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 15:50:58,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:58,479 INFO L85 PathProgramCache]: Analyzing trace with hash -712973690, now seen corresponding path program 1 times [2025-03-17 15:50:58,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:58,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154943725] [2025-03-17 15:50:58,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:58,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:58,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 15:50:58,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 15:50:58,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:58,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:58,551 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 15:50:58,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:58,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154943725] [2025-03-17 15:50:58,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154943725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:58,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:58,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:50:58,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751458619] [2025-03-17 15:50:58,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:58,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:50:58,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:58,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:50:58,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:50:58,552 INFO L87 Difference]: Start difference. First operand 6647 states and 9074 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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-17 15:50:58,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:58,676 INFO L93 Difference]: Finished difference Result 6832 states and 9314 transitions. [2025-03-17 15:50:58,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:50:58,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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) Word has length 68 [2025-03-17 15:50:58,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:58,687 INFO L225 Difference]: With dead ends: 6832 [2025-03-17 15:50:58,687 INFO L226 Difference]: Without dead ends: 6471 [2025-03-17 15:50:58,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:50:58,690 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 144 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:58,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 351 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:58,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6471 states. [2025-03-17 15:50:58,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6471 to 6467. [2025-03-17 15:50:58,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6467 states, 6458 states have (on average 1.3660576029730567) internal successors, (8822), 6466 states have internal predecessors, (8822), 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-17 15:50:58,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6467 states to 6467 states and 8822 transitions. [2025-03-17 15:50:58,808 INFO L78 Accepts]: Start accepts. Automaton has 6467 states and 8822 transitions. Word has length 68 [2025-03-17 15:50:58,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:58,808 INFO L471 AbstractCegarLoop]: Abstraction has 6467 states and 8822 transitions. [2025-03-17 15:50:58,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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-17 15:50:58,808 INFO L276 IsEmpty]: Start isEmpty. Operand 6467 states and 8822 transitions. [2025-03-17 15:50:58,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-17 15:50:58,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:58,810 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:58,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 15:50:58,810 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 15:50:58,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:58,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1052499524, now seen corresponding path program 1 times [2025-03-17 15:50:58,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:58,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053807] [2025-03-17 15:50:58,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:58,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:58,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 15:50:58,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 15:50:58,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:58,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:58,878 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:50:58,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:58,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053807] [2025-03-17 15:50:58,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:58,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:58,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:50:58,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256622661] [2025-03-17 15:50:58,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:58,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:50:58,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:58,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:50:58,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:50:58,880 INFO L87 Difference]: Start difference. First operand 6467 states and 8822 transitions. Second operand has 4 states, 3 states have (on average 26.0) internal successors, (78), 4 states have internal predecessors, (78), 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-17 15:50:58,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:58,988 INFO L93 Difference]: Finished difference Result 6653 states and 9058 transitions. [2025-03-17 15:50:58,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:50:58,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 26.0) internal successors, (78), 4 states have internal predecessors, (78), 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) Word has length 81 [2025-03-17 15:50:58,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:58,999 INFO L225 Difference]: With dead ends: 6653 [2025-03-17 15:50:58,999 INFO L226 Difference]: Without dead ends: 6650 [2025-03-17 15:50:59,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:50:59,001 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 99 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:59,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 261 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:59,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6650 states. [2025-03-17 15:50:59,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6650 to 6464. [2025-03-17 15:50:59,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6464 states, 6458 states have (on average 1.328894394549396) internal successors, (8582), 6463 states have internal predecessors, (8582), 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-17 15:50:59,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6464 states to 6464 states and 8582 transitions. [2025-03-17 15:50:59,088 INFO L78 Accepts]: Start accepts. Automaton has 6464 states and 8582 transitions. Word has length 81 [2025-03-17 15:50:59,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:59,088 INFO L471 AbstractCegarLoop]: Abstraction has 6464 states and 8582 transitions. [2025-03-17 15:50:59,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 26.0) internal successors, (78), 4 states have internal predecessors, (78), 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-17 15:50:59,089 INFO L276 IsEmpty]: Start isEmpty. Operand 6464 states and 8582 transitions. [2025-03-17 15:50:59,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-17 15:50:59,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:59,091 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:59,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 15:50:59,091 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 15:50:59,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:59,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1107865005, now seen corresponding path program 1 times [2025-03-17 15:50:59,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:59,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134582117] [2025-03-17 15:50:59,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:59,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:59,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 15:50:59,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 15:50:59,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:59,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:59,164 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 15:50:59,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:59,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134582117] [2025-03-17 15:50:59,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134582117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:59,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:59,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:50:59,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821070749] [2025-03-17 15:50:59,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:59,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:50:59,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:59,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:50:59,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:50:59,166 INFO L87 Difference]: Start difference. First operand 6464 states and 8582 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 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-17 15:50:59,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:59,303 INFO L93 Difference]: Finished difference Result 6847 states and 9070 transitions. [2025-03-17 15:50:59,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:50:59,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 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) Word has length 82 [2025-03-17 15:50:59,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:59,314 INFO L225 Difference]: With dead ends: 6847 [2025-03-17 15:50:59,314 INFO L226 Difference]: Without dead ends: 6844 [2025-03-17 15:50:59,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:50:59,317 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 116 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:59,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 292 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:59,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6844 states. [2025-03-17 15:50:59,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6844 to 6084. [2025-03-17 15:50:59,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6084 states, 6078 states have (on average 1.326423165514972) internal successors, (8062), 6083 states have internal predecessors, (8062), 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-17 15:50:59,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6084 states to 6084 states and 8062 transitions. [2025-03-17 15:50:59,416 INFO L78 Accepts]: Start accepts. Automaton has 6084 states and 8062 transitions. Word has length 82 [2025-03-17 15:50:59,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:59,416 INFO L471 AbstractCegarLoop]: Abstraction has 6084 states and 8062 transitions. [2025-03-17 15:50:59,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 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-17 15:50:59,416 INFO L276 IsEmpty]: Start isEmpty. Operand 6084 states and 8062 transitions. [2025-03-17 15:50:59,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 15:50:59,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:59,418 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:59,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 15:50:59,419 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 15:50:59,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:59,419 INFO L85 PathProgramCache]: Analyzing trace with hash -2134727878, now seen corresponding path program 1 times [2025-03-17 15:50:59,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:59,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615394200] [2025-03-17 15:50:59,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:59,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:59,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 15:50:59,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 15:50:59,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:59,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:59,516 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:50:59,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:59,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615394200] [2025-03-17 15:50:59,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615394200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:59,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:59,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:50:59,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080309860] [2025-03-17 15:50:59,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:59,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:50:59,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:59,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:50:59,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:50:59,518 INFO L87 Difference]: Start difference. First operand 6084 states and 8062 transitions. Second operand has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 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-17 15:50:59,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:59,664 INFO L93 Difference]: Finished difference Result 9303 states and 12434 transitions. [2025-03-17 15:50:59,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:50:59,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 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) Word has length 83 [2025-03-17 15:50:59,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:59,673 INFO L225 Difference]: With dead ends: 9303 [2025-03-17 15:50:59,673 INFO L226 Difference]: Without dead ends: 5617 [2025-03-17 15:50:59,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:50:59,678 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 136 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:59,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 369 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:59,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5617 states. [2025-03-17 15:50:59,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5617 to 5608. [2025-03-17 15:50:59,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5608 states, 5602 states have (on average 1.320599785790789) internal successors, (7398), 5607 states have internal predecessors, (7398), 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-17 15:50:59,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5608 states to 5608 states and 7398 transitions. [2025-03-17 15:50:59,752 INFO L78 Accepts]: Start accepts. Automaton has 5608 states and 7398 transitions. Word has length 83 [2025-03-17 15:50:59,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:59,752 INFO L471 AbstractCegarLoop]: Abstraction has 5608 states and 7398 transitions. [2025-03-17 15:50:59,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 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-17 15:50:59,752 INFO L276 IsEmpty]: Start isEmpty. Operand 5608 states and 7398 transitions. [2025-03-17 15:50:59,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 15:50:59,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:59,754 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:59,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 15:50:59,755 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 15:50:59,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:59,755 INFO L85 PathProgramCache]: Analyzing trace with hash 985872456, now seen corresponding path program 2 times [2025-03-17 15:50:59,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:59,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36791754] [2025-03-17 15:50:59,756 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:50:59,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:59,763 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-17 15:50:59,785 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 15:50:59,786 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:50:59,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:59,842 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 31 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 15:50:59,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:59,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36791754] [2025-03-17 15:50:59,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36791754] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:50:59,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728373212] [2025-03-17 15:50:59,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:50:59,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:50:59,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:50:59,846 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:50:59,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 15:50:59,904 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-17 15:50:59,941 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 15:50:59,941 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:50:59,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:59,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 15:50:59,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:51:00,070 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 15:51:00,070 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:51:00,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728373212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:51:00,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:51:00,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-17 15:51:00,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541499668] [2025-03-17 15:51:00,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:51:00,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:51:00,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:51:00,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:51:00,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:51:00,071 INFO L87 Difference]: Start difference. First operand 5608 states and 7398 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 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-17 15:51:00,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:51:00,182 INFO L93 Difference]: Finished difference Result 5611 states and 7398 transitions. [2025-03-17 15:51:00,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:51:00,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 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) Word has length 83 [2025-03-17 15:51:00,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:51:00,191 INFO L225 Difference]: With dead ends: 5611 [2025-03-17 15:51:00,191 INFO L226 Difference]: Without dead ends: 4696 [2025-03-17 15:51:00,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:51:00,196 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 159 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:51:00,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 168 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:51:00,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4696 states. [2025-03-17 15:51:00,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4696 to 3868. [2025-03-17 15:51:00,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3868 states, 3862 states have (on average 1.2817193164163645) internal successors, (4950), 3867 states have internal predecessors, (4950), 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-17 15:51:00,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3868 states to 3868 states and 4950 transitions. [2025-03-17 15:51:00,279 INFO L78 Accepts]: Start accepts. Automaton has 3868 states and 4950 transitions. Word has length 83 [2025-03-17 15:51:00,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:51:00,279 INFO L471 AbstractCegarLoop]: Abstraction has 3868 states and 4950 transitions. [2025-03-17 15:51:00,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 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-17 15:51:00,280 INFO L276 IsEmpty]: Start isEmpty. Operand 3868 states and 4950 transitions. [2025-03-17 15:51:00,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-17 15:51:00,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:51:00,281 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:51:00,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 15:51:00,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-17 15:51:00,486 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 15:51:00,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:51:00,486 INFO L85 PathProgramCache]: Analyzing trace with hash 676388294, now seen corresponding path program 1 times [2025-03-17 15:51:00,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:51:00,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854881560] [2025-03-17 15:51:00,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:00,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:51:00,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-17 15:51:00,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 15:51:00,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:00,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:00,596 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:51:00,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:51:00,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854881560] [2025-03-17 15:51:00,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854881560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:51:00,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:51:00,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:51:00,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118916693] [2025-03-17 15:51:00,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:51:00,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:51:00,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:51:00,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:51:00,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:51:00,597 INFO L87 Difference]: Start difference. First operand 3868 states and 4950 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 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-17 15:51:00,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:51:00,702 INFO L93 Difference]: Finished difference Result 4316 states and 5536 transitions. [2025-03-17 15:51:00,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:51:00,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 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) Word has length 84 [2025-03-17 15:51:00,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:51:00,705 INFO L225 Difference]: With dead ends: 4316 [2025-03-17 15:51:00,705 INFO L226 Difference]: Without dead ends: 1449 [2025-03-17 15:51:00,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:51:00,708 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 101 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:51:00,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 289 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:51:00,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2025-03-17 15:51:00,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1449. [2025-03-17 15:51:00,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1449 states, 1446 states have (on average 1.2503457814661134) internal successors, (1808), 1448 states have internal predecessors, (1808), 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-17 15:51:00,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 1808 transitions. [2025-03-17 15:51:00,741 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 1808 transitions. Word has length 84 [2025-03-17 15:51:00,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:51:00,742 INFO L471 AbstractCegarLoop]: Abstraction has 1449 states and 1808 transitions. [2025-03-17 15:51:00,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 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-17 15:51:00,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 1808 transitions. [2025-03-17 15:51:00,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 15:51:00,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:51:00,743 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:51:00,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 15:51:00,744 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-17 15:51:00,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:51:00,745 INFO L85 PathProgramCache]: Analyzing trace with hash -576504324, now seen corresponding path program 1 times [2025-03-17 15:51:00,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:51:00,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045877616] [2025-03-17 15:51:00,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:00,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:51:00,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 15:51:00,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 15:51:00,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:00,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:00,850 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 15:51:00,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:51:00,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045877616] [2025-03-17 15:51:00,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045877616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:51:00,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:51:00,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:51:00,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181833039] [2025-03-17 15:51:00,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:51:00,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:51:00,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:51:00,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:51:00,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:51:00,851 INFO L87 Difference]: Start difference. First operand 1449 states and 1808 transitions. Second operand has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 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-17 15:51:00,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:51:00,934 INFO L93 Difference]: Finished difference Result 1449 states and 1808 transitions. [2025-03-17 15:51:00,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:51:00,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 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) Word has length 85 [2025-03-17 15:51:00,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:51:00,935 INFO L225 Difference]: With dead ends: 1449 [2025-03-17 15:51:00,935 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 15:51:00,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:51:00,936 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 110 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:51:00,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 242 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:51:00,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 15:51:00,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 15:51:00,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-17 15:51:00,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 15:51:00,937 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2025-03-17 15:51:00,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:51:00,938 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 15:51:00,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 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-17 15:51:00,939 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 15:51:00,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 15:51:00,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2025-03-17 15:51:00,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2025-03-17 15:51:00,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2025-03-17 15:51:00,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2025-03-17 15:51:00,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2025-03-17 15:51:00,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2025-03-17 15:51:00,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2025-03-17 15:51:00,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2025-03-17 15:51:00,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2025-03-17 15:51:00,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2025-03-17 15:51:00,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2025-03-17 15:51:00,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2025-03-17 15:51:00,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2025-03-17 15:51:00,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2025-03-17 15:51:00,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 15:51:00,944 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:51:00,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 15:51:04,773 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 15:51:04,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:51:04 BoogieIcfgContainer [2025-03-17 15:51:04,788 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 15:51:04,789 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 15:51:04,789 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 15:51:04,789 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 15:51:04,790 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:50:51" (3/4) ... [2025-03-17 15:51:04,791 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 15:51:04,800 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-17 15:51:04,800 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 15:51:04,800 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 15:51:04,801 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 15:51:04,876 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 15:51:04,877 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 15:51:04,877 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 15:51:04,877 INFO L158 Benchmark]: Toolchain (without parser) took 14325.28ms. Allocated memory was 167.8MB in the beginning and 939.5MB in the end (delta: 771.8MB). Free memory was 132.2MB in the beginning and 599.7MB in the end (delta: -467.5MB). Peak memory consumption was 299.9MB. Max. memory is 16.1GB. [2025-03-17 15:51:04,878 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:51:04,878 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.56ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 118.7MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 15:51:04,878 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.81ms. Allocated memory is still 167.8MB. Free memory was 118.7MB in the beginning and 116.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:51:04,878 INFO L158 Benchmark]: Boogie Preprocessor took 36.33ms. Allocated memory is still 167.8MB. Free memory was 116.6MB in the beginning and 115.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:51:04,879 INFO L158 Benchmark]: IcfgBuilder took 401.84ms. Allocated memory is still 167.8MB. Free memory was 115.0MB in the beginning and 92.7MB in the end (delta: 22.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 15:51:04,879 INFO L158 Benchmark]: TraceAbstraction took 13565.39ms. Allocated memory was 167.8MB in the beginning and 939.5MB in the end (delta: 771.8MB). Free memory was 91.9MB in the beginning and 608.0MB in the end (delta: -516.1MB). Peak memory consumption was 564.4MB. Max. memory is 16.1GB. [2025-03-17 15:51:04,881 INFO L158 Benchmark]: Witness Printer took 87.79ms. Allocated memory is still 939.5MB. Free memory was 608.0MB in the beginning and 599.7MB in the end (delta: 8.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:51:04,881 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.35ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 191.56ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 118.7MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.81ms. Allocated memory is still 167.8MB. Free memory was 118.7MB in the beginning and 116.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.33ms. Allocated memory is still 167.8MB. Free memory was 116.6MB in the beginning and 115.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 401.84ms. Allocated memory is still 167.8MB. Free memory was 115.0MB in the beginning and 92.7MB in the end (delta: 22.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 13565.39ms. Allocated memory was 167.8MB in the beginning and 939.5MB in the end (delta: 771.8MB). Free memory was 91.9MB in the beginning and 608.0MB in the end (delta: -516.1MB). Peak memory consumption was 564.4MB. Max. memory is 16.1GB. * Witness Printer took 87.79ms. Allocated memory is still 939.5MB. Free memory was 608.0MB in the beginning and 599.7MB in the end (delta: 8.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 219]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 219]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 219]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 219]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 214]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 214]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 214]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 214]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 210]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 210]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 210]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 210]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 114 edges, 14 error locations. Started 1 CEGAR loops. OverallTime: 9.7s, OverallIterations: 31, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4476 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4476 mSDsluCounter, 7453 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3729 mSDsCounter, 166 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2889 IncrementalHoareTripleChecker+Invalid, 3055 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 166 mSolverCounterUnsat, 3724 mSDtfsCounter, 2889 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 211 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9047occurred in iteration=21, InterpolantAutomatonStates: 142, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 31 MinimizatonAttempts, 7304 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1755 NumberOfCodeBlocks, 1755 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1723 ConstructedInterpolants, 0 QuantifiedInterpolants, 6716 SizeOfPredicates, 0 NumberOfNonLiveVariables, 306 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 32 InterpolantComputations, 31 PerfectInterpolantSequences, 427/431 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 14 specifications checked. All of them hold - InvariantResult [Line: 262]: Location Invariant Derived location invariant: (((((((((st1 == 1) && (st3 == 1)) && (st2 == 0)) || (((st3 == 1) && (st1 == 0)) && (st2 == 0))) || ((((st1 == 1) && (st2 == 1)) && (st3 <= 1)) && (0 <= st3))) || (((st3 == 0) && (st1 == 0)) && (st2 == 0))) || (((st1 == 1) && (st3 == 0)) && (st2 == 0))) || (((st2 == 1) && (st3 == 1)) && (st1 == 0))) || (((st2 == 1) && (st3 == 0)) && (st1 == 0))) RESULT: Ultimate proved your program to be correct! [2025-03-17 15:51:04,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE