./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_45_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_45_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash fb0c088805ce07eaa5e2b5a1c35a95750107dc8fb62b404e0de3a8ad72a7c169 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 03:50:06,329 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 03:50:06,386 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 03:50:06,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 03:50:06,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 03:50:06,409 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 03:50:06,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 03:50:06,411 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 03:50:06,411 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 03:50:06,411 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 03:50:06,412 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 03:50:06,412 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 03:50:06,412 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 03:50:06,413 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 03:50:06,413 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 03:50:06,413 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 03:50:06,413 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 03:50:06,413 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 03:50:06,413 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 03:50:06,414 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 03:50:06,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 03:50:06,414 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 03:50:06,414 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 03:50:06,414 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 03:50:06,414 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 03:50:06,414 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 03:50:06,414 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 03:50:06,414 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 03:50:06,414 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 03:50:06,414 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 03:50:06,414 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 03:50:06,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 03:50:06,415 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 03:50:06,415 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 03:50:06,415 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 03:50:06,415 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 03:50:06,415 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 03:50:06,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 03:50:06,416 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 03:50:06,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 03:50:06,416 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 03:50:06,416 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 03:50:06,416 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fb0c088805ce07eaa5e2b5a1c35a95750107dc8fb62b404e0de3a8ad72a7c169 [2025-03-09 03:50:06,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 03:50:06,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 03:50:06,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 03:50:06,684 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 03:50:06,685 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 03:50:06,686 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_45_bad.i [2025-03-09 03:50:07,857 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc3438cc1/217da31b99574385ace1f4b4bd79df86/FLAGaa34fa464 [2025-03-09 03:50:08,152 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 03:50:08,153 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_45_bad.i [2025-03-09 03:50:08,174 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc3438cc1/217da31b99574385ace1f4b4bd79df86/FLAGaa34fa464 [2025-03-09 03:50:08,185 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc3438cc1/217da31b99574385ace1f4b4bd79df86 [2025-03-09 03:50:08,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 03:50:08,190 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 03:50:08,191 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 03:50:08,191 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 03:50:08,195 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 03:50:08,196 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 03:50:08" (1/1) ... [2025-03-09 03:50:08,197 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39e0c5ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:08, skipping insertion in model container [2025-03-09 03:50:08,198 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 03:50:08" (1/1) ... [2025-03-09 03:50:08,235 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 03:50:08,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 03:50:08,848 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 03:50:08,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 03:50:09,020 INFO L204 MainTranslator]: Completed translation [2025-03-09 03:50:09,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:09 WrapperNode [2025-03-09 03:50:09,022 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 03:50:09,023 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 03:50:09,023 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 03:50:09,023 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 03:50:09,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:09" (1/1) ... [2025-03-09 03:50:09,051 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:09" (1/1) ... [2025-03-09 03:50:09,072 INFO L138 Inliner]: procedures = 499, calls = 28, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 67 [2025-03-09 03:50:09,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 03:50:09,073 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 03:50:09,073 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 03:50:09,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 03:50:09,081 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:09" (1/1) ... [2025-03-09 03:50:09,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:09" (1/1) ... [2025-03-09 03:50:09,089 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:09" (1/1) ... [2025-03-09 03:50:09,106 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2025-03-09 03:50:09,110 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:09" (1/1) ... [2025-03-09 03:50:09,110 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:09" (1/1) ... [2025-03-09 03:50:09,118 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:09" (1/1) ... [2025-03-09 03:50:09,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:09" (1/1) ... [2025-03-09 03:50:09,120 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:09" (1/1) ... [2025-03-09 03:50:09,121 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:09" (1/1) ... [2025-03-09 03:50:09,124 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 03:50:09,125 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 03:50:09,126 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 03:50:09,126 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 03:50:09,127 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:09" (1/1) ... [2025-03-09 03:50:09,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 03:50:09,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 03:50:09,156 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 03:50:09,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 03:50:09,177 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-09 03:50:09,179 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-09 03:50:09,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 03:50:09,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 03:50:09,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 03:50:09,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 03:50:09,297 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 03:50:09,299 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 03:50:09,391 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-09 03:50:09,391 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 03:50:09,397 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 03:50:09,397 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 03:50:09,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:50:09 BoogieIcfgContainer [2025-03-09 03:50:09,397 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 03:50:09,399 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 03:50:09,399 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 03:50:09,403 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 03:50:09,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 03:50:08" (1/3) ... [2025-03-09 03:50:09,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a98359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 03:50:09, skipping insertion in model container [2025-03-09 03:50:09,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:09" (2/3) ... [2025-03-09 03:50:09,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a98359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 03:50:09, skipping insertion in model container [2025-03-09 03:50:09,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:50:09" (3/3) ... [2025-03-09 03:50:09,405 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_preinc_45_bad.i [2025-03-09 03:50:09,417 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 03:50:09,418 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fgets_preinc_45_bad.i that has 2 procedures, 23 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-09 03:50:09,459 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 03:50:09,467 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;@22785002, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 03:50:09,467 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-09 03:50:09,470 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 03:50:09,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-09 03:50:09,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:50:09,474 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 03:50:09,474 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-09 03:50:09,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:50:09,478 INFO L85 PathProgramCache]: Analyzing trace with hash -346170416, now seen corresponding path program 1 times [2025-03-09 03:50:09,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 03:50:09,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421401907] [2025-03-09 03:50:09,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:50:09,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 03:50:09,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 03:50:09,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 03:50:09,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:50:09,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:50:09,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 03:50:09,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 03:50:09,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421401907] [2025-03-09 03:50:09,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421401907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:50:09,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:50:09,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 03:50:09,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667271844] [2025-03-09 03:50:09,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:50:09,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 03:50:09,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 03:50:09,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 03:50:09,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 03:50:09,828 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 03:50:09,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:50:09,854 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2025-03-09 03:50:09,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 03:50:09,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 11 [2025-03-09 03:50:09,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:50:09,860 INFO L225 Difference]: With dead ends: 23 [2025-03-09 03:50:09,860 INFO L226 Difference]: Without dead ends: 14 [2025-03-09 03:50:09,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 03:50:09,865 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:50:09,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 57 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:50:09,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-09 03:50:09,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-09 03:50:09,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 03:50:09,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2025-03-09 03:50:09,890 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2025-03-09 03:50:09,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:50:09,890 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2025-03-09 03:50:09,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 03:50:09,891 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2025-03-09 03:50:09,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 03:50:09,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:50:09,891 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 03:50:09,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 03:50:09,892 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-09 03:50:09,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:50:09,892 INFO L85 PathProgramCache]: Analyzing trace with hash -2141348323, now seen corresponding path program 1 times [2025-03-09 03:50:09,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 03:50:09,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714957136] [2025-03-09 03:50:09,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:50:09,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 03:50:09,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 03:50:09,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 03:50:09,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:50:09,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 03:50:09,925 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 03:50:09,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 03:50:09,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 03:50:09,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:50:09,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 03:50:09,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 03:50:09,955 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 03:50:09,956 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2025-03-09 03:50:09,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2025-03-09 03:50:09,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 03:50:09,959 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-09 03:50:09,972 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 03:50:09,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 03:50:09 BoogieIcfgContainer [2025-03-09 03:50:09,974 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 03:50:09,974 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 03:50:09,974 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 03:50:09,974 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 03:50:09,975 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:50:09" (3/4) ... [2025-03-09 03:50:09,977 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 03:50:09,978 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 03:50:09,978 INFO L158 Benchmark]: Toolchain (without parser) took 1788.48ms. Allocated memory is still 167.8MB. Free memory was 126.0MB in the beginning and 93.1MB in the end (delta: 32.9MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. [2025-03-09 03:50:09,978 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 226.5MB. Free memory is still 140.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:50:09,979 INFO L158 Benchmark]: CACSL2BoogieTranslator took 831.45ms. Allocated memory is still 167.8MB. Free memory was 125.7MB in the beginning and 64.6MB in the end (delta: 61.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-09 03:50:09,979 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.06ms. Allocated memory is still 167.8MB. Free memory was 64.6MB in the beginning and 62.2MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:50:09,980 INFO L158 Benchmark]: Boogie Preprocessor took 51.62ms. Allocated memory is still 167.8MB. Free memory was 62.2MB in the beginning and 60.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:50:09,980 INFO L158 Benchmark]: IcfgBuilder took 272.29ms. Allocated memory is still 167.8MB. Free memory was 60.5MB in the beginning and 47.5MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 03:50:09,980 INFO L158 Benchmark]: TraceAbstraction took 574.64ms. Allocated memory is still 167.8MB. Free memory was 46.8MB in the beginning and 93.9MB in the end (delta: -47.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:50:09,980 INFO L158 Benchmark]: Witness Printer took 3.53ms. Allocated memory is still 167.8MB. Free memory was 93.9MB in the beginning and 93.1MB in the end (delta: 863.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:50:09,981 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.29ms. Allocated memory is still 226.5MB. Free memory is still 140.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 831.45ms. Allocated memory is still 167.8MB. Free memory was 125.7MB in the beginning and 64.6MB in the end (delta: 61.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.06ms. Allocated memory is still 167.8MB. Free memory was 64.6MB in the beginning and 62.2MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.62ms. Allocated memory is still 167.8MB. Free memory was 62.2MB in the beginning and 60.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 272.29ms. Allocated memory is still 167.8MB. Free memory was 60.5MB in the beginning and 47.5MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 574.64ms. Allocated memory is still 167.8MB. Free memory was 46.8MB in the beginning and 93.9MB in the end (delta: -47.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.53ms. Allocated memory is still 167.8MB. Free memory was 93.9MB in the beginning and 93.1MB in the end (delta: 863.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1555]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1568, overapproximation of fgets at line 1566. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); [L1548] static int CWE190_Integer_Overflow__int_fgets_preinc_45_badData; [L1549] static int CWE190_Integer_Overflow__int_fgets_preinc_45_goodG2BData; [L1550] static int CWE190_Integer_Overflow__int_fgets_preinc_45_goodB2GData; VAL [CWE190_Integer_Overflow__int_fgets_preinc_45_badData=0, CWE190_Integer_Overflow__int_fgets_preinc_45_goodB2GData=0, CWE190_Integer_Overflow__int_fgets_preinc_45_goodG2BData=0, GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1581] CALL printLine("Calling bad()...") VAL [CWE190_Integer_Overflow__int_fgets_preinc_45_badData=0, CWE190_Integer_Overflow__int_fgets_preinc_45_goodB2GData=0, CWE190_Integer_Overflow__int_fgets_preinc_45_goodG2BData=0, GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1581] RET printLine("Calling bad()...") VAL [CWE190_Integer_Overflow__int_fgets_preinc_45_badData=0, CWE190_Integer_Overflow__int_fgets_preinc_45_goodB2GData=0, CWE190_Integer_Overflow__int_fgets_preinc_45_goodG2BData=0, GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1582] CALL CWE190_Integer_Overflow__int_fgets_preinc_45_bad() [L1562] int data; [L1563] data = 0 [L1565] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [CWE190_Integer_Overflow__int_fgets_preinc_45_badData=0, CWE190_Integer_Overflow__int_fgets_preinc_45_goodB2GData=0, CWE190_Integer_Overflow__int_fgets_preinc_45_goodG2BData=0, GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1566] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1568] data = atoi(inputBuffer) [L1575] CWE190_Integer_Overflow__int_fgets_preinc_45_badData = data [L1576] CALL badSink() [L1553] int data = CWE190_Integer_Overflow__int_fgets_preinc_45_badData; VAL [CWE190_Integer_Overflow__int_fgets_preinc_45_badData=2147483647, CWE190_Integer_Overflow__int_fgets_preinc_45_goodB2GData=0, CWE190_Integer_Overflow__int_fgets_preinc_45_goodG2BData=0, GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1555] ++data VAL [CWE190_Integer_Overflow__int_fgets_preinc_45_badData=2147483647, CWE190_Integer_Overflow__int_fgets_preinc_45_goodB2GData=0, CWE190_Integer_Overflow__int_fgets_preinc_45_goodG2BData=0, GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1555]: 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 2 procedures, 23 locations, 29 edges, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 57 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12 IncrementalHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 21 mSDtfsCounter, 12 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 4, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 18 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 could not prove your program: unable to determine feasibility of some traces [2025-03-09 03:50:09,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_45_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash fb0c088805ce07eaa5e2b5a1c35a95750107dc8fb62b404e0de3a8ad72a7c169 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 03:50:11,806 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 03:50:11,883 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2025-03-09 03:50:11,888 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 03:50:11,891 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 03:50:11,891 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2025-03-09 03:50:11,912 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 03:50:11,913 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 03:50:11,913 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 03:50:11,914 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 03:50:11,914 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 03:50:11,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 03:50:11,915 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 03:50:11,915 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 03:50:11,915 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 03:50:11,915 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 03:50:11,916 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 03:50:11,916 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 03:50:11,916 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 03:50:11,916 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 03:50:11,916 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 03:50:11,916 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 03:50:11,916 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 03:50:11,916 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-09 03:50:11,916 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 03:50:11,916 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-09 03:50:11,916 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 03:50:11,916 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 03:50:11,917 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 03:50:11,917 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 03:50:11,917 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 03:50:11,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 03:50:11,917 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 03:50:11,917 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 03:50:11,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 03:50:11,918 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 03:50:11,918 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 03:50:11,918 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 03:50:11,918 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 03:50:11,918 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-09 03:50:11,918 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-09 03:50:11,918 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 03:50:11,918 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 03:50:11,918 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 03:50:11,918 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 03:50:11,919 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fb0c088805ce07eaa5e2b5a1c35a95750107dc8fb62b404e0de3a8ad72a7c169 [2025-03-09 03:50:12,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 03:50:12,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 03:50:12,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 03:50:12,169 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 03:50:12,169 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 03:50:12,169 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_45_bad.i [2025-03-09 03:50:13,329 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fb12aa7d/7b58773c647748d4b931fddd1d81e199/FLAG0e985bb33 [2025-03-09 03:50:13,621 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 03:50:13,623 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_45_bad.i [2025-03-09 03:50:13,638 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fb12aa7d/7b58773c647748d4b931fddd1d81e199/FLAG0e985bb33 [2025-03-09 03:50:13,649 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fb12aa7d/7b58773c647748d4b931fddd1d81e199 [2025-03-09 03:50:13,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 03:50:13,652 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 03:50:13,653 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 03:50:13,653 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 03:50:13,656 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 03:50:13,656 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 03:50:13" (1/1) ... [2025-03-09 03:50:13,657 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@536d8511 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:13, skipping insertion in model container [2025-03-09 03:50:13,657 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 03:50:13" (1/1) ... [2025-03-09 03:50:13,691 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 03:50:14,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 03:50:14,164 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 03:50:14,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 03:50:14,347 INFO L204 MainTranslator]: Completed translation [2025-03-09 03:50:14,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:14 WrapperNode [2025-03-09 03:50:14,348 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 03:50:14,348 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 03:50:14,348 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 03:50:14,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 03:50:14,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:14" (1/1) ... [2025-03-09 03:50:14,373 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:14" (1/1) ... [2025-03-09 03:50:14,385 INFO L138 Inliner]: procedures = 504, calls = 28, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 66 [2025-03-09 03:50:14,385 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 03:50:14,385 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 03:50:14,385 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 03:50:14,385 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 03:50:14,394 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:14" (1/1) ... [2025-03-09 03:50:14,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:14" (1/1) ... [2025-03-09 03:50:14,397 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:14" (1/1) ... [2025-03-09 03:50:14,405 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2025-03-09 03:50:14,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:14" (1/1) ... [2025-03-09 03:50:14,406 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:14" (1/1) ... [2025-03-09 03:50:14,410 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:14" (1/1) ... [2025-03-09 03:50:14,410 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:14" (1/1) ... [2025-03-09 03:50:14,411 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:14" (1/1) ... [2025-03-09 03:50:14,412 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:14" (1/1) ... [2025-03-09 03:50:14,414 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 03:50:14,414 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 03:50:14,414 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 03:50:14,414 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 03:50:14,415 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:14" (1/1) ... [2025-03-09 03:50:14,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 03:50:14,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 03:50:14,446 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 03:50:14,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 03:50:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-09 03:50:14,461 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-09 03:50:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-09 03:50:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 03:50:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 03:50:14,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 03:50:14,568 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 03:50:14,570 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 03:50:14,649 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-09 03:50:14,649 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 03:50:14,656 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 03:50:14,656 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 03:50:14,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:50:14 BoogieIcfgContainer [2025-03-09 03:50:14,657 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 03:50:14,658 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 03:50:14,658 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 03:50:14,662 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 03:50:14,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 03:50:13" (1/3) ... [2025-03-09 03:50:14,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@544666de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 03:50:14, skipping insertion in model container [2025-03-09 03:50:14,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:50:14" (2/3) ... [2025-03-09 03:50:14,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@544666de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 03:50:14, skipping insertion in model container [2025-03-09 03:50:14,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:50:14" (3/3) ... [2025-03-09 03:50:14,665 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_preinc_45_bad.i [2025-03-09 03:50:14,674 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 03:50:14,676 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fgets_preinc_45_bad.i that has 2 procedures, 23 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-09 03:50:14,733 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 03:50:14,743 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;@5fae4da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 03:50:14,745 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-09 03:50:14,748 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 03:50:14,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-09 03:50:14,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:50:14,754 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 03:50:14,754 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-09 03:50:14,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:50:14,759 INFO L85 PathProgramCache]: Analyzing trace with hash -346170416, now seen corresponding path program 1 times [2025-03-09 03:50:14,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 03:50:14,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [65361960] [2025-03-09 03:50:14,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:50:14,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 03:50:14,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 03:50:14,769 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 03:50:14,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 03:50:14,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 03:50:14,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 03:50:14,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:50:14,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:50:14,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-09 03:50:14,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 03:50:14,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 03:50:14,907 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 03:50:14,908 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 03:50:14,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65361960] [2025-03-09 03:50:14,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65361960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:50:14,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:50:14,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 03:50:14,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935680667] [2025-03-09 03:50:14,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:50:14,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 03:50:14,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 03:50:14,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 03:50:14,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 03:50:14,927 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 03:50:14,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:50:14,939 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2025-03-09 03:50:14,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 03:50:14,940 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 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 11 [2025-03-09 03:50:14,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:50:14,944 INFO L225 Difference]: With dead ends: 23 [2025-03-09 03:50:14,945 INFO L226 Difference]: Without dead ends: 14 [2025-03-09 03:50:14,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 03:50:14,950 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:50:14,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:50:14,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-09 03:50:14,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-09 03:50:14,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 03:50:14,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2025-03-09 03:50:14,976 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2025-03-09 03:50:14,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:50:14,977 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2025-03-09 03:50:14,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 03:50:14,977 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2025-03-09 03:50:14,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 03:50:14,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:50:14,978 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 03:50:14,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 03:50:15,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 03:50:15,182 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-09 03:50:15,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:50:15,183 INFO L85 PathProgramCache]: Analyzing trace with hash -2141348323, now seen corresponding path program 1 times [2025-03-09 03:50:15,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 03:50:15,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [846007040] [2025-03-09 03:50:15,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:50:15,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 03:50:15,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 03:50:15,185 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 03:50:15,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 03:50:15,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 03:50:15,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 03:50:15,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:50:15,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 03:50:15,253 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 03:50:15,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 03:50:15,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 03:50:15,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:50:15,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 03:50:15,293 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-09 03:50:15,293 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 03:50:15,294 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2025-03-09 03:50:15,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2025-03-09 03:50:15,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 03:50:15,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 03:50:15,499 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-09 03:50:15,512 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 03:50:15,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 03:50:15 BoogieIcfgContainer [2025-03-09 03:50:15,514 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 03:50:15,514 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 03:50:15,514 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 03:50:15,514 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 03:50:15,515 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:50:14" (3/4) ... [2025-03-09 03:50:15,516 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 03:50:15,517 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 03:50:15,517 INFO L158 Benchmark]: Toolchain (without parser) took 1865.00ms. Allocated memory is still 117.4MB. Free memory was 87.4MB in the beginning and 56.4MB in the end (delta: 31.0MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. [2025-03-09 03:50:15,517 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory was 61.5MB in the beginning and 61.5MB in the end (delta: 18.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:50:15,517 INFO L158 Benchmark]: CACSL2BoogieTranslator took 694.94ms. Allocated memory is still 117.4MB. Free memory was 87.2MB in the beginning and 65.7MB in the end (delta: 21.5MB). Peak memory consumption was 57.3MB. Max. memory is 16.1GB. [2025-03-09 03:50:15,520 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.58ms. Allocated memory is still 117.4MB. Free memory was 65.7MB in the beginning and 63.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:50:15,520 INFO L158 Benchmark]: Boogie Preprocessor took 28.36ms. Allocated memory is still 117.4MB. Free memory was 63.3MB in the beginning and 61.3MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 03:50:15,520 INFO L158 Benchmark]: IcfgBuilder took 242.85ms. Allocated memory is still 117.4MB. Free memory was 61.3MB in the beginning and 47.6MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 03:50:15,521 INFO L158 Benchmark]: TraceAbstraction took 855.53ms. Allocated memory is still 117.4MB. Free memory was 47.1MB in the beginning and 57.0MB in the end (delta: -10.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:50:15,521 INFO L158 Benchmark]: Witness Printer took 2.29ms. Allocated memory is still 117.4MB. Free memory is still 56.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:50:15,522 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.14ms. Allocated memory is still 83.9MB. Free memory was 61.5MB in the beginning and 61.5MB in the end (delta: 18.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 694.94ms. Allocated memory is still 117.4MB. Free memory was 87.2MB in the beginning and 65.7MB in the end (delta: 21.5MB). Peak memory consumption was 57.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.58ms. Allocated memory is still 117.4MB. Free memory was 65.7MB in the beginning and 63.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.36ms. Allocated memory is still 117.4MB. Free memory was 63.3MB in the beginning and 61.3MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 242.85ms. Allocated memory is still 117.4MB. Free memory was 61.3MB in the beginning and 47.6MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 855.53ms. Allocated memory is still 117.4MB. Free memory was 47.1MB in the beginning and 57.0MB in the end (delta: -10.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.29ms. Allocated memory is still 117.4MB. Free memory is still 56.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1555]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1568, overapproximation of fgets at line 1566. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); [L1548] static int CWE190_Integer_Overflow__int_fgets_preinc_45_badData; [L1549] static int CWE190_Integer_Overflow__int_fgets_preinc_45_goodG2BData; [L1550] static int CWE190_Integer_Overflow__int_fgets_preinc_45_goodB2GData; VAL [CWE190_Integer_Overflow__int_fgets_preinc_45_badData=0, CWE190_Integer_Overflow__int_fgets_preinc_45_goodB2GData=0, CWE190_Integer_Overflow__int_fgets_preinc_45_goodG2BData=0, GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1581] CALL printLine("Calling bad()...") VAL [CWE190_Integer_Overflow__int_fgets_preinc_45_badData=0, CWE190_Integer_Overflow__int_fgets_preinc_45_goodB2GData=0, CWE190_Integer_Overflow__int_fgets_preinc_45_goodG2BData=0, GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1581] RET printLine("Calling bad()...") VAL [CWE190_Integer_Overflow__int_fgets_preinc_45_badData=0, CWE190_Integer_Overflow__int_fgets_preinc_45_goodB2GData=0, CWE190_Integer_Overflow__int_fgets_preinc_45_goodG2BData=0, GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1582] CALL CWE190_Integer_Overflow__int_fgets_preinc_45_bad() [L1562] int data; [L1563] data = 0 [L1565] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [CWE190_Integer_Overflow__int_fgets_preinc_45_badData=0, CWE190_Integer_Overflow__int_fgets_preinc_45_goodB2GData=0, CWE190_Integer_Overflow__int_fgets_preinc_45_goodG2BData=0, GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1566] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1568] data = atoi(inputBuffer) [L1575] CWE190_Integer_Overflow__int_fgets_preinc_45_badData = data [L1576] CALL badSink() [L1553] int data = CWE190_Integer_Overflow__int_fgets_preinc_45_badData; VAL [CWE190_Integer_Overflow__int_fgets_preinc_45_badData=2147483647, CWE190_Integer_Overflow__int_fgets_preinc_45_goodB2GData=0, CWE190_Integer_Overflow__int_fgets_preinc_45_goodG2BData=0, GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1555] ++data VAL [CWE190_Integer_Overflow__int_fgets_preinc_45_badData=2147483647, CWE190_Integer_Overflow__int_fgets_preinc_45_goodB2GData=0, CWE190_Integer_Overflow__int_fgets_preinc_45_goodG2BData=0, GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1555]: 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 2 procedures, 23 locations, 29 edges, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 25 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 10 SizeOfPredicates, 0 NumberOfNonLiveVariables, 60 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 could not prove your program: unable to determine feasibility of some traces [2025-03-09 03:50:15,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample