./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_multiply_05_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_multiply_05_good.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 a814cf57fd535147ce2446449d6b11390c829ca4349271f7ff62504085d77607 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 12:48:37,398 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 12:48:37,448 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-08 12:48:37,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 12:48:37,451 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 12:48:37,473 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 12:48:37,474 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 12:48:37,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 12:48:37,474 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 12:48:37,474 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 12:48:37,475 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 12:48:37,475 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 12:48:37,476 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 12:48:37,476 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 12:48:37,476 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 12:48:37,476 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 12:48:37,476 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 12:48:37,476 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 12:48:37,476 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 12:48:37,476 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 12:48:37,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 12:48:37,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 12:48:37,476 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 12:48:37,476 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 12:48:37,476 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 12:48:37,476 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 12:48:37,476 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 12:48:37,477 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 12:48:37,477 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 12:48:37,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 12:48:37,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 12:48:37,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 12:48:37,477 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 12:48:37,477 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 12:48:37,477 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 12:48:37,477 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 12:48:37,477 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 12:48:37,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 12:48:37,477 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 12:48:37,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 12:48:37,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 12:48:37,477 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 12:48:37,477 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-jdk21/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 -> a814cf57fd535147ce2446449d6b11390c829ca4349271f7ff62504085d77607 [2025-02-08 12:48:37,697 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 12:48:37,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 12:48:37,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 12:48:37,706 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 12:48:37,707 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 12:48:37,708 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_multiply_05_good.i [2025-02-08 12:48:38,874 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f47a162ad/f122394a57f44117a34c685fabc3ceb7/FLAG103b2e513 [2025-02-08 12:48:39,231 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 12:48:39,232 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_multiply_05_good.i [2025-02-08 12:48:39,252 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f47a162ad/f122394a57f44117a34c685fabc3ceb7/FLAG103b2e513 [2025-02-08 12:48:39,448 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f47a162ad/f122394a57f44117a34c685fabc3ceb7 [2025-02-08 12:48:39,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 12:48:39,451 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 12:48:39,451 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 12:48:39,452 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 12:48:39,455 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 12:48:39,455 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:48:39" (1/1) ... [2025-02-08 12:48:39,456 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@378fba94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:48:39, skipping insertion in model container [2025-02-08 12:48:39,457 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:48:39" (1/1) ... [2025-02-08 12:48:39,495 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 12:48:39,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 12:48:39,982 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 12:48:40,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 12:48:40,123 INFO L204 MainTranslator]: Completed translation [2025-02-08 12:48:40,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:48:40 WrapperNode [2025-02-08 12:48:40,124 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 12:48:40,124 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 12:48:40,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 12:48:40,125 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 12:48:40,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:48:40" (1/1) ... [2025-02-08 12:48:40,146 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:48:40" (1/1) ... [2025-02-08 12:48:40,158 INFO L138 Inliner]: procedures = 502, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 131 [2025-02-08 12:48:40,159 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 12:48:40,159 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 12:48:40,159 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 12:48:40,159 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 12:48:40,164 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:48:40" (1/1) ... [2025-02-08 12:48:40,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:48:40" (1/1) ... [2025-02-08 12:48:40,166 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:48:40" (1/1) ... [2025-02-08 12:48:40,174 INFO L175 MemorySlicer]: Split 2 memory accesses to 2 slices as follows [1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [1, 1]. The 0 writes are split as follows [0, 0]. [2025-02-08 12:48:40,174 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:48:40" (1/1) ... [2025-02-08 12:48:40,174 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:48:40" (1/1) ... [2025-02-08 12:48:40,177 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:48:40" (1/1) ... [2025-02-08 12:48:40,178 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:48:40" (1/1) ... [2025-02-08 12:48:40,182 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:48:40" (1/1) ... [2025-02-08 12:48:40,182 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:48:40" (1/1) ... [2025-02-08 12:48:40,198 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 12:48:40,198 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 12:48:40,198 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 12:48:40,198 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 12:48:40,199 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:48:40" (1/1) ... [2025-02-08 12:48:40,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 12:48:40,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 12:48:40,223 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 12:48:40,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 12:48:40,243 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-02-08 12:48:40,243 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-02-08 12:48:40,243 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-02-08 12:48:40,243 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-02-08 12:48:40,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 12:48:40,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 12:48:40,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 12:48:40,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 12:48:40,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 12:48:40,368 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 12:48:40,369 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 12:48:40,501 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-02-08 12:48:40,501 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 12:48:40,507 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 12:48:40,507 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 12:48:40,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:48:40 BoogieIcfgContainer [2025-02-08 12:48:40,508 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 12:48:40,509 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 12:48:40,509 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 12:48:40,512 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 12:48:40,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:48:39" (1/3) ... [2025-02-08 12:48:40,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d2ec87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:48:40, skipping insertion in model container [2025-02-08 12:48:40,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:48:40" (2/3) ... [2025-02-08 12:48:40,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d2ec87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:48:40, skipping insertion in model container [2025-02-08 12:48:40,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:48:40" (3/3) ... [2025-02-08 12:48:40,513 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fgets_multiply_05_good.i [2025-02-08 12:48:40,522 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 12:48:40,523 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_fgets_multiply_05_good.i that has 3 procedures, 66 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-02-08 12:48:40,553 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 12:48:40,560 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;@69b954d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 12:48:40,560 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-08 12:48:40,562 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 43 states have (on average 1.5813953488372092) internal successors, (68), 57 states have internal predecessors, (68), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 12:48:40,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 12:48:40,565 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:48:40,566 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:48:40,566 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-02-08 12:48:40,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:48:40,569 INFO L85 PathProgramCache]: Analyzing trace with hash -2004061771, now seen corresponding path program 1 times [2025-02-08 12:48:40,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:48:40,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394109768] [2025-02-08 12:48:40,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:48:40,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:48:40,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 12:48:40,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 12:48:40,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:48:40,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:48:40,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 12:48:40,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:48:40,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394109768] [2025-02-08 12:48:40,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394109768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:48:40,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:48:40,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 12:48:40,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613974042] [2025-02-08 12:48:40,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:48:40,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 12:48:40,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:48:40,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 12:48:40,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:48:40,728 INFO L87 Difference]: Start difference. First operand has 66 states, 43 states have (on average 1.5813953488372092) internal successors, (68), 57 states have internal predecessors, (68), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-02-08 12:48:40,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:48:40,763 INFO L93 Difference]: Finished difference Result 125 states and 173 transitions. [2025-02-08 12:48:40,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 12:48:40,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2025-02-08 12:48:40,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:48:40,772 INFO L225 Difference]: With dead ends: 125 [2025-02-08 12:48:40,772 INFO L226 Difference]: Without dead ends: 59 [2025-02-08 12:48:40,774 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-02-08 12:48:40,777 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 83 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:48:40,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 80 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:48:40,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-08 12:48:40,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-02-08 12:48:40,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.435897435897436) internal successors, (56), 52 states have internal predecessors, (56), 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-02-08 12:48:40,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 76 transitions. [2025-02-08 12:48:40,807 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 76 transitions. Word has length 12 [2025-02-08 12:48:40,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:48:40,807 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 76 transitions. [2025-02-08 12:48:40,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-02-08 12:48:40,808 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2025-02-08 12:48:40,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 12:48:40,808 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:48:40,808 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:48:40,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 12:48:40,809 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-02-08 12:48:40,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:48:40,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1710557523, now seen corresponding path program 1 times [2025-02-08 12:48:40,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:48:40,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107981966] [2025-02-08 12:48:40,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:48:40,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:48:40,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 12:48:40,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 12:48:40,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:48:40,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:48:40,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 12:48:40,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:48:40,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107981966] [2025-02-08 12:48:40,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107981966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:48:40,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:48:40,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 12:48:40,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474268392] [2025-02-08 12:48:40,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:48:40,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 12:48:40,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:48:40,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 12:48:40,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:48:40,894 INFO L87 Difference]: Start difference. First operand 59 states and 76 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-02-08 12:48:40,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:48:40,922 INFO L93 Difference]: Finished difference Result 107 states and 137 transitions. [2025-02-08 12:48:40,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 12:48:40,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2025-02-08 12:48:40,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:48:40,923 INFO L225 Difference]: With dead ends: 107 [2025-02-08 12:48:40,923 INFO L226 Difference]: Without dead ends: 64 [2025-02-08 12:48:40,924 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-02-08 12:48:40,924 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 7 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:48:40,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 141 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:48:40,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-08 12:48:40,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2025-02-08 12:48:40,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 54 states have internal predecessors, (61), 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-02-08 12:48:40,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 81 transitions. [2025-02-08 12:48:40,930 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 81 transitions. Word has length 14 [2025-02-08 12:48:40,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:48:40,930 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 81 transitions. [2025-02-08 12:48:40,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-02-08 12:48:40,930 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 81 transitions. [2025-02-08 12:48:40,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 12:48:40,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:48:40,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:48:40,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 12:48:40,931 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-02-08 12:48:40,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:48:40,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1487675690, now seen corresponding path program 1 times [2025-02-08 12:48:40,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:48:40,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363803263] [2025-02-08 12:48:40,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:48:40,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:48:40,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 12:48:40,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 12:48:40,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:48:40,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:48:40,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 12:48:40,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:48:40,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363803263] [2025-02-08 12:48:40,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363803263] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:48:40,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:48:40,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 12:48:40,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139593008] [2025-02-08 12:48:40,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:48:40,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 12:48:40,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:48:40,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 12:48:40,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:48:40,977 INFO L87 Difference]: Start difference. First operand 62 states and 81 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-02-08 12:48:40,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:48:40,991 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2025-02-08 12:48:40,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 12:48:40,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 15 [2025-02-08 12:48:40,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:48:40,992 INFO L225 Difference]: With dead ends: 62 [2025-02-08 12:48:40,992 INFO L226 Difference]: Without dead ends: 61 [2025-02-08 12:48:40,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-02-08 12:48:40,992 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:48:40,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:48:40,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-08 12:48:40,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-02-08 12:48:40,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 53 states have internal predecessors, (60), 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-02-08 12:48:40,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2025-02-08 12:48:40,997 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 15 [2025-02-08 12:48:40,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:48:40,998 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2025-02-08 12:48:40,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-02-08 12:48:40,998 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2025-02-08 12:48:40,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 12:48:40,999 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:48:40,999 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-02-08 12:48:40,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 12:48:40,999 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-02-08 12:48:40,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:48:40,999 INFO L85 PathProgramCache]: Analyzing trace with hash 38543215, now seen corresponding path program 1 times [2025-02-08 12:48:40,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:48:40,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956099837] [2025-02-08 12:48:40,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:48:40,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:48:41,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 12:48:41,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 12:48:41,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:48:41,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:48:41,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 12:48:41,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:48:41,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956099837] [2025-02-08 12:48:41,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956099837] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:48:41,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:48:41,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 12:48:41,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492420063] [2025-02-08 12:48:41,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:48:41,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 12:48:41,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:48:41,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 12:48:41,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:48:41,076 INFO L87 Difference]: Start difference. First operand 61 states and 80 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-02-08 12:48:41,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:48:41,100 INFO L93 Difference]: Finished difference Result 92 states and 116 transitions. [2025-02-08 12:48:41,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 12:48:41,101 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-02-08 12:48:41,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:48:41,101 INFO L225 Difference]: With dead ends: 92 [2025-02-08 12:48:41,101 INFO L226 Difference]: Without dead ends: 64 [2025-02-08 12:48:41,102 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-02-08 12:48:41,102 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 6 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:48:41,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 132 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:48:41,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-08 12:48:41,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-02-08 12:48:41,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 55 states have internal predecessors, (64), 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-02-08 12:48:41,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2025-02-08 12:48:41,112 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 20 [2025-02-08 12:48:41,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:48:41,112 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2025-02-08 12:48:41,112 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-02-08 12:48:41,112 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2025-02-08 12:48:41,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 12:48:41,113 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:48:41,114 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] [2025-02-08 12:48:41,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 12:48:41,118 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-02-08 12:48:41,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:48:41,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1194839673, now seen corresponding path program 1 times [2025-02-08 12:48:41,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:48:41,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735900542] [2025-02-08 12:48:41,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:48:41,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:48:41,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 12:48:41,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 12:48:41,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:48:41,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:48:41,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 12:48:41,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:48:41,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735900542] [2025-02-08 12:48:41,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735900542] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:48:41,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:48:41,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 12:48:41,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417408926] [2025-02-08 12:48:41,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:48:41,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 12:48:41,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:48:41,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 12:48:41,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:48:41,184 INFO L87 Difference]: Start difference. First operand 64 states and 84 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-02-08 12:48:41,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:48:41,204 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2025-02-08 12:48:41,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 12:48:41,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 21 [2025-02-08 12:48:41,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:48:41,205 INFO L225 Difference]: With dead ends: 64 [2025-02-08 12:48:41,205 INFO L226 Difference]: Without dead ends: 63 [2025-02-08 12:48:41,205 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-02-08 12:48:41,205 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:48:41,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:48:41,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-08 12:48:41,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-02-08 12:48:41,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 54 states have internal predecessors, (63), 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-02-08 12:48:41,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 83 transitions. [2025-02-08 12:48:41,213 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 83 transitions. Word has length 21 [2025-02-08 12:48:41,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:48:41,214 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 83 transitions. [2025-02-08 12:48:41,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-02-08 12:48:41,214 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2025-02-08 12:48:41,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 12:48:41,215 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:48:41,215 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] [2025-02-08 12:48:41,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 12:48:41,216 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-02-08 12:48:41,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:48:41,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1505682413, now seen corresponding path program 1 times [2025-02-08 12:48:41,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:48:41,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717497810] [2025-02-08 12:48:41,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:48:41,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:48:41,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 12:48:41,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 12:48:41,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:48:41,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:48:41,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 12:48:41,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:48:41,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717497810] [2025-02-08 12:48:41,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717497810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:48:41,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:48:41,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 12:48:41,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068198286] [2025-02-08 12:48:41,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:48:41,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 12:48:41,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:48:41,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 12:48:41,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:48:41,261 INFO L87 Difference]: Start difference. First operand 63 states and 83 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-02-08 12:48:41,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:48:41,274 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2025-02-08 12:48:41,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 12:48:41,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 23 [2025-02-08 12:48:41,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:48:41,275 INFO L225 Difference]: With dead ends: 63 [2025-02-08 12:48:41,275 INFO L226 Difference]: Without dead ends: 62 [2025-02-08 12:48:41,275 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-02-08 12:48:41,276 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 2 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:48:41,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 126 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:48:41,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-08 12:48:41,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-02-08 12:48:41,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 53 states have internal predecessors, (62), 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-02-08 12:48:41,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 82 transitions. [2025-02-08 12:48:41,285 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 82 transitions. Word has length 23 [2025-02-08 12:48:41,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:48:41,285 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 82 transitions. [2025-02-08 12:48:41,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-02-08 12:48:41,285 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2025-02-08 12:48:41,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 12:48:41,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:48:41,286 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] [2025-02-08 12:48:41,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 12:48:41,286 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-02-08 12:48:41,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:48:41,286 INFO L85 PathProgramCache]: Analyzing trace with hash -568485459, now seen corresponding path program 1 times [2025-02-08 12:48:41,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:48:41,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55734133] [2025-02-08 12:48:41,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:48:41,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:48:41,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 12:48:41,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 12:48:41,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:48:41,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:48:41,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 12:48:41,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:48:41,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55734133] [2025-02-08 12:48:41,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55734133] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:48:41,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:48:41,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 12:48:41,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4941404] [2025-02-08 12:48:41,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:48:41,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 12:48:41,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:48:41,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 12:48:41,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:48:41,347 INFO L87 Difference]: Start difference. First operand 62 states and 82 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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-02-08 12:48:41,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:48:41,365 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2025-02-08 12:48:41,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 12:48:41,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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 24 [2025-02-08 12:48:41,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:48:41,366 INFO L225 Difference]: With dead ends: 75 [2025-02-08 12:48:41,366 INFO L226 Difference]: Without dead ends: 66 [2025-02-08 12:48:41,366 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-02-08 12:48:41,367 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 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-02-08 12:48:41,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:48:41,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-08 12:48:41,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-02-08 12:48:41,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 56 states have internal predecessors, (66), 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-02-08 12:48:41,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 86 transitions. [2025-02-08 12:48:41,371 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 86 transitions. Word has length 24 [2025-02-08 12:48:41,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:48:41,371 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 86 transitions. [2025-02-08 12:48:41,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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-02-08 12:48:41,371 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 86 transitions. [2025-02-08 12:48:41,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 12:48:41,372 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:48:41,372 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] [2025-02-08 12:48:41,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 12:48:41,372 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-02-08 12:48:41,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:48:41,372 INFO L85 PathProgramCache]: Analyzing trace with hash -16842956, now seen corresponding path program 1 times [2025-02-08 12:48:41,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:48:41,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473654807] [2025-02-08 12:48:41,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:48:41,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:48:41,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 12:48:41,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 12:48:41,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:48:41,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:48:41,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 12:48:41,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:48:41,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473654807] [2025-02-08 12:48:41,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473654807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:48:41,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:48:41,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 12:48:41,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043656828] [2025-02-08 12:48:41,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:48:41,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 12:48:41,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:48:41,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 12:48:41,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:48:41,433 INFO L87 Difference]: Start difference. First operand 66 states and 86 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-02-08 12:48:41,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:48:41,442 INFO L93 Difference]: Finished difference Result 106 states and 133 transitions. [2025-02-08 12:48:41,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 12:48:41,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 29 [2025-02-08 12:48:41,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:48:41,444 INFO L225 Difference]: With dead ends: 106 [2025-02-08 12:48:41,444 INFO L226 Difference]: Without dead ends: 59 [2025-02-08 12:48:41,444 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-02-08 12:48:41,445 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 48 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:48:41,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 61 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:48:41,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-08 12:48:41,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-02-08 12:48:41,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 50 states have internal predecessors, (57), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-08 12:48:41,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2025-02-08 12:48:41,451 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 29 [2025-02-08 12:48:41,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:48:41,454 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2025-02-08 12:48:41,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-02-08 12:48:41,454 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2025-02-08 12:48:41,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-08 12:48:41,454 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:48:41,454 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] [2025-02-08 12:48:41,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 12:48:41,455 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-02-08 12:48:41,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:48:41,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1911010872, now seen corresponding path program 1 times [2025-02-08 12:48:41,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:48:41,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586172760] [2025-02-08 12:48:41,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:48:41,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:48:41,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 12:48:41,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 12:48:41,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:48:41,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:48:41,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 12:48:41,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:48:41,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586172760] [2025-02-08 12:48:41,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586172760] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:48:41,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:48:41,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 12:48:41,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289893934] [2025-02-08 12:48:41,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:48:41,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 12:48:41,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:48:41,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 12:48:41,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:48:41,517 INFO L87 Difference]: Start difference. First operand 59 states and 73 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, (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-02-08 12:48:41,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:48:41,525 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2025-02-08 12:48:41,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 12:48:41,525 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, (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 34 [2025-02-08 12:48:41,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:48:41,526 INFO L225 Difference]: With dead ends: 59 [2025-02-08 12:48:41,526 INFO L226 Difference]: Without dead ends: 58 [2025-02-08 12:48:41,526 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-02-08 12:48:41,526 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 1 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:48:41,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 115 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:48:41,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-08 12:48:41,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-02-08 12:48:41,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 49 states have internal predecessors, (56), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-08 12:48:41,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2025-02-08 12:48:41,531 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 34 [2025-02-08 12:48:41,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:48:41,531 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2025-02-08 12:48:41,531 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, (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-02-08 12:48:41,531 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2025-02-08 12:48:41,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 12:48:41,532 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:48:41,532 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:48:41,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 12:48:41,532 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-02-08 12:48:41,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:48:41,533 INFO L85 PathProgramCache]: Analyzing trace with hash 888205093, now seen corresponding path program 1 times [2025-02-08 12:48:41,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:48:41,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906353529] [2025-02-08 12:48:41,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:48:41,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:48:41,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 12:48:41,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 12:48:41,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:48:41,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:48:41,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 12:48:41,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:48:41,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906353529] [2025-02-08 12:48:41,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906353529] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:48:41,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:48:41,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 12:48:41,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937654617] [2025-02-08 12:48:41,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:48:41,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 12:48:41,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:48:41,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 12:48:41,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:48:41,588 INFO L87 Difference]: Start difference. First operand 58 states and 72 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, (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-02-08 12:48:41,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:48:41,593 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2025-02-08 12:48:41,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 12:48:41,594 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, (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 35 [2025-02-08 12:48:41,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:48:41,594 INFO L225 Difference]: With dead ends: 58 [2025-02-08 12:48:41,594 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 12:48:41,594 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-02-08 12:48:41,594 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:48:41,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:48:41,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 12:48:41,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 12:48:41,595 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-02-08 12:48:41,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 12:48:41,595 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2025-02-08 12:48:41,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:48:41,596 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 12:48:41,596 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, (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-02-08 12:48:41,596 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 12:48:41,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 12:48:41,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-02-08 12:48:41,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-02-08 12:48:41,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-02-08 12:48:41,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-02-08 12:48:41,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-02-08 12:48:41,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-02-08 12:48:41,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-02-08 12:48:41,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-02-08 12:48:41,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 12:48:41,601 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:48:41,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 12:48:41,703 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 12:48:41,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:48:41 BoogieIcfgContainer [2025-02-08 12:48:41,707 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 12:48:41,707 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 12:48:41,707 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 12:48:41,707 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 12:48:41,708 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:48:40" (3/4) ... [2025-02-08 12:48:41,709 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 12:48:41,713 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-02-08 12:48:41,713 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-02-08 12:48:41,717 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-02-08 12:48:41,717 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-02-08 12:48:41,717 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 12:48:41,718 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 12:48:41,718 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 12:48:41,771 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 12:48:41,771 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 12:48:41,771 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 12:48:41,772 INFO L158 Benchmark]: Toolchain (without parser) took 2321.12ms. Allocated memory is still 142.6MB. Free memory was 109.5MB in the beginning and 65.1MB in the end (delta: 44.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-08 12:48:41,773 INFO L158 Benchmark]: CDTParser took 0.69ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 12:48:41,773 INFO L158 Benchmark]: CACSL2BoogieTranslator took 672.43ms. Allocated memory is still 142.6MB. Free memory was 108.7MB in the beginning and 48.7MB in the end (delta: 60.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-08 12:48:41,775 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.34ms. Allocated memory is still 142.6MB. Free memory was 48.7MB in the beginning and 45.4MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 12:48:41,776 INFO L158 Benchmark]: Boogie Preprocessor took 38.71ms. Allocated memory is still 142.6MB. Free memory was 45.4MB in the beginning and 114.2MB in the end (delta: -68.8MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2025-02-08 12:48:41,776 INFO L158 Benchmark]: IcfgBuilder took 309.52ms. Allocated memory is still 142.6MB. Free memory was 114.2MB in the beginning and 96.9MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 12:48:41,776 INFO L158 Benchmark]: TraceAbstraction took 1197.48ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 72.4MB in the end (delta: 23.9MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2025-02-08 12:48:41,777 INFO L158 Benchmark]: Witness Printer took 64.34ms. Allocated memory is still 142.6MB. Free memory was 71.5MB in the beginning and 65.1MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 12:48:41,777 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.69ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 672.43ms. Allocated memory is still 142.6MB. Free memory was 108.7MB in the beginning and 48.7MB in the end (delta: 60.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.34ms. Allocated memory is still 142.6MB. Free memory was 48.7MB in the beginning and 45.4MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.71ms. Allocated memory is still 142.6MB. Free memory was 45.4MB in the beginning and 114.2MB in the end (delta: -68.8MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * IcfgBuilder took 309.52ms. Allocated memory is still 142.6MB. Free memory was 114.2MB in the beginning and 96.9MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1197.48ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 72.4MB in the end (delta: 23.9MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * Witness Printer took 64.34ms. Allocated memory is still 142.6MB. Free memory was 71.5MB in the beginning and 65.1MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1655]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1655]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1638]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1638]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1612]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1612]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1578]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1578]: 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, 66 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 151 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 147 mSDsluCounter, 1167 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 486 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 83 IncrementalHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 681 mSDtfsCounter, 83 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=66occurred 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 227 NumberOfCodeBlocks, 227 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 217 ConstructedInterpolants, 0 QuantifiedInterpolants, 341 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-02-08 12:48:41,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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