./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-invgen/id_build.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 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/loop-invgen/id_build.i -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 2c4c8975bee6324b0c0486aa99ba8be369d6762a33e8dd5b012191d5fa43c106 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:44:11,739 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:44:11,794 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:44:11,798 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:44:11,799 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:44:11,818 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:44:11,818 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:44:11,819 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:44:11,819 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:44:11,819 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:44:11,820 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:44:11,820 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:44:11,820 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:44:11,820 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:44:11,821 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:44:11,821 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:44:11,821 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:44:11,821 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:44:11,821 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:44:11,821 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:44:11,821 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:44:11,821 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:44:11,821 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:44:11,821 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:44:11,821 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:44:11,821 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:44:11,822 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:44:11,822 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:44:11,822 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:44:11,822 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:44:11,822 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:44:11,822 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:44:11,822 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:44:11,822 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:44:11,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:44:11,822 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:44:11,822 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:44:11,822 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:44:11,822 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:44:11,822 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:44:11,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:44:11,822 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:44:11,822 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:44:11,823 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:44:11,823 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:44:11,823 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 -> 2c4c8975bee6324b0c0486aa99ba8be369d6762a33e8dd5b012191d5fa43c106 [2025-03-04 10:44:12,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:44:12,052 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:44:12,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:44:12,054 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:44:12,054 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:44:12,055 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/id_build.i [2025-03-04 10:44:13,133 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a5c95d2f/8d738355da0946d6b671d6cd0495f8dc/FLAG16eb81664 [2025-03-04 10:44:13,354 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:44:13,355 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/id_build.i [2025-03-04 10:44:13,362 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a5c95d2f/8d738355da0946d6b671d6cd0495f8dc/FLAG16eb81664 [2025-03-04 10:44:13,397 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a5c95d2f/8d738355da0946d6b671d6cd0495f8dc [2025-03-04 10:44:13,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:44:13,402 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:44:13,403 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:44:13,403 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:44:13,408 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:44:13,409 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:44:13" (1/1) ... [2025-03-04 10:44:13,409 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@471a0bcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:13, skipping insertion in model container [2025-03-04 10:44:13,411 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:44:13" (1/1) ... [2025-03-04 10:44:13,422 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:44:13,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:44:13,540 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:44:13,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:44:13,566 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:44:13,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:13 WrapperNode [2025-03-04 10:44:13,567 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:44:13,568 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:44:13,569 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:44:13,569 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:44:13,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:13" (1/1) ... [2025-03-04 10:44:13,578 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:13" (1/1) ... [2025-03-04 10:44:13,587 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 50 [2025-03-04 10:44:13,589 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:44:13,590 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:44:13,590 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:44:13,590 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:44:13,596 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:13" (1/1) ... [2025-03-04 10:44:13,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:13" (1/1) ... [2025-03-04 10:44:13,600 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:13" (1/1) ... [2025-03-04 10:44:13,608 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-04 10:44:13,608 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:13" (1/1) ... [2025-03-04 10:44:13,608 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:13" (1/1) ... [2025-03-04 10:44:13,610 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:13" (1/1) ... [2025-03-04 10:44:13,611 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:13" (1/1) ... [2025-03-04 10:44:13,611 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:13" (1/1) ... [2025-03-04 10:44:13,612 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:13" (1/1) ... [2025-03-04 10:44:13,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:44:13,613 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:44:13,613 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:44:13,613 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:44:13,615 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:13" (1/1) ... [2025-03-04 10:44:13,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:44:13,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:13,641 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-04 10:44:13,644 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-04 10:44:13,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:44:13,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:44:13,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:44:13,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:44:13,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 10:44:13,662 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 10:44:13,707 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:44:13,709 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:44:13,837 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-03-04 10:44:13,838 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:44:13,848 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:44:13,849 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:44:13,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:44:13 BoogieIcfgContainer [2025-03-04 10:44:13,850 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:44:13,851 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:44:13,851 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:44:13,854 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:44:13,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:44:13" (1/3) ... [2025-03-04 10:44:13,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56bf98ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:44:13, skipping insertion in model container [2025-03-04 10:44:13,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:13" (2/3) ... [2025-03-04 10:44:13,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56bf98ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:44:13, skipping insertion in model container [2025-03-04 10:44:13,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:44:13" (3/3) ... [2025-03-04 10:44:13,858 INFO L128 eAbstractionObserver]: Analyzing ICFG id_build.i [2025-03-04 10:44:13,869 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:44:13,870 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG id_build.i that has 2 procedures, 41 locations, 1 initial locations, 2 loop locations, and 12 error locations. [2025-03-04 10:44:13,914 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:44:13,924 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;@36270557, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:44:13,924 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-04 10:44:13,928 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 25 states have (on average 1.64) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:44:13,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 10:44:13,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:13,932 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:44:13,932 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:44:13,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:13,937 INFO L85 PathProgramCache]: Analyzing trace with hash 61042943, now seen corresponding path program 1 times [2025-03-04 10:44:13,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:13,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844174448] [2025-03-04 10:44:13,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:13,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:13,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:44:13,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:44:14,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:14,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:14,060 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-04 10:44:14,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:14,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844174448] [2025-03-04 10:44:14,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844174448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:14,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:44:14,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:44:14,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150946736] [2025-03-04 10:44:14,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:14,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:44:14,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:14,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:44:14,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:44:14,083 INFO L87 Difference]: Start difference. First operand has 41 states, 25 states have (on average 1.64) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:14,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:14,118 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2025-03-04 10:44:14,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:44:14,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2025-03-04 10:44:14,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:14,124 INFO L225 Difference]: With dead ends: 99 [2025-03-04 10:44:14,124 INFO L226 Difference]: Without dead ends: 55 [2025-03-04 10:44:14,126 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-04 10:44:14,129 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 17 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:14,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 75 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:14,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-04 10:44:14,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 36. [2025-03-04 10:44:14,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.619047619047619) internal successors, (34), 32 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:44:14,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2025-03-04 10:44:14,158 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 5 [2025-03-04 10:44:14,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:14,159 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2025-03-04 10:44:14,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:14,159 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2025-03-04 10:44:14,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 10:44:14,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:14,160 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:44:14,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:44:14,160 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:44:14,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:14,161 INFO L85 PathProgramCache]: Analyzing trace with hash 61043711, now seen corresponding path program 1 times [2025-03-04 10:44:14,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:14,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538129038] [2025-03-04 10:44:14,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:14,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:14,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:44:14,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:44:14,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:14,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:14,198 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-04 10:44:14,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:14,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538129038] [2025-03-04 10:44:14,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538129038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:14,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:44:14,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:44:14,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987934459] [2025-03-04 10:44:14,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:14,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:44:14,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:14,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:44:14,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:44:14,200 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:14,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:14,292 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2025-03-04 10:44:14,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:44:14,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2025-03-04 10:44:14,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:14,293 INFO L225 Difference]: With dead ends: 58 [2025-03-04 10:44:14,293 INFO L226 Difference]: Without dead ends: 54 [2025-03-04 10:44:14,293 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-04 10:44:14,294 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 50 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:14,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 42 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:44:14,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-04 10:44:14,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2025-03-04 10:44:14,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 44 states have internal predecessors, (53), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:44:14,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2025-03-04 10:44:14,299 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 5 [2025-03-04 10:44:14,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:14,299 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2025-03-04 10:44:14,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:14,299 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2025-03-04 10:44:14,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 10:44:14,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:14,300 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:44:14,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:44:14,300 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:44:14,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:14,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1892355038, now seen corresponding path program 1 times [2025-03-04 10:44:14,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:14,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508951597] [2025-03-04 10:44:14,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:14,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:14,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:44:14,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:44:14,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:14,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:14,337 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-04 10:44:14,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:14,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508951597] [2025-03-04 10:44:14,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508951597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:14,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:44:14,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:44:14,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686120703] [2025-03-04 10:44:14,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:14,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:44:14,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:14,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:44:14,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:44:14,340 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:14,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:14,367 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2025-03-04 10:44:14,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:44:14,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-03-04 10:44:14,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:14,368 INFO L225 Difference]: With dead ends: 50 [2025-03-04 10:44:14,368 INFO L226 Difference]: Without dead ends: 48 [2025-03-04 10:44:14,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-04 10:44:14,368 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:14,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 26 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:14,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-04 10:44:14,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-04 10:44:14,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.4) internal successors, (49), 42 states have internal predecessors, (49), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:44:14,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2025-03-04 10:44:14,374 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 6 [2025-03-04 10:44:14,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:14,374 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2025-03-04 10:44:14,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:14,374 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2025-03-04 10:44:14,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 10:44:14,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:14,374 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:14,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:44:14,375 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:44:14,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:14,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1782025148, now seen corresponding path program 1 times [2025-03-04 10:44:14,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:14,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310547867] [2025-03-04 10:44:14,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:14,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:14,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:44:14,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:44:14,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:14,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:14,417 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-04 10:44:14,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:14,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310547867] [2025-03-04 10:44:14,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310547867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:14,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:44:14,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:44:14,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978073522] [2025-03-04 10:44:14,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:14,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:44:14,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:14,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:44:14,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:44:14,419 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:14,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:14,460 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2025-03-04 10:44:14,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:44:14,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2025-03-04 10:44:14,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:14,461 INFO L225 Difference]: With dead ends: 52 [2025-03-04 10:44:14,461 INFO L226 Difference]: Without dead ends: 50 [2025-03-04 10:44:14,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-04 10:44:14,462 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 10 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:14,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 40 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:14,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-04 10:44:14,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2025-03-04 10:44:14,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 42 states have internal predecessors, (47), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:44:14,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2025-03-04 10:44:14,468 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 8 [2025-03-04 10:44:14,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:14,468 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2025-03-04 10:44:14,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:14,468 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2025-03-04 10:44:14,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 10:44:14,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:14,469 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:14,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:44:14,469 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:44:14,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:14,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1399047130, now seen corresponding path program 1 times [2025-03-04 10:44:14,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:14,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738308444] [2025-03-04 10:44:14,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:14,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:14,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:44:14,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:44:14,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:14,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:14,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:44:14,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:14,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738308444] [2025-03-04 10:44:14,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738308444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:14,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:44:14,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:44:14,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371634853] [2025-03-04 10:44:14,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:14,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:44:14,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:14,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:44:14,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:44:14,541 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:44:14,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:14,566 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2025-03-04 10:44:14,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:44:14,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-03-04 10:44:14,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:14,568 INFO L225 Difference]: With dead ends: 80 [2025-03-04 10:44:14,568 INFO L226 Difference]: Without dead ends: 78 [2025-03-04 10:44:14,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-04 10:44:14,568 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:14,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 81 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:14,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-04 10:44:14,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2025-03-04 10:44:14,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 57 states have (on average 1.280701754385965) internal successors, (73), 64 states have internal predecessors, (73), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 10:44:14,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 89 transitions. [2025-03-04 10:44:14,581 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 89 transitions. Word has length 24 [2025-03-04 10:44:14,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:14,581 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 89 transitions. [2025-03-04 10:44:14,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:44:14,582 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2025-03-04 10:44:14,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 10:44:14,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:14,582 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:14,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:44:14,582 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:44:14,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:14,583 INFO L85 PathProgramCache]: Analyzing trace with hash 650387566, now seen corresponding path program 1 times [2025-03-04 10:44:14,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:14,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907856011] [2025-03-04 10:44:14,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:14,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:14,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:44:14,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:44:14,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:14,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:14,660 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:44:14,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:14,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907856011] [2025-03-04 10:44:14,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907856011] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:44:14,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752506034] [2025-03-04 10:44:14,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:14,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:14,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:14,666 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-04 10:44:14,667 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-04 10:44:14,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:44:14,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:44:14,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:14,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:14,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:44:14,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:44:14,752 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:44:14,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:44:14,818 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:44:14,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752506034] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:44:14,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:44:14,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 10:44:14,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466152385] [2025-03-04 10:44:14,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:44:14,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:44:14,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:14,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:44:14,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:44:14,819 INFO L87 Difference]: Start difference. First operand 74 states and 89 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:44:14,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:14,877 INFO L93 Difference]: Finished difference Result 155 states and 186 transitions. [2025-03-04 10:44:14,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:44:14,879 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 27 [2025-03-04 10:44:14,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:14,880 INFO L225 Difference]: With dead ends: 155 [2025-03-04 10:44:14,880 INFO L226 Difference]: Without dead ends: 112 [2025-03-04 10:44:14,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:44:14,880 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 30 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:14,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 172 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:14,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-04 10:44:14,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 104. [2025-03-04 10:44:14,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 83 states have (on average 1.2650602409638554) internal successors, (105), 90 states have internal predecessors, (105), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 10:44:14,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 129 transitions. [2025-03-04 10:44:14,895 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 129 transitions. Word has length 27 [2025-03-04 10:44:14,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:14,895 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 129 transitions. [2025-03-04 10:44:14,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:44:14,895 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 129 transitions. [2025-03-04 10:44:14,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 10:44:14,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:14,896 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:14,902 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-04 10:44:15,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 10:44:15,097 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:44:15,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:15,098 INFO L85 PathProgramCache]: Analyzing trace with hash 754624523, now seen corresponding path program 1 times [2025-03-04 10:44:15,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:15,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449313059] [2025-03-04 10:44:15,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:15,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:15,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 10:44:15,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 10:44:15,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:15,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:15,202 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:44:15,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:15,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449313059] [2025-03-04 10:44:15,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449313059] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:44:15,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067694117] [2025-03-04 10:44:15,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:15,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:15,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:15,205 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:44:15,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:44:15,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 10:44:15,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 10:44:15,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:15,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:15,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:44:15,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:44:15,302 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:44:15,303 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:44:15,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067694117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:15,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:44:15,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-04 10:44:15,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273319232] [2025-03-04 10:44:15,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:15,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:44:15,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:15,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:44:15,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:44:15,305 INFO L87 Difference]: Start difference. First operand 104 states and 129 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:44:15,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:15,325 INFO L93 Difference]: Finished difference Result 104 states and 129 transitions. [2025-03-04 10:44:15,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:44:15,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2025-03-04 10:44:15,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:15,328 INFO L225 Difference]: With dead ends: 104 [2025-03-04 10:44:15,328 INFO L226 Difference]: Without dead ends: 103 [2025-03-04 10:44:15,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:44:15,328 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 5 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:15,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 61 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:15,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-04 10:44:15,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-04 10:44:15,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 83 states have (on average 1.216867469879518) internal successors, (101), 89 states have internal predecessors, (101), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 10:44:15,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2025-03-04 10:44:15,339 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 46 [2025-03-04 10:44:15,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:15,339 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2025-03-04 10:44:15,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:44:15,339 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2025-03-04 10:44:15,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 10:44:15,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:15,344 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2025-03-04 10:44:15,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:44:15,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 10:44:15,552 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:44:15,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:15,552 INFO L85 PathProgramCache]: Analyzing trace with hash -812691986, now seen corresponding path program 1 times [2025-03-04 10:44:15,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:15,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290325220] [2025-03-04 10:44:15,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:15,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:15,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 10:44:15,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 10:44:15,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:15,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:15,616 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-04 10:44:15,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:15,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290325220] [2025-03-04 10:44:15,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290325220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:15,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:44:15,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:44:15,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832871695] [2025-03-04 10:44:15,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:15,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:44:15,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:15,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:44:15,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:44:15,620 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:44:15,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:15,635 INFO L93 Difference]: Finished difference Result 103 states and 125 transitions. [2025-03-04 10:44:15,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:44:15,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 69 [2025-03-04 10:44:15,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:15,638 INFO L225 Difference]: With dead ends: 103 [2025-03-04 10:44:15,639 INFO L226 Difference]: Without dead ends: 102 [2025-03-04 10:44:15,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-04 10:44:15,639 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:15,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 63 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:15,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-04 10:44:15,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-04 10:44:15,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 83 states have (on average 1.1927710843373494) internal successors, (99), 88 states have internal predecessors, (99), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 10:44:15,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2025-03-04 10:44:15,651 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 69 [2025-03-04 10:44:15,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:15,651 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2025-03-04 10:44:15,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:44:15,651 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2025-03-04 10:44:15,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 10:44:15,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:15,652 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2025-03-04 10:44:15,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:44:15,654 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:44:15,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:15,655 INFO L85 PathProgramCache]: Analyzing trace with hash 687048588, now seen corresponding path program 2 times [2025-03-04 10:44:15,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:15,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753758269] [2025-03-04 10:44:15,655 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:44:15,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:15,662 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-03-04 10:44:15,664 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 71 statements. [2025-03-04 10:44:15,664 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:44:15,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:15,679 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-04 10:44:15,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:15,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753758269] [2025-03-04 10:44:15,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753758269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:15,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:44:15,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:44:15,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373754910] [2025-03-04 10:44:15,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:15,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:44:15,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:15,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:44:15,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:44:15,680 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:44:15,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:15,710 INFO L93 Difference]: Finished difference Result 106 states and 127 transitions. [2025-03-04 10:44:15,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:44:15,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 71 [2025-03-04 10:44:15,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:15,711 INFO L225 Difference]: With dead ends: 106 [2025-03-04 10:44:15,711 INFO L226 Difference]: Without dead ends: 104 [2025-03-04 10:44:15,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-04 10:44:15,712 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:15,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 61 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:15,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-04 10:44:15,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-04 10:44:15,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 85 states have (on average 1.188235294117647) internal successors, (101), 90 states have internal predecessors, (101), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 10:44:15,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 125 transitions. [2025-03-04 10:44:15,718 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 125 transitions. Word has length 71 [2025-03-04 10:44:15,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:15,718 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 125 transitions. [2025-03-04 10:44:15,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:44:15,718 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 125 transitions. [2025-03-04 10:44:15,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 10:44:15,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:15,719 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:15,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:44:15,719 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:44:15,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:15,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1880853243, now seen corresponding path program 1 times [2025-03-04 10:44:15,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:15,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964937102] [2025-03-04 10:44:15,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:15,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:15,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 10:44:15,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 10:44:15,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:15,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:15,758 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-04 10:44:15,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:15,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964937102] [2025-03-04 10:44:15,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964937102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:15,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:44:15,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:44:15,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072037478] [2025-03-04 10:44:15,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:15,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:44:15,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:15,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:44:15,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:44:15,761 INFO L87 Difference]: Start difference. First operand 104 states and 125 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:44:15,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:15,805 INFO L93 Difference]: Finished difference Result 104 states and 125 transitions. [2025-03-04 10:44:15,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:44:15,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 77 [2025-03-04 10:44:15,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:15,806 INFO L225 Difference]: With dead ends: 104 [2025-03-04 10:44:15,807 INFO L226 Difference]: Without dead ends: 102 [2025-03-04 10:44:15,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-04 10:44:15,807 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 9 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:15,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 27 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:15,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-04 10:44:15,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-04 10:44:15,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 85 states have (on average 1.1176470588235294) internal successors, (95), 88 states have internal predecessors, (95), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 10:44:15,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 119 transitions. [2025-03-04 10:44:15,821 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 119 transitions. Word has length 77 [2025-03-04 10:44:15,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:15,822 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 119 transitions. [2025-03-04 10:44:15,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:44:15,823 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 119 transitions. [2025-03-04 10:44:15,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-04 10:44:15,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:15,823 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:15,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:44:15,823 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:44:15,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:15,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1823091604, now seen corresponding path program 1 times [2025-03-04 10:44:15,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:15,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604741546] [2025-03-04 10:44:15,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:15,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:15,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 10:44:15,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 10:44:15,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:15,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:15,967 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 17 proven. 45 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:44:15,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:15,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604741546] [2025-03-04 10:44:15,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604741546] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:44:15,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361312571] [2025-03-04 10:44:15,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:15,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:15,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:15,970 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:44:15,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:44:15,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 10:44:16,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 10:44:16,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:16,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:16,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:44:16,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:44:16,094 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 17 proven. 45 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:44:16,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:44:16,222 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 17 proven. 45 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:44:16,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361312571] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:44:16,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:44:16,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-04 10:44:16,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503807638] [2025-03-04 10:44:16,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:44:16,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:44:16,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:16,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:44:16,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:44:16,224 INFO L87 Difference]: Start difference. First operand 102 states and 119 transitions. Second operand has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-04 10:44:16,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:16,292 INFO L93 Difference]: Finished difference Result 282 states and 329 transitions. [2025-03-04 10:44:16,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:44:16,292 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 78 [2025-03-04 10:44:16,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:16,294 INFO L225 Difference]: With dead ends: 282 [2025-03-04 10:44:16,294 INFO L226 Difference]: Without dead ends: 226 [2025-03-04 10:44:16,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:44:16,294 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 54 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:16,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 201 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:16,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-04 10:44:16,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 214. [2025-03-04 10:44:16,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 181 states have (on average 1.0994475138121547) internal successors, (199), 184 states have internal predecessors, (199), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 10:44:16,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 255 transitions. [2025-03-04 10:44:16,312 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 255 transitions. Word has length 78 [2025-03-04 10:44:16,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:16,313 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 255 transitions. [2025-03-04 10:44:16,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-04 10:44:16,313 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 255 transitions. [2025-03-04 10:44:16,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-04 10:44:16,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:16,314 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:16,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:44:16,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:16,515 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:44:16,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:16,515 INFO L85 PathProgramCache]: Analyzing trace with hash -30760744, now seen corresponding path program 2 times [2025-03-04 10:44:16,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:16,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513822895] [2025-03-04 10:44:16,515 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:44:16,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:16,523 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 166 statements into 2 equivalence classes. [2025-03-04 10:44:16,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 166 of 166 statements. [2025-03-04 10:44:16,529 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:44:16,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:16,658 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 665 trivial. 0 not checked. [2025-03-04 10:44:16,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:16,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513822895] [2025-03-04 10:44:16,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513822895] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:44:16,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582489234] [2025-03-04 10:44:16,659 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:44:16,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:16,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:16,661 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:44:16,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:44:16,690 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 166 statements into 2 equivalence classes. [2025-03-04 10:44:16,720 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 166 of 166 statements. [2025-03-04 10:44:16,720 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:44:16,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:16,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:44:16,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:44:16,963 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 37 proven. 301 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 10:44:16,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:44:17,229 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 37 proven. 301 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 10:44:17,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582489234] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:44:17,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:44:17,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 17, 17] total 20 [2025-03-04 10:44:17,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27550851] [2025-03-04 10:44:17,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:44:17,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 10:44:17,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:17,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 10:44:17,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:44:17,233 INFO L87 Difference]: Start difference. First operand 214 states and 255 transitions. Second operand has 20 states, 20 states have (on average 6.1) internal successors, (122), 20 states have internal predecessors, (122), 8 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2025-03-04 10:44:17,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:17,894 INFO L93 Difference]: Finished difference Result 482 states and 577 transitions. [2025-03-04 10:44:17,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-03-04 10:44:17,895 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.1) internal successors, (122), 20 states have internal predecessors, (122), 8 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) Word has length 166 [2025-03-04 10:44:17,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:17,897 INFO L225 Difference]: With dead ends: 482 [2025-03-04 10:44:17,897 INFO L226 Difference]: Without dead ends: 370 [2025-03-04 10:44:17,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 301 SyntacticMatches, 15 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=402, Invalid=2048, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 10:44:17,900 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 127 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:17,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 127 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:44:17,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-04 10:44:17,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 356. [2025-03-04 10:44:17,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 303 states have (on average 1.0693069306930694) internal successors, (324), 306 states have internal predecessors, (324), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-04 10:44:17,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 420 transitions. [2025-03-04 10:44:17,926 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 420 transitions. Word has length 166 [2025-03-04 10:44:17,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:17,926 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 420 transitions. [2025-03-04 10:44:17,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.1) internal successors, (122), 20 states have internal predecessors, (122), 8 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2025-03-04 10:44:17,926 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 420 transitions. [2025-03-04 10:44:17,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-03-04 10:44:17,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:17,933 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:44:17,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:44:18,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:18,134 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:44:18,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:18,134 INFO L85 PathProgramCache]: Analyzing trace with hash -2123633910, now seen corresponding path program 1 times [2025-03-04 10:44:18,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:18,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922000779] [2025-03-04 10:44:18,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:18,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:18,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-03-04 10:44:18,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-03-04 10:44:18,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:18,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:18,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3699 backedges. 0 proven. 915 refuted. 0 times theorem prover too weak. 2784 trivial. 0 not checked. [2025-03-04 10:44:18,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:18,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922000779] [2025-03-04 10:44:18,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922000779] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:44:18,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199900241] [2025-03-04 10:44:18,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:18,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:18,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:18,339 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:44:18,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:44:18,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-03-04 10:44:18,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-03-04 10:44:18,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:18,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:18,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:44:18,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:44:18,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3699 backedges. 915 proven. 0 refuted. 0 times theorem prover too weak. 2784 trivial. 0 not checked. [2025-03-04 10:44:18,668 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:44:18,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199900241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:18,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:44:18,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 10:44:18,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469096131] [2025-03-04 10:44:18,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:18,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:44:18,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:18,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:44:18,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:44:18,670 INFO L87 Difference]: Start difference. First operand 356 states and 420 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:44:18,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:18,718 INFO L93 Difference]: Finished difference Result 356 states and 420 transitions. [2025-03-04 10:44:18,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:44:18,719 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 361 [2025-03-04 10:44:18,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:18,720 INFO L225 Difference]: With dead ends: 356 [2025-03-04 10:44:18,721 INFO L226 Difference]: Without dead ends: 355 [2025-03-04 10:44:18,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:44:18,721 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:18,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 109 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:18,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-04 10:44:18,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2025-03-04 10:44:18,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 303 states have (on average 1.066006600660066) internal successors, (323), 305 states have internal predecessors, (323), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-04 10:44:18,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 419 transitions. [2025-03-04 10:44:18,738 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 419 transitions. Word has length 361 [2025-03-04 10:44:18,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:18,739 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 419 transitions. [2025-03-04 10:44:18,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:44:18,739 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 419 transitions. [2025-03-04 10:44:18,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-03-04 10:44:18,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:18,742 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 2, 2, 2, 1, 1, 1, 1] [2025-03-04 10:44:18,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:44:18,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 10:44:18,943 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:44:18,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:18,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1408141797, now seen corresponding path program 1 times [2025-03-04 10:44:18,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:18,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622808463] [2025-03-04 10:44:18,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:18,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:18,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-03-04 10:44:18,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-03-04 10:44:18,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:18,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:19,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3700 backedges. 0 proven. 916 refuted. 0 times theorem prover too weak. 2784 trivial. 0 not checked. [2025-03-04 10:44:19,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:19,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622808463] [2025-03-04 10:44:19,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622808463] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:44:19,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974474157] [2025-03-04 10:44:19,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:19,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:19,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:19,147 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:44:19,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:44:19,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-03-04 10:44:19,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-03-04 10:44:19,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:19,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:19,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:44:19,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:44:19,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3700 backedges. 0 proven. 916 refuted. 0 times theorem prover too weak. 2784 trivial. 0 not checked. [2025-03-04 10:44:19,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:44:19,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3700 backedges. 0 proven. 916 refuted. 0 times theorem prover too weak. 2784 trivial. 0 not checked. [2025-03-04 10:44:19,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974474157] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:44:19,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:44:19,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 10:44:19,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395016400] [2025-03-04 10:44:19,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:44:19,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:44:19,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:19,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:44:19,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:44:19,764 INFO L87 Difference]: Start difference. First operand 355 states and 419 transitions. Second operand has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 12 states have internal predecessors, (87), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-04 10:44:19,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:19,831 INFO L93 Difference]: Finished difference Result 590 states and 722 transitions. [2025-03-04 10:44:19,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:44:19,831 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 12 states have internal predecessors, (87), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 362 [2025-03-04 10:44:19,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:19,834 INFO L225 Difference]: With dead ends: 590 [2025-03-04 10:44:19,834 INFO L226 Difference]: Without dead ends: 589 [2025-03-04 10:44:19,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 717 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:44:19,834 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:19,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:19,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-03-04 10:44:19,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2025-03-04 10:44:19,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 505 states have (on average 1.106930693069307) internal successors, (559), 507 states have internal predecessors, (559), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-04 10:44:19,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 719 transitions. [2025-03-04 10:44:19,869 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 719 transitions. Word has length 362 [2025-03-04 10:44:19,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:19,870 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 719 transitions. [2025-03-04 10:44:19,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 12 states have internal predecessors, (87), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-04 10:44:19,870 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 719 transitions. [2025-03-04 10:44:19,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-03-04 10:44:19,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:19,873 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 3, 2, 2, 2, 1, 1, 1] [2025-03-04 10:44:19,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:44:20,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:20,074 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:44:20,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:20,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1382055510, now seen corresponding path program 3 times [2025-03-04 10:44:20,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:20,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328378909] [2025-03-04 10:44:20,075 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:44:20,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:20,083 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 368 statements into 23 equivalence classes. [2025-03-04 10:44:20,086 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 368 statements. [2025-03-04 10:44:20,086 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 10:44:20,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:20,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 3546 trivial. 0 not checked. [2025-03-04 10:44:20,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:20,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328378909] [2025-03-04 10:44:20,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328378909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:20,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:44:20,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:44:20,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432229834] [2025-03-04 10:44:20,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:20,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:44:20,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:20,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:44:20,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:44:20,114 INFO L87 Difference]: Start difference. First operand 589 states and 719 transitions. Second operand has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:44:20,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:20,161 INFO L93 Difference]: Finished difference Result 589 states and 719 transitions. [2025-03-04 10:44:20,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:44:20,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 368 [2025-03-04 10:44:20,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:20,165 INFO L225 Difference]: With dead ends: 589 [2025-03-04 10:44:20,165 INFO L226 Difference]: Without dead ends: 587 [2025-03-04 10:44:20,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:44:20,165 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 8 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:20,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 29 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:20,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-03-04 10:44:20,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2025-03-04 10:44:20,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 505 states have (on average 1.011881188118812) internal successors, (511), 505 states have internal predecessors, (511), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-04 10:44:20,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 671 transitions. [2025-03-04 10:44:20,199 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 671 transitions. Word has length 368 [2025-03-04 10:44:20,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:20,199 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 671 transitions. [2025-03-04 10:44:20,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:44:20,200 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 671 transitions. [2025-03-04 10:44:20,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 903 [2025-03-04 10:44:20,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:20,216 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 5, 5, 5, 4, 1, 1, 1] [2025-03-04 10:44:20,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:44:20,216 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:44:20,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:20,217 INFO L85 PathProgramCache]: Analyzing trace with hash -650629758, now seen corresponding path program 2 times [2025-03-04 10:44:20,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:20,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473350280] [2025-03-04 10:44:20,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:44:20,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:20,248 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 902 statements into 2 equivalence classes. [2025-03-04 10:44:20,250 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 902 statements. [2025-03-04 10:44:20,250 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:44:20,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:20,276 INFO L134 CoverageAnalysis]: Checked inductivity of 23800 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 20140 trivial. 0 not checked. [2025-03-04 10:44:20,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:20,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473350280] [2025-03-04 10:44:20,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473350280] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:44:20,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43530335] [2025-03-04 10:44:20,277 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:44:20,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:20,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:20,283 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:44:20,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:44:20,346 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 902 statements into 2 equivalence classes. [2025-03-04 10:44:20,349 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 902 statements. [2025-03-04 10:44:20,349 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:44:20,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:20,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:44:20,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:44:20,981 INFO L134 CoverageAnalysis]: Checked inductivity of 23800 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 20140 trivial. 0 not checked. [2025-03-04 10:44:20,982 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:44:21,745 INFO L134 CoverageAnalysis]: Checked inductivity of 23800 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 20140 trivial. 0 not checked. [2025-03-04 10:44:21,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43530335] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:44:21,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:44:21,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-03-04 10:44:21,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507455376] [2025-03-04 10:44:21,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:44:21,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:44:21,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:21,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:44:21,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:44:21,747 INFO L87 Difference]: Start difference. First operand 587 states and 671 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:44:21,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:21,788 INFO L93 Difference]: Finished difference Result 587 states and 671 transitions. [2025-03-04 10:44:21,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:44:21,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 902 [2025-03-04 10:44:21,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:21,791 INFO L225 Difference]: With dead ends: 587 [2025-03-04 10:44:21,791 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 10:44:21,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1808 GetRequests, 1801 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:44:21,792 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:21,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:21,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 10:44:21,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 10:44:21,793 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-04 10:44:21,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 10:44:21,793 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 902 [2025-03-04 10:44:21,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:21,793 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 10:44:21,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:44:21,793 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 10:44:21,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 10:44:21,796 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2025-03-04 10:44:21,796 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2025-03-04 10:44:21,796 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2025-03-04 10:44:21,796 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2025-03-04 10:44:21,796 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2025-03-04 10:44:21,796 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2025-03-04 10:44:21,796 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2025-03-04 10:44:21,796 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2025-03-04 10:44:21,796 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2025-03-04 10:44:21,796 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2025-03-04 10:44:21,796 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2025-03-04 10:44:21,796 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2025-03-04 10:44:21,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 10:44:21,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:22,001 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:22,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 10:44:22,802 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:44:22,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:44:22 BoogieIcfgContainer [2025-03-04 10:44:22,813 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:44:22,814 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:44:22,814 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:44:22,814 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:44:22,815 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:44:13" (3/4) ... [2025-03-04 10:44:22,816 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 10:44:22,821 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-04 10:44:22,827 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-04 10:44:22,827 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 10:44:22,827 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 10:44:22,827 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 10:44:22,890 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:44:22,890 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:44:22,890 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:44:22,891 INFO L158 Benchmark]: Toolchain (without parser) took 9489.36ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 122.7MB in the beginning and 247.8MB in the end (delta: -125.2MB). Peak memory consumption was 67.7MB. Max. memory is 16.1GB. [2025-03-04 10:44:22,891 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:44:22,891 INFO L158 Benchmark]: CACSL2BoogieTranslator took 164.29ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 111.9MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:44:22,891 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.15ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 110.9MB in the end (delta: 997.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:44:22,891 INFO L158 Benchmark]: Boogie Preprocessor took 22.79ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 109.9MB in the end (delta: 995.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:44:22,891 INFO L158 Benchmark]: IcfgBuilder took 236.83ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 98.4MB in the end (delta: 11.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 10:44:22,891 INFO L158 Benchmark]: TraceAbstraction took 8962.22ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 97.4MB in the beginning and 252.0MB in the end (delta: -154.6MB). Peak memory consumption was 171.6MB. Max. memory is 16.1GB. [2025-03-04 10:44:22,892 INFO L158 Benchmark]: Witness Printer took 76.34ms. Allocated memory is still 360.7MB. Free memory was 252.0MB in the beginning and 247.8MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:44:22,894 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 164.29ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 111.9MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.15ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 110.9MB in the end (delta: 997.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.79ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 109.9MB in the end (delta: 995.0kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 236.83ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 98.4MB in the end (delta: 11.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8962.22ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 97.4MB in the beginning and 252.0MB in the end (delta: -154.6MB). Peak memory consumption was 171.6MB. Max. memory is 16.1GB. * Witness Printer took 76.34ms. Allocated memory is still 360.7MB. Free memory was 252.0MB in the beginning and 247.8MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. 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: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: 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 2 procedures, 41 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 16, TraceHistogramMax: 80, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 360 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 338 mSDsluCounter, 1249 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 881 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 919 IncrementalHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 368 mSDtfsCounter, 919 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3560 GetRequests, 3427 SyntacticMatches, 17 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=589occurred in iteration=14, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 63 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 4517 NumberOfCodeBlocks, 2316 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 6024 ConstructedInterpolants, 0 QuantifiedInterpolants, 13592 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1718 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 28 InterpolantComputations, 11 PerfectInterpolantSequences, 81140/96573 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 12 specifications checked. All of them hold - InvariantResult [Line: 27]: Location Invariant Derived location invariant: (((i == 0) && (nlen <= 2147483647)) || (((1 <= nlen) && (1 <= i)) && (nlen <= 2147483647))) - InvariantResult [Line: 28]: Location Invariant Derived location invariant: (((((0 <= (j + 2147483648)) && (1 <= nlen)) && (i == 0)) && (nlen <= 2147483647)) || ((((0 <= (j + 2147483648)) && (1 <= i)) && (nlen <= 2147483647)) && (((long long) i + 1) <= nlen))) RESULT: Ultimate proved your program to be correct! [2025-03-04 10:44:22,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE