./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_multiply_09_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/Juliet_Test/CWE191_Integer_Underflow__int_rand_multiply_09_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash fc72386314414fabf94e6d82d60679ab07d15db5567c5294668f3d10b3b3054f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 14:35:27,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 14:35:27,133 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 14:35:27,138 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 14:35:27,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 14:35:27,155 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 14:35:27,156 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 14:35:27,156 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 14:35:27,157 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 14:35:27,157 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 14:35:27,157 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 14:35:27,157 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 14:35:27,157 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 14:35:27,158 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 14:35:27,158 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 14:35:27,158 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 14:35:27,158 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 14:35:27,158 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 14:35:27,158 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 14:35:27,158 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 14:35:27,158 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 14:35:27,158 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 14:35:27,158 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 14:35:27,159 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 14:35:27,159 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 14:35:27,159 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 14:35:27,159 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 14:35:27,159 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 14:35:27,159 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 14:35:27,159 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 14:35:27,159 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 14:35:27,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:35:27,159 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 14:35:27,159 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 14:35:27,159 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 14:35:27,159 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 14:35:27,159 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 14:35:27,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 14:35:27,159 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 14:35:27,159 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 14:35:27,159 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 14:35:27,159 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 14:35:27,159 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fc72386314414fabf94e6d82d60679ab07d15db5567c5294668f3d10b3b3054f [2025-03-04 14:35:27,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:35:27,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:35:27,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:35:27,421 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:35:27,421 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:35:27,422 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_multiply_09_good.i [2025-03-04 14:35:28,581 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d24a90765/bacf270d73e447059c2ee76c59228f3a/FLAGa6e92563b [2025-03-04 14:35:28,971 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:35:28,971 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_multiply_09_good.i [2025-03-04 14:35:28,991 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d24a90765/bacf270d73e447059c2ee76c59228f3a/FLAGa6e92563b [2025-03-04 14:35:29,007 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d24a90765/bacf270d73e447059c2ee76c59228f3a [2025-03-04 14:35:29,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:35:29,011 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:35:29,011 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:35:29,011 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:35:29,015 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:35:29,016 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:35:29" (1/1) ... [2025-03-04 14:35:29,018 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca7ca20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:35:29, skipping insertion in model container [2025-03-04 14:35:29,018 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:35:29" (1/1) ... [2025-03-04 14:35:29,055 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:35:29,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:35:29,537 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:35:29,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:35:29,687 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:35:29,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:35:29 WrapperNode [2025-03-04 14:35:29,688 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:35:29,689 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:35:29,689 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:35:29,689 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:35:29,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:35:29" (1/1) ... [2025-03-04 14:35:29,715 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:35:29" (1/1) ... [2025-03-04 14:35:29,732 INFO L138 Inliner]: procedures = 501, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 197 [2025-03-04 14:35:29,733 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:35:29,733 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:35:29,733 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:35:29,733 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:35:29,741 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:35:29" (1/1) ... [2025-03-04 14:35:29,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:35:29" (1/1) ... [2025-03-04 14:35:29,743 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:35:29" (1/1) ... [2025-03-04 14:35:29,752 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 14:35:29,753 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:35:29" (1/1) ... [2025-03-04 14:35:29,753 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:35:29" (1/1) ... [2025-03-04 14:35:29,758 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:35:29" (1/1) ... [2025-03-04 14:35:29,759 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:35:29" (1/1) ... [2025-03-04 14:35:29,760 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:35:29" (1/1) ... [2025-03-04 14:35:29,761 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:35:29" (1/1) ... [2025-03-04 14:35:29,764 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:35:29,767 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:35:29,767 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:35:29,767 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:35:29,768 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:35:29" (1/1) ... [2025-03-04 14:35:29,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:35:29,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:35:29,794 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 14:35:29,797 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 14:35:29,814 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-04 14:35:29,815 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-04 14:35:29,815 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-04 14:35:29,815 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-04 14:35:29,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:35:29,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:35:29,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:35:29,928 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:35:29,929 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:35:30,176 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2025-03-04 14:35:30,177 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:35:30,196 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:35:30,196 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 14:35:30,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:35:30 BoogieIcfgContainer [2025-03-04 14:35:30,197 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:35:30,199 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:35:30,199 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:35:30,202 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:35:30,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:35:29" (1/3) ... [2025-03-04 14:35:30,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dc3e40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:35:30, skipping insertion in model container [2025-03-04 14:35:30,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:35:29" (2/3) ... [2025-03-04 14:35:30,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dc3e40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:35:30, skipping insertion in model container [2025-03-04 14:35:30,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:35:30" (3/3) ... [2025-03-04 14:35:30,203 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_multiply_09_good.i [2025-03-04 14:35:30,213 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:35:30,217 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_rand_multiply_09_good.i that has 3 procedures, 107 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-03-04 14:35:30,260 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:35:30,268 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;@2cfc3cf8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:35:30,268 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 14:35:30,271 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 86 states have (on average 1.569767441860465) internal successors, (135), 98 states have internal predecessors, (135), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 14:35:30,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 14:35:30,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:35:30,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:35:30,276 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:35:30,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:35:30,280 INFO L85 PathProgramCache]: Analyzing trace with hash -109010770, now seen corresponding path program 1 times [2025-03-04 14:35:30,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:35:30,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181481517] [2025-03-04 14:35:30,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:35:30,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:35:30,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 14:35:30,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 14:35:30,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:35:30,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:35:30,471 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 14:35:30,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:35:30,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181481517] [2025-03-04 14:35:30,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181481517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:35:30,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:35:30,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:35:30,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848275807] [2025-03-04 14:35:30,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:35:30,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:35:30,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:35:30,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:35:30,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:35:30,489 INFO L87 Difference]: Start difference. First operand has 107 states, 86 states have (on average 1.569767441860465) internal successors, (135), 98 states have internal predecessors, (135), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:35:30,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:35:30,534 INFO L93 Difference]: Finished difference Result 187 states and 268 transitions. [2025-03-04 14:35:30,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:35:30,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-03-04 14:35:30,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:35:30,541 INFO L225 Difference]: With dead ends: 187 [2025-03-04 14:35:30,542 INFO L226 Difference]: Without dead ends: 98 [2025-03-04 14:35:30,546 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 14:35:30,549 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 145 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:35:30,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 135 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:35:30,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-04 14:35:30,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-04 14:35:30,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 80 states have (on average 1.5125) internal successors, (121), 91 states have internal predecessors, (121), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 14:35:30,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 137 transitions. [2025-03-04 14:35:30,591 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 137 transitions. Word has length 13 [2025-03-04 14:35:30,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:35:30,593 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 137 transitions. [2025-03-04 14:35:30,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:35:30,593 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 137 transitions. [2025-03-04 14:35:30,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 14:35:30,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:35:30,595 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:35:30,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 14:35:30,595 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:35:30,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:35:30,597 INFO L85 PathProgramCache]: Analyzing trace with hash 416642793, now seen corresponding path program 1 times [2025-03-04 14:35:30,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:35:30,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830000406] [2025-03-04 14:35:30,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:35:30,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:35:30,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 14:35:30,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 14:35:30,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:35:30,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:35:30,674 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 14:35:30,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:35:30,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830000406] [2025-03-04 14:35:30,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830000406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:35:30,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:35:30,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:35:30,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913499292] [2025-03-04 14:35:30,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:35:30,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:35:30,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:35:30,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:35:30,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:35:30,676 INFO L87 Difference]: Start difference. First operand 98 states and 137 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:35:30,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:35:30,718 INFO L93 Difference]: Finished difference Result 98 states and 137 transitions. [2025-03-04 14:35:30,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:35:30,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-03-04 14:35:30,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:35:30,719 INFO L225 Difference]: With dead ends: 98 [2025-03-04 14:35:30,719 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 14:35:30,719 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 14:35:30,720 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 36 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:35:30,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 212 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:35:30,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 14:35:30,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-04 14:35:30,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.5) internal successors, (120), 90 states have internal predecessors, (120), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 14:35:30,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 136 transitions. [2025-03-04 14:35:30,733 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 136 transitions. Word has length 19 [2025-03-04 14:35:30,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:35:30,733 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 136 transitions. [2025-03-04 14:35:30,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:35:30,733 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 136 transitions. [2025-03-04 14:35:30,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 14:35:30,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:35:30,734 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:35:30,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 14:35:30,734 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:35:30,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:35:30,735 INFO L85 PathProgramCache]: Analyzing trace with hash 31024762, now seen corresponding path program 1 times [2025-03-04 14:35:30,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:35:30,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695053287] [2025-03-04 14:35:30,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:35:30,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:35:30,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 14:35:30,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 14:35:30,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:35:30,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:35:30,820 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 14:35:30,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:35:30,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695053287] [2025-03-04 14:35:30,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695053287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:35:30,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:35:30,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:35:30,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109047810] [2025-03-04 14:35:30,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:35:30,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:35:30,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:35:30,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:35:30,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:35:30,822 INFO L87 Difference]: Start difference. First operand 97 states and 136 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:35:30,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:35:30,858 INFO L93 Difference]: Finished difference Result 97 states and 136 transitions. [2025-03-04 14:35:30,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:35:30,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-03-04 14:35:30,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:35:30,859 INFO L225 Difference]: With dead ends: 97 [2025-03-04 14:35:30,859 INFO L226 Difference]: Without dead ends: 96 [2025-03-04 14:35:30,860 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 14:35:30,860 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:35:30,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 241 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:35:30,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-04 14:35:30,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-04 14:35:30,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.4875) internal successors, (119), 89 states have internal predecessors, (119), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 14:35:30,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions. [2025-03-04 14:35:30,869 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 20 [2025-03-04 14:35:30,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:35:30,869 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 135 transitions. [2025-03-04 14:35:30,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:35:30,869 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions. [2025-03-04 14:35:30,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 14:35:30,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:35:30,870 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:35:30,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 14:35:30,870 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:35:30,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:35:30,871 INFO L85 PathProgramCache]: Analyzing trace with hash 437172021, now seen corresponding path program 1 times [2025-03-04 14:35:30,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:35:30,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567895994] [2025-03-04 14:35:30,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:35:30,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:35:30,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 14:35:30,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 14:35:30,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:35:30,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:35:30,951 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 14:35:30,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:35:30,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567895994] [2025-03-04 14:35:30,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567895994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:35:30,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:35:30,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:35:30,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492199239] [2025-03-04 14:35:30,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:35:30,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:35:30,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:35:30,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:35:30,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:35:30,955 INFO L87 Difference]: Start difference. First operand 96 states and 135 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:35:30,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:35:30,990 INFO L93 Difference]: Finished difference Result 96 states and 135 transitions. [2025-03-04 14:35:30,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:35:30,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-03-04 14:35:30,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:35:30,992 INFO L225 Difference]: With dead ends: 96 [2025-03-04 14:35:30,992 INFO L226 Difference]: Without dead ends: 95 [2025-03-04 14:35:30,992 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 14:35:30,994 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 36 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:35:30,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 208 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:35:30,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-04 14:35:31,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-04 14:35:31,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 80 states have (on average 1.475) internal successors, (118), 88 states have internal predecessors, (118), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 14:35:31,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 134 transitions. [2025-03-04 14:35:31,003 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 134 transitions. Word has length 29 [2025-03-04 14:35:31,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:35:31,004 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 134 transitions. [2025-03-04 14:35:31,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:35:31,004 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 134 transitions. [2025-03-04 14:35:31,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 14:35:31,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:35:31,005 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:35:31,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 14:35:31,005 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:35:31,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:35:31,005 INFO L85 PathProgramCache]: Analyzing trace with hash 667430774, now seen corresponding path program 1 times [2025-03-04 14:35:31,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:35:31,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631942613] [2025-03-04 14:35:31,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:35:31,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:35:31,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:35:31,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:35:31,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:35:31,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:35:31,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:35:31,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:35:31,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631942613] [2025-03-04 14:35:31,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631942613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:35:31,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:35:31,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:35:31,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866173690] [2025-03-04 14:35:31,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:35:31,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:35:31,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:35:31,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:35:31,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:35:31,088 INFO L87 Difference]: Start difference. First operand 95 states and 134 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:35:31,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:35:31,118 INFO L93 Difference]: Finished difference Result 95 states and 134 transitions. [2025-03-04 14:35:31,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:35:31,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-03-04 14:35:31,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:35:31,121 INFO L225 Difference]: With dead ends: 95 [2025-03-04 14:35:31,122 INFO L226 Difference]: Without dead ends: 94 [2025-03-04 14:35:31,122 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 14:35:31,122 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:35:31,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 237 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:35:31,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-04 14:35:31,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-04 14:35:31,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 80 states have (on average 1.4625) internal successors, (117), 87 states have internal predecessors, (117), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 14:35:31,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 133 transitions. [2025-03-04 14:35:31,133 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 133 transitions. Word has length 30 [2025-03-04 14:35:31,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:35:31,134 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 133 transitions. [2025-03-04 14:35:31,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:35:31,134 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 133 transitions. [2025-03-04 14:35:31,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 14:35:31,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:35:31,135 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:35:31,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 14:35:31,135 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:35:31,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:35:31,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1471871498, now seen corresponding path program 1 times [2025-03-04 14:35:31,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:35:31,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169102840] [2025-03-04 14:35:31,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:35:31,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:35:31,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 14:35:31,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 14:35:31,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:35:31,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:35:31,199 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 14:35:31,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:35:31,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169102840] [2025-03-04 14:35:31,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169102840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:35:31,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:35:31,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:35:31,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808818119] [2025-03-04 14:35:31,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:35:31,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:35:31,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:35:31,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:35:31,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:35:31,201 INFO L87 Difference]: Start difference. First operand 94 states and 133 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:35:31,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:35:31,231 INFO L93 Difference]: Finished difference Result 94 states and 133 transitions. [2025-03-04 14:35:31,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:35:31,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2025-03-04 14:35:31,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:35:31,233 INFO L225 Difference]: With dead ends: 94 [2025-03-04 14:35:31,233 INFO L226 Difference]: Without dead ends: 93 [2025-03-04 14:35:31,234 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 14:35:31,234 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 2 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 232 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 14:35:31,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 232 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:35:31,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-04 14:35:31,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-04 14:35:31,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.45) internal successors, (116), 86 states have internal predecessors, (116), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 14:35:31,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 132 transitions. [2025-03-04 14:35:31,241 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 132 transitions. Word has length 32 [2025-03-04 14:35:31,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:35:31,241 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 132 transitions. [2025-03-04 14:35:31,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:35:31,242 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 132 transitions. [2025-03-04 14:35:31,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 14:35:31,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:35:31,243 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:35:31,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 14:35:31,244 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:35:31,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:35:31,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1616623821, now seen corresponding path program 1 times [2025-03-04 14:35:31,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:35:31,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017996409] [2025-03-04 14:35:31,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:35:31,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:35:31,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 14:35:31,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 14:35:31,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:35:31,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:35:31,295 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 14:35:31,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:35:31,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017996409] [2025-03-04 14:35:31,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017996409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:35:31,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:35:31,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:35:31,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075521591] [2025-03-04 14:35:31,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:35:31,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:35:31,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:35:31,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:35:31,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:35:31,297 INFO L87 Difference]: Start difference. First operand 93 states and 132 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:35:31,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:35:31,326 INFO L93 Difference]: Finished difference Result 106 states and 145 transitions. [2025-03-04 14:35:31,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:35:31,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2025-03-04 14:35:31,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:35:31,327 INFO L225 Difference]: With dead ends: 106 [2025-03-04 14:35:31,327 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 14:35:31,327 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 14:35:31,328 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 237 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 14:35:31,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 237 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:35:31,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 14:35:31,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-04 14:35:31,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 84 states have (on average 1.4285714285714286) internal successors, (120), 89 states have internal predecessors, (120), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 14:35:31,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 136 transitions. [2025-03-04 14:35:31,340 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 136 transitions. Word has length 33 [2025-03-04 14:35:31,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:35:31,340 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 136 transitions. [2025-03-04 14:35:31,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:35:31,341 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 136 transitions. [2025-03-04 14:35:31,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 14:35:31,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:35:31,341 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:35:31,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 14:35:31,342 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:35:31,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:35:31,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1545596798, now seen corresponding path program 1 times [2025-03-04 14:35:31,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:35:31,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021751809] [2025-03-04 14:35:31,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:35:31,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:35:31,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 14:35:31,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 14:35:31,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:35:31,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:35:31,377 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 14:35:31,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:35:31,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021751809] [2025-03-04 14:35:31,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021751809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:35:31,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:35:31,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:35:31,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075112081] [2025-03-04 14:35:31,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:35:31,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:35:31,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:35:31,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:35:31,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:35:31,379 INFO L87 Difference]: Start difference. First operand 97 states and 136 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 14:35:31,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:35:31,394 INFO L93 Difference]: Finished difference Result 152 states and 208 transitions. [2025-03-04 14:35:31,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:35:31,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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) Word has length 38 [2025-03-04 14:35:31,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:35:31,396 INFO L225 Difference]: With dead ends: 152 [2025-03-04 14:35:31,396 INFO L226 Difference]: Without dead ends: 90 [2025-03-04 14:35:31,396 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 14:35:31,396 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 100 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:35:31,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 114 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:35:31,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-04 14:35:31,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-04 14:35:31,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 80 states have (on average 1.4) internal successors, (112), 83 states have internal predecessors, (112), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:35:31,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 124 transitions. [2025-03-04 14:35:31,401 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 124 transitions. Word has length 38 [2025-03-04 14:35:31,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:35:31,401 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 124 transitions. [2025-03-04 14:35:31,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 14:35:31,401 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 124 transitions. [2025-03-04 14:35:31,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 14:35:31,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:35:31,404 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:35:31,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 14:35:31,404 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:35:31,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:35:31,405 INFO L85 PathProgramCache]: Analyzing trace with hash 162682030, now seen corresponding path program 1 times [2025-03-04 14:35:31,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:35:31,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742072027] [2025-03-04 14:35:31,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:35:31,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:35:31,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 14:35:31,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 14:35:31,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:35:31,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:35:31,450 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 14:35:31,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:35:31,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742072027] [2025-03-04 14:35:31,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742072027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:35:31,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:35:31,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:35:31,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725204984] [2025-03-04 14:35:31,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:35:31,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:35:31,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:35:31,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:35:31,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:35:31,453 INFO L87 Difference]: Start difference. First operand 90 states and 124 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 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 14:35:31,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:35:31,475 INFO L93 Difference]: Finished difference Result 90 states and 124 transitions. [2025-03-04 14:35:31,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:35:31,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 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 43 [2025-03-04 14:35:31,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:35:31,477 INFO L225 Difference]: With dead ends: 90 [2025-03-04 14:35:31,478 INFO L226 Difference]: Without dead ends: 89 [2025-03-04 14:35:31,478 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 14:35:31,478 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:35:31,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 221 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:35:31,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-04 14:35:31,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-04 14:35:31,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 80 states have (on average 1.3875) internal successors, (111), 82 states have internal predecessors, (111), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:35:31,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 123 transitions. [2025-03-04 14:35:31,486 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 123 transitions. Word has length 43 [2025-03-04 14:35:31,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:35:31,487 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 123 transitions. [2025-03-04 14:35:31,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 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 14:35:31,487 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 123 transitions. [2025-03-04 14:35:31,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 14:35:31,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:35:31,488 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:35:31,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 14:35:31,488 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:35:31,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:35:31,489 INFO L85 PathProgramCache]: Analyzing trace with hash 748175618, now seen corresponding path program 1 times [2025-03-04 14:35:31,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:35:31,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75736411] [2025-03-04 14:35:31,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:35:31,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:35:31,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 14:35:31,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 14:35:31,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:35:31,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:35:31,531 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 14:35:31,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:35:31,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75736411] [2025-03-04 14:35:31,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75736411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:35:31,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:35:31,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:35:31,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046519378] [2025-03-04 14:35:31,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:35:31,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:35:31,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:35:31,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:35:31,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:35:31,532 INFO L87 Difference]: Start difference. First operand 89 states and 123 transitions. Second operand has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 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 14:35:31,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:35:31,552 INFO L93 Difference]: Finished difference Result 89 states and 123 transitions. [2025-03-04 14:35:31,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:35:31,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 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 44 [2025-03-04 14:35:31,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:35:31,553 INFO L225 Difference]: With dead ends: 89 [2025-03-04 14:35:31,553 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 14:35:31,553 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 14:35:31,555 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:35:31,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 221 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:35:31,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 14:35:31,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 14:35:31,555 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 14:35:31,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 14:35:31,556 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2025-03-04 14:35:31,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:35:31,556 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 14:35:31,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 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 14:35:31,556 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 14:35:31,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 14:35:31,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-04 14:35:31,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-04 14:35:31,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-04 14:35:31,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-04 14:35:31,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-04 14:35:31,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-04 14:35:31,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-04 14:35:31,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-04 14:35:31,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 14:35:31,562 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:35:31,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 14:35:31,652 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 14:35:31,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:35:31 BoogieIcfgContainer [2025-03-04 14:35:31,658 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 14:35:31,659 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 14:35:31,659 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 14:35:31,659 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 14:35:31,659 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:35:30" (3/4) ... [2025-03-04 14:35:31,661 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 14:35:31,665 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-03-04 14:35:31,665 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-03-04 14:35:31,672 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-04 14:35:31,672 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-04 14:35:31,672 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 14:35:31,673 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 14:35:31,767 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 14:35:31,767 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 14:35:31,767 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 14:35:31,768 INFO L158 Benchmark]: Toolchain (without parser) took 2757.46ms. Allocated memory is still 167.8MB. Free memory was 120.1MB in the beginning and 125.3MB in the end (delta: -5.2MB). Peak memory consumption was 87.3MB. Max. memory is 16.1GB. [2025-03-04 14:35:31,768 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 14:35:31,768 INFO L158 Benchmark]: CACSL2BoogieTranslator took 676.66ms. Allocated memory is still 167.8MB. Free memory was 120.1MB in the beginning and 58.4MB in the end (delta: 61.6MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-04 14:35:31,768 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.18ms. Allocated memory is still 167.8MB. Free memory was 58.4MB in the beginning and 55.5MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 14:35:31,768 INFO L158 Benchmark]: Boogie Preprocessor took 30.60ms. Allocated memory is still 167.8MB. Free memory was 55.5MB in the beginning and 53.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 14:35:31,769 INFO L158 Benchmark]: IcfgBuilder took 430.43ms. Allocated memory is still 167.8MB. Free memory was 53.7MB in the beginning and 114.7MB in the end (delta: -61.0MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2025-03-04 14:35:31,769 INFO L158 Benchmark]: TraceAbstraction took 1459.45ms. Allocated memory is still 167.8MB. Free memory was 113.9MB in the beginning and 49.9MB in the end (delta: 64.0MB). Peak memory consumption was 65.4MB. Max. memory is 16.1GB. [2025-03-04 14:35:31,769 INFO L158 Benchmark]: Witness Printer took 108.76ms. Allocated memory is still 167.8MB. Free memory was 49.9MB in the beginning and 125.3MB in the end (delta: -75.4MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2025-03-04 14:35:31,770 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.25ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 676.66ms. Allocated memory is still 167.8MB. Free memory was 120.1MB in the beginning and 58.4MB in the end (delta: 61.6MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.18ms. Allocated memory is still 167.8MB. Free memory was 58.4MB in the beginning and 55.5MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.60ms. Allocated memory is still 167.8MB. Free memory was 55.5MB in the beginning and 53.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 430.43ms. Allocated memory is still 167.8MB. Free memory was 53.7MB in the beginning and 114.7MB in the end (delta: -61.0MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1459.45ms. Allocated memory is still 167.8MB. Free memory was 113.9MB in the beginning and 49.9MB in the end (delta: 64.0MB). Peak memory consumption was 65.4MB. Max. memory is 16.1GB. * Witness Printer took 108.76ms. Allocated memory is still 167.8MB. Free memory was 49.9MB in the beginning and 125.3MB in the end (delta: -75.4MB). Peak memory consumption was 15.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: 1633]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1633]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1616]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1616]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1566]: 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 3 procedures, 107 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 321 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 320 mSDsluCounter, 2058 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 853 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 210 IncrementalHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 1205 mSDtfsCounter, 210 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=0, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 301 NumberOfCodeBlocks, 301 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 291 ConstructedInterpolants, 0 QuantifiedInterpolants, 435 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 4/4 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 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 14:35:31,780 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