./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig3.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 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/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig3.c -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 ab66f9f89348f915f5a709aa03ac6e16c276dad15b53c460d26f0885e78d4ce7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:30:44,417 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:30:44,479 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 01:30:44,484 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:30:44,487 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:30:44,509 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:30:44,510 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:30:44,510 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:30:44,510 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:30:44,510 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:30:44,511 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:30:44,511 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:30:44,512 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:30:44,512 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:30:44,512 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:30:44,512 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:30:44,512 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:30:44,512 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:30:44,512 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:30:44,512 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:30:44,512 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:30:44,512 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:30:44,512 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:30:44,513 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:30:44,513 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:30:44,513 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:30:44,513 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:30:44,513 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:30:44,513 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:30:44,513 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:30:44,513 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:30:44,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:30:44,514 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:30:44,514 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:30:44,514 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:30:44,514 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:30:44,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:30:44,515 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:30:44,515 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:30:44,515 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:30:44,515 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:30:44,515 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:30:44,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:30:44,515 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:30:44,515 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:30:44,515 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:30:44,515 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:30:44,515 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 -> ab66f9f89348f915f5a709aa03ac6e16c276dad15b53c460d26f0885e78d4ce7 [2025-01-10 01:30:44,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:30:44,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:30:44,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:30:44,755 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:30:44,755 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:30:44,756 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig3.c [2025-01-10 01:30:45,908 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e0031fb7b/e6bf460b2437464f9b7ae31337d8a2d3/FLAG0259b68e2 [2025-01-10 01:30:46,248 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:30:46,248 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig3.c [2025-01-10 01:30:46,256 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e0031fb7b/e6bf460b2437464f9b7ae31337d8a2d3/FLAG0259b68e2 [2025-01-10 01:30:46,281 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e0031fb7b/e6bf460b2437464f9b7ae31337d8a2d3 [2025-01-10 01:30:46,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:30:46,286 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:30:46,287 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:30:46,287 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:30:46,292 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:30:46,293 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:30:46" (1/1) ... [2025-01-10 01:30:46,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25ef5e88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:46, skipping insertion in model container [2025-01-10 01:30:46,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:30:46" (1/1) ... [2025-01-10 01:30:46,324 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:30:46,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:30:46,486 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:30:46,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:30:46,504 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:30:46,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:46 WrapperNode [2025-01-10 01:30:46,505 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:30:46,506 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:30:46,506 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:30:46,506 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:30:46,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:46" (1/1) ... [2025-01-10 01:30:46,512 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:46" (1/1) ... [2025-01-10 01:30:46,520 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 31 [2025-01-10 01:30:46,522 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:30:46,522 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:30:46,522 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:30:46,522 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:30:46,527 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:46" (1/1) ... [2025-01-10 01:30:46,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:46" (1/1) ... [2025-01-10 01:30:46,528 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:46" (1/1) ... [2025-01-10 01:30:46,532 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 01:30:46,532 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:46" (1/1) ... [2025-01-10 01:30:46,532 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:46" (1/1) ... [2025-01-10 01:30:46,533 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:46" (1/1) ... [2025-01-10 01:30:46,535 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:46" (1/1) ... [2025-01-10 01:30:46,537 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:46" (1/1) ... [2025-01-10 01:30:46,538 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:46" (1/1) ... [2025-01-10 01:30:46,538 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:46" (1/1) ... [2025-01-10 01:30:46,538 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:30:46,539 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:30:46,539 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:30:46,539 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:30:46,541 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:46" (1/1) ... [2025-01-10 01:30:46,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:30:46,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:30:46,570 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-01-10 01:30:46,581 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-01-10 01:30:46,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:30:46,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:30:46,633 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:30:46,634 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:30:46,697 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-01-10 01:30:46,697 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:30:46,707 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:30:46,707 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:30:46,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:30:46 BoogieIcfgContainer [2025-01-10 01:30:46,708 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:30:46,709 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:30:46,709 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:30:46,713 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:30:46,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:30:46" (1/3) ... [2025-01-10 01:30:46,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40464559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:30:46, skipping insertion in model container [2025-01-10 01:30:46,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:46" (2/3) ... [2025-01-10 01:30:46,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40464559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:30:46, skipping insertion in model container [2025-01-10 01:30:46,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:30:46" (3/3) ... [2025-01-10 01:30:46,717 INFO L128 eAbstractionObserver]: Analyzing ICFG PodelskiRybalchenko-TACAS2011-Fig3.c [2025-01-10 01:30:46,728 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:30:46,729 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG PodelskiRybalchenko-TACAS2011-Fig3.c that has 1 procedures, 20 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2025-01-10 01:30:46,774 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:30:46,786 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;@56cdb663, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:30:46,787 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 01:30:46,791 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 19 states have internal predecessors, (21), 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-01-10 01:30:46,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 01:30:46,797 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:46,797 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 01:30:46,798 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:30:46,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:46,802 INFO L85 PathProgramCache]: Analyzing trace with hash 28694788, now seen corresponding path program 1 times [2025-01-10 01:30:46,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:46,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018111406] [2025-01-10 01:30:46,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:46,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:46,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:30:46,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:30:46,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:46,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:46,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:46,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:46,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018111406] [2025-01-10 01:30:46,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018111406] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:30:46,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:30:46,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:30:46,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706924353] [2025-01-10 01:30:46,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:30:46,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:30:46,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:46,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:30:46,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:30:46,982 INFO L87 Difference]: Start difference. First operand has 20 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:47,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:47,022 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2025-01-10 01:30:47,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:30:47,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-10 01:30:47,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:47,032 INFO L225 Difference]: With dead ends: 20 [2025-01-10 01:30:47,032 INFO L226 Difference]: Without dead ends: 15 [2025-01-10 01:30:47,034 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-01-10 01:30:47,037 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:47,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 16 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:30:47,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-01-10 01:30:47,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-01-10 01:30:47,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 14 states have internal predecessors, (16), 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-01-10 01:30:47,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2025-01-10 01:30:47,066 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 5 [2025-01-10 01:30:47,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:47,068 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2025-01-10 01:30:47,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:47,068 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2025-01-10 01:30:47,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 01:30:47,068 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:47,069 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 01:30:47,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:30:47,069 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:30:47,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:47,070 INFO L85 PathProgramCache]: Analyzing trace with hash 28694980, now seen corresponding path program 1 times [2025-01-10 01:30:47,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:47,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254664922] [2025-01-10 01:30:47,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:47,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:47,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:30:47,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:30:47,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:47,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:47,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:47,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254664922] [2025-01-10 01:30:47,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254664922] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:30:47,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:30:47,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:30:47,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228249687] [2025-01-10 01:30:47,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:30:47,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:30:47,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:47,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:30:47,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:30:47,126 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:47,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:47,143 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2025-01-10 01:30:47,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:30:47,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-10 01:30:47,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:47,144 INFO L225 Difference]: With dead ends: 16 [2025-01-10 01:30:47,144 INFO L226 Difference]: Without dead ends: 15 [2025-01-10 01:30:47,145 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-01-10 01:30:47,145 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:47,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 16 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:30:47,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-01-10 01:30:47,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2025-01-10 01:30:47,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 13 states have internal predecessors, (15), 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-01-10 01:30:47,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2025-01-10 01:30:47,151 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 5 [2025-01-10 01:30:47,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:47,151 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2025-01-10 01:30:47,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:47,151 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2025-01-10 01:30:47,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 01:30:47,152 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:47,152 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:30:47,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:30:47,156 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:30:47,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:47,156 INFO L85 PathProgramCache]: Analyzing trace with hash 889538471, now seen corresponding path program 1 times [2025-01-10 01:30:47,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:47,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132198378] [2025-01-10 01:30:47,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:47,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:47,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:30:47,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:30:47,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:47,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:47,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:47,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:47,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132198378] [2025-01-10 01:30:47,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132198378] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:30:47,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:30:47,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:30:47,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984091134] [2025-01-10 01:30:47,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:30:47,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:30:47,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:47,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:30:47,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:30:47,219 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:47,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:47,269 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2025-01-10 01:30:47,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:30:47,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 01:30:47,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:47,270 INFO L225 Difference]: With dead ends: 14 [2025-01-10 01:30:47,270 INFO L226 Difference]: Without dead ends: 13 [2025-01-10 01:30:47,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:30:47,273 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:47,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 14 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:30:47,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-01-10 01:30:47,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-01-10 01:30:47,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:47,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2025-01-10 01:30:47,278 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 6 [2025-01-10 01:30:47,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:47,279 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2025-01-10 01:30:47,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:47,279 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2025-01-10 01:30:47,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 01:30:47,279 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:47,279 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:30:47,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:30:47,280 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:30:47,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:47,281 INFO L85 PathProgramCache]: Analyzing trace with hash 889544429, now seen corresponding path program 1 times [2025-01-10 01:30:47,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:47,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636548244] [2025-01-10 01:30:47,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:47,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:47,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:30:47,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:30:47,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:47,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:47,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:47,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:47,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636548244] [2025-01-10 01:30:47,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636548244] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:30:47,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:30:47,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:30:47,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643948019] [2025-01-10 01:30:47,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:30:47,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:30:47,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:47,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:30:47,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:30:47,327 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:47,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:47,354 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2025-01-10 01:30:47,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:30:47,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 01:30:47,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:47,355 INFO L225 Difference]: With dead ends: 22 [2025-01-10 01:30:47,355 INFO L226 Difference]: Without dead ends: 21 [2025-01-10 01:30:47,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:30:47,356 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:47,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 28 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:30:47,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-01-10 01:30:47,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2025-01-10 01:30:47,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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-01-10 01:30:47,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2025-01-10 01:30:47,363 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 6 [2025-01-10 01:30:47,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:47,363 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2025-01-10 01:30:47,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:47,363 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2025-01-10 01:30:47,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:30:47,364 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:47,364 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:30:47,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:30:47,364 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:30:47,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:47,364 INFO L85 PathProgramCache]: Analyzing trace with hash 153705999, now seen corresponding path program 1 times [2025-01-10 01:30:47,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:47,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018565121] [2025-01-10 01:30:47,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:47,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:47,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:30:47,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:30:47,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:47,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:30:47,378 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 01:30:47,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:30:47,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:30:47,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:47,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:30:47,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 01:30:47,396 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 01:30:47,396 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-01-10 01:30:47,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-01-10 01:30:47,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-01-10 01:30:47,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-01-10 01:30:47,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-01-10 01:30:47,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-01-10 01:30:47,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:30:47,404 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-10 01:30:47,423 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:30:47,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:30:47 BoogieIcfgContainer [2025-01-10 01:30:47,432 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:30:47,433 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:30:47,433 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:30:47,433 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:30:47,434 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:30:46" (3/4) ... [2025-01-10 01:30:47,435 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-10 01:30:47,481 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 3. [2025-01-10 01:30:47,542 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:30:47,547 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:30:47,547 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:30:47,547 INFO L158 Benchmark]: Toolchain (without parser) took 1261.20ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 54.1MB in the end (delta: 58.3MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-10 01:30:47,548 INFO L158 Benchmark]: CDTParser took 0.63ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:30:47,548 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.22ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 102.3MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:30:47,548 INFO L158 Benchmark]: Boogie Procedure Inliner took 15.88ms. Allocated memory is still 142.6MB. Free memory was 102.3MB in the beginning and 101.4MB in the end (delta: 951.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:30:47,548 INFO L158 Benchmark]: Boogie Preprocessor took 16.35ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 100.4MB in the end (delta: 983.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:30:47,548 INFO L158 Benchmark]: RCFGBuilder took 169.25ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 90.0MB in the end (delta: 10.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 01:30:47,548 INFO L158 Benchmark]: TraceAbstraction took 723.22ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 59.1MB in the end (delta: 30.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 01:30:47,548 INFO L158 Benchmark]: Witness Printer took 113.71ms. Allocated memory is still 142.6MB. Free memory was 59.1MB in the beginning and 54.1MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:30:47,550 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.63ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.22ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 102.3MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 15.88ms. Allocated memory is still 142.6MB. Free memory was 102.3MB in the beginning and 101.4MB in the end (delta: 951.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.35ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 100.4MB in the end (delta: 983.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 169.25ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 90.0MB in the end (delta: 10.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 723.22ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 59.1MB in the end (delta: 30.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 113.71ms. Allocated memory is still 142.6MB. Free memory was 59.1MB in the beginning and 54.1MB in the end (delta: 5.0MB). 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 - CounterExampleResult [Line: 22]: integer overflow possible integer overflow possible We found a FailurePath: [L12] int x = __VERIFIER_nondet_int(); [L13] int y = __VERIFIER_nondet_int(); [L14] COND TRUE x > 0 && y > 0 [L15] int old_x = x; [L16] int old_y = y; [L17] COND FALSE !(__VERIFIER_nondet_int()) [L21] EXPR old_y - 2 [L21] x = old_y - 2 VAL [old_x=2147483647, x=0] [L22] old_x + 1 VAL [x=0] - UnprovableResult [Line: 18]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 21]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 21]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 22]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47 IncrementalHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 45 mSDtfsCounter, 47 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 42 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-10 01:30:47,573 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)