./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_17_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_17_bad.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash bbc64fd25d0eb5fa31633a8c76dba801bfa80f4d9146ca588047e7c404032713 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 12:50:17,706 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 12:50:17,742 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-08 12:50:17,745 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 12:50:17,745 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 12:50:17,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 12:50:17,760 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 12:50:17,760 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 12:50:17,760 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 12:50:17,761 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 12:50:17,761 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 12:50:17,761 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 12:50:17,761 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 12:50:17,761 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 12:50:17,761 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 12:50:17,761 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 12:50:17,761 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 12:50:17,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 12:50:17,761 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 12:50:17,761 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 12:50:17,762 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 12:50:17,762 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 12:50:17,762 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 12:50:17,762 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 12:50:17,762 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 12:50:17,762 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 12:50:17,762 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 12:50:17,762 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 12:50:17,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 12:50:17,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 12:50:17,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 12:50:17,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 12:50:17,762 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 12:50:17,762 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 12:50:17,762 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 12:50:17,762 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 12:50:17,762 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 12:50:17,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 12:50:17,762 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 12:50:17,762 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 12:50:17,763 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 12:50:17,763 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 12:50:17,763 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 -> bbc64fd25d0eb5fa31633a8c76dba801bfa80f4d9146ca588047e7c404032713 [2025-02-08 12:50:18,009 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 12:50:18,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 12:50:18,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 12:50:18,017 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 12:50:18,017 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 12:50:18,017 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_17_bad.i [2025-02-08 12:50:19,392 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76e895ca7/aeb7036a53b544b69ad0dc39aff43e26/FLAGd180ae1c1 [2025-02-08 12:50:19,862 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 12:50:19,863 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_17_bad.i [2025-02-08 12:50:19,898 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76e895ca7/aeb7036a53b544b69ad0dc39aff43e26/FLAGd180ae1c1 [2025-02-08 12:50:19,911 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76e895ca7/aeb7036a53b544b69ad0dc39aff43e26 [2025-02-08 12:50:19,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 12:50:19,914 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 12:50:19,915 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 12:50:19,915 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 12:50:19,918 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 12:50:19,919 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:50:19" (1/1) ... [2025-02-08 12:50:19,919 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@317e1612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:50:19, skipping insertion in model container [2025-02-08 12:50:19,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:50:19" (1/1) ... [2025-02-08 12:50:19,949 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 12:50:20,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 12:50:20,425 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 12:50:20,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 12:50:20,575 INFO L204 MainTranslator]: Completed translation [2025-02-08 12:50:20,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:50:20 WrapperNode [2025-02-08 12:50:20,577 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 12:50:20,578 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 12:50:20,578 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 12:50:20,578 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 12:50:20,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:50:20" (1/1) ... [2025-02-08 12:50:20,611 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:50:20" (1/1) ... [2025-02-08 12:50:20,633 INFO L138 Inliner]: procedures = 498, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 77 [2025-02-08 12:50:20,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 12:50:20,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 12:50:20,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 12:50:20,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 12:50:20,641 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:50:20" (1/1) ... [2025-02-08 12:50:20,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:50:20" (1/1) ... [2025-02-08 12:50:20,643 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:50:20" (1/1) ... [2025-02-08 12:50:20,658 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-02-08 12:50:20,662 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:50:20" (1/1) ... [2025-02-08 12:50:20,662 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:50:20" (1/1) ... [2025-02-08 12:50:20,665 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:50:20" (1/1) ... [2025-02-08 12:50:20,666 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:50:20" (1/1) ... [2025-02-08 12:50:20,667 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:50:20" (1/1) ... [2025-02-08 12:50:20,667 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:50:20" (1/1) ... [2025-02-08 12:50:20,673 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 12:50:20,677 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 12:50:20,677 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 12:50:20,677 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 12:50:20,678 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:50:20" (1/1) ... [2025-02-08 12:50:20,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 12:50:20,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 12:50:20,707 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 12:50:20,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 12:50:20,741 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-02-08 12:50:20,741 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-02-08 12:50:20,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 12:50:20,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 12:50:20,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 12:50:20,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 12:50:20,820 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 12:50:20,822 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 12:50:20,903 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-02-08 12:50:20,903 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 12:50:20,912 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 12:50:20,913 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 12:50:20,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:50:20 BoogieIcfgContainer [2025-02-08 12:50:20,913 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 12:50:20,916 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 12:50:20,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 12:50:20,920 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 12:50:20,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:50:19" (1/3) ... [2025-02-08 12:50:20,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f6efb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:50:20, skipping insertion in model container [2025-02-08 12:50:20,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:50:20" (2/3) ... [2025-02-08 12:50:20,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f6efb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:50:20, skipping insertion in model container [2025-02-08 12:50:20,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:50:20" (3/3) ... [2025-02-08 12:50:20,924 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fgets_postdec_17_bad.i [2025-02-08 12:50:20,937 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 12:50:20,939 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_fgets_postdec_17_bad.i that has 2 procedures, 28 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2025-02-08 12:50:20,988 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 12:50:21,003 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;@5a217b31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 12:50:21,006 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 12:50:21,010 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 17 states have (on average 1.588235294117647) internal successors, (27), 24 states have internal predecessors, (27), 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-02-08 12:50:21,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 12:50:21,022 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:50:21,023 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:50:21,024 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 12:50:21,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:50:21,032 INFO L85 PathProgramCache]: Analyzing trace with hash -723650022, now seen corresponding path program 1 times [2025-02-08 12:50:21,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:50:21,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369757924] [2025-02-08 12:50:21,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:50:21,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:50:21,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 12:50:21,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 12:50:21,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:50:21,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:50:21,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 12:50:21,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:50:21,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369757924] [2025-02-08 12:50:21,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369757924] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:50:21,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:50:21,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 12:50:21,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225170127] [2025-02-08 12:50:21,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:50:21,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 12:50:21,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:50:21,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 12:50:21,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:50:21,247 INFO L87 Difference]: Start difference. First operand has 28 states, 17 states have (on average 1.588235294117647) internal successors, (27), 24 states have internal predecessors, (27), 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 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 12:50:21,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:50:21,281 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2025-02-08 12:50:21,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 12:50:21,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 10 [2025-02-08 12:50:21,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:50:21,289 INFO L225 Difference]: With dead ends: 49 [2025-02-08 12:50:21,289 INFO L226 Difference]: Without dead ends: 28 [2025-02-08 12:50:21,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:50:21,293 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 3 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 59 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-02-08 12:50:21,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 59 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:50:21,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-08 12:50:21,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2025-02-08 12:50:21,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.5625) internal successors, (25), 22 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 12:50:21,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-02-08 12:50:21,328 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 10 [2025-02-08 12:50:21,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:50:21,328 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-02-08 12:50:21,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 12:50:21,328 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-02-08 12:50:21,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 12:50:21,332 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:50:21,333 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:50:21,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 12:50:21,333 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 12:50:21,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:50:21,336 INFO L85 PathProgramCache]: Analyzing trace with hash -958039119, now seen corresponding path program 1 times [2025-02-08 12:50:21,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:50:21,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890688178] [2025-02-08 12:50:21,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:50:21,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:50:21,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 12:50:21,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 12:50:21,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:50:21,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:50:21,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 12:50:21,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:50:21,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890688178] [2025-02-08 12:50:21,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890688178] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:50:21,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:50:21,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 12:50:21,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425286271] [2025-02-08 12:50:21,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:50:21,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 12:50:21,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:50:21,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 12:50:21,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 12:50:21,483 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. 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-02-08 12:50:21,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:50:21,519 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2025-02-08 12:50:21,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 12:50:21,521 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-02-08 12:50:21,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:50:21,522 INFO L225 Difference]: With dead ends: 32 [2025-02-08 12:50:21,522 INFO L226 Difference]: Without dead ends: 30 [2025-02-08 12:50:21,522 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-02-08 12:50:21,523 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:50:21,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 69 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:50:21,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-08 12:50:21,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-02-08 12:50:21,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.5) internal successors, (30), 27 states have internal predecessors, (30), 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-02-08 12:50:21,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2025-02-08 12:50:21,526 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 11 [2025-02-08 12:50:21,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:50:21,527 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-02-08 12:50:21,527 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-02-08 12:50:21,527 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2025-02-08 12:50:21,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 12:50:21,527 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:50:21,527 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:50:21,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 12:50:21,528 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 12:50:21,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:50:21,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1687675922, now seen corresponding path program 1 times [2025-02-08 12:50:21,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:50:21,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193728251] [2025-02-08 12:50:21,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:50:21,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:50:21,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 12:50:21,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 12:50:21,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:50:21,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 12:50:21,560 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 12:50:21,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 12:50:21,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 12:50:21,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:50:21,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 12:50:21,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 12:50:21,582 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 12:50:21,587 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-02-08 12:50:21,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-02-08 12:50:21,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-02-08 12:50:21,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-02-08 12:50:21,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-02-08 12:50:21,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-02-08 12:50:21,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 12:50:21,593 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 12:50:21,611 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 12:50:21,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:50:21 BoogieIcfgContainer [2025-02-08 12:50:21,613 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 12:50:21,614 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 12:50:21,614 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 12:50:21,615 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 12:50:21,615 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:50:20" (3/4) ... [2025-02-08 12:50:21,618 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 12:50:21,619 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 12:50:21,620 INFO L158 Benchmark]: Toolchain (without parser) took 1705.65ms. Allocated memory is still 142.6MB. Free memory was 108.3MB in the beginning and 56.4MB in the end (delta: 52.0MB). Peak memory consumption was 46.8MB. Max. memory is 16.1GB. [2025-02-08 12:50:21,620 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 12:50:21,620 INFO L158 Benchmark]: CACSL2BoogieTranslator took 662.11ms. Allocated memory is still 142.6MB. Free memory was 108.3MB in the beginning and 48.2MB in the end (delta: 60.2MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-02-08 12:50:21,620 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.27ms. Allocated memory is still 142.6MB. Free memory was 48.2MB in the beginning and 45.5MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 12:50:21,620 INFO L158 Benchmark]: Boogie Preprocessor took 41.11ms. Allocated memory is still 142.6MB. Free memory was 45.5MB in the beginning and 44.6MB in the end (delta: 876.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 12:50:21,620 INFO L158 Benchmark]: IcfgBuilder took 236.74ms. Allocated memory is still 142.6MB. Free memory was 44.6MB in the beginning and 99.3MB in the end (delta: -54.7MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2025-02-08 12:50:21,621 INFO L158 Benchmark]: TraceAbstraction took 698.09ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 57.1MB in the end (delta: 41.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 12:50:21,621 INFO L158 Benchmark]: Witness Printer took 4.78ms. Allocated memory is still 142.6MB. Free memory was 57.1MB in the beginning and 56.4MB in the end (delta: 763.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 12:50:21,622 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 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 662.11ms. Allocated memory is still 142.6MB. Free memory was 108.3MB in the beginning and 48.2MB in the end (delta: 60.2MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.27ms. Allocated memory is still 142.6MB. Free memory was 48.2MB in the beginning and 45.5MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.11ms. Allocated memory is still 142.6MB. Free memory was 45.5MB in the beginning and 44.6MB in the end (delta: 876.2kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 236.74ms. Allocated memory is still 142.6MB. Free memory was 44.6MB in the beginning and 99.3MB in the end (delta: -54.7MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * TraceAbstraction took 698.09ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 57.1MB in the end (delta: 41.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Witness Printer took 4.78ms. Allocated memory is still 142.6MB. Free memory was 57.1MB in the beginning and 56.4MB in the end (delta: 763.6kB). 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: 1570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1559, overapproximation of fgets at line 1557. 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); [L1579] CALL printLine("Calling bad()...") VAL [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) [L1579] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1580] CALL CWE191_Integer_Underflow__int_fgets_postdec_17_bad() [L1550] int i,j; [L1551] int data; [L1552] data = 0 [L1553] i = 0 VAL [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, i=0] [L1553] COND TRUE i < 1 [L1556] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [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, i=0] [L1557] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1559] data = atoi(inputBuffer) [L1553] i++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=1] [L1553] COND FALSE !(i < 1) [L1567] j = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1567] COND TRUE j < 1 [L1570] data-- VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] - UnprovableResult [Line: 1567]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1567]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: 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, 28 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 128 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23 IncrementalHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 57 mSDtfsCounter, 23 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=2, InterpolantAutomatonStates: 7, 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, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 29 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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-02-08 12:50:21,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_17_bad.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.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 bbc64fd25d0eb5fa31633a8c76dba801bfa80f4d9146ca588047e7c404032713 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 12:50:23,759 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 12:50:23,859 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2025-02-08 12:50:23,865 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 12:50:23,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 12:50:23,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2025-02-08 12:50:23,890 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 12:50:23,891 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 12:50:23,891 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 12:50:23,891 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 12:50:23,891 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 12:50:23,891 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 12:50:23,891 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 12:50:23,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 12:50:23,893 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 12:50:23,893 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 12:50:23,893 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 12:50:23,893 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 12:50:23,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 12:50:23,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 12:50:23,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 12:50:23,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 12:50:23,893 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 12:50:23,893 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 12:50:23,893 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 12:50:23,893 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 12:50:23,893 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 12:50:23,893 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 12:50:23,894 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 12:50:23,894 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 12:50:23,894 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 12:50:23,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 12:50:23,894 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 12:50:23,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 12:50:23,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 12:50:23,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 12:50:23,894 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 12:50:23,894 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 12:50:23,894 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 12:50:23,894 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 12:50:23,894 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 12:50:23,894 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 12:50:23,894 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 12:50:23,894 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 12:50:23,894 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 12:50:23,894 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 -> bbc64fd25d0eb5fa31633a8c76dba801bfa80f4d9146ca588047e7c404032713 [2025-02-08 12:50:24,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 12:50:24,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 12:50:24,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 12:50:24,223 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 12:50:24,223 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 12:50:24,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_17_bad.i [2025-02-08 12:50:25,531 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e449ed3ee/fd46abffb0cc4879be19bbb35d522939/FLAG8b181ae1b [2025-02-08 12:50:25,847 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 12:50:25,847 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_17_bad.i [2025-02-08 12:50:25,870 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e449ed3ee/fd46abffb0cc4879be19bbb35d522939/FLAG8b181ae1b [2025-02-08 12:50:25,879 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e449ed3ee/fd46abffb0cc4879be19bbb35d522939 [2025-02-08 12:50:25,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 12:50:25,883 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 12:50:25,885 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 12:50:25,885 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 12:50:25,888 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 12:50:25,888 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:50:25" (1/1) ... [2025-02-08 12:50:25,890 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5702711c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:50:25, skipping insertion in model container [2025-02-08 12:50:25,890 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:50:25" (1/1) ... [2025-02-08 12:50:25,914 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 12:50:26,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 12:50:26,410 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 12:50:26,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 12:50:26,611 INFO L204 MainTranslator]: Completed translation [2025-02-08 12:50:26,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:50:26 WrapperNode [2025-02-08 12:50:26,612 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 12:50:26,613 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 12:50:26,613 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 12:50:26,613 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 12:50:26,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:50:26" (1/1) ... [2025-02-08 12:50:26,636 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:50:26" (1/1) ... [2025-02-08 12:50:26,651 INFO L138 Inliner]: procedures = 503, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2025-02-08 12:50:26,652 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 12:50:26,652 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 12:50:26,652 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 12:50:26,652 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 12:50:26,658 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:50:26" (1/1) ... [2025-02-08 12:50:26,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:50:26" (1/1) ... [2025-02-08 12:50:26,660 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:50:26" (1/1) ... [2025-02-08 12:50:26,669 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-02-08 12:50:26,669 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:50:26" (1/1) ... [2025-02-08 12:50:26,673 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:50:26" (1/1) ... [2025-02-08 12:50:26,681 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:50:26" (1/1) ... [2025-02-08 12:50:26,682 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:50:26" (1/1) ... [2025-02-08 12:50:26,683 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:50:26" (1/1) ... [2025-02-08 12:50:26,684 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:50:26" (1/1) ... [2025-02-08 12:50:26,686 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 12:50:26,686 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 12:50:26,687 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 12:50:26,687 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 12:50:26,687 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:50:26" (1/1) ... [2025-02-08 12:50:26,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 12:50:26,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 12:50:26,714 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 12:50:26,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 12:50:26,730 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-02-08 12:50:26,730 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-02-08 12:50:26,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 12:50:26,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 12:50:26,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 12:50:26,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 12:50:26,835 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 12:50:26,838 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 12:50:26,960 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-02-08 12:50:26,961 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 12:50:26,970 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 12:50:26,971 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 12:50:26,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:50:26 BoogieIcfgContainer [2025-02-08 12:50:26,972 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 12:50:26,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 12:50:26,973 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 12:50:26,977 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 12:50:26,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:50:25" (1/3) ... [2025-02-08 12:50:26,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259a5f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:50:26, skipping insertion in model container [2025-02-08 12:50:26,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:50:26" (2/3) ... [2025-02-08 12:50:26,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259a5f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:50:26, skipping insertion in model container [2025-02-08 12:50:26,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:50:26" (3/3) ... [2025-02-08 12:50:26,980 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fgets_postdec_17_bad.i [2025-02-08 12:50:26,998 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 12:50:27,000 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_fgets_postdec_17_bad.i that has 2 procedures, 28 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2025-02-08 12:50:27,039 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 12:50:27,047 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;@213edbde, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 12:50:27,047 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 12:50:27,050 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 17 states have (on average 1.588235294117647) internal successors, (27), 24 states have internal predecessors, (27), 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-02-08 12:50:27,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 12:50:27,057 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:50:27,057 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:50:27,058 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 12:50:27,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:50:27,062 INFO L85 PathProgramCache]: Analyzing trace with hash -723650022, now seen corresponding path program 1 times [2025-02-08 12:50:27,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 12:50:27,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [385380500] [2025-02-08 12:50:27,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:50:27,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 12:50:27,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 12:50:27,076 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 12:50:27,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 12:50:27,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 12:50:27,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 12:50:27,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:50:27,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:50:27,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 12:50:27,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 12:50:27,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 12:50:27,204 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 12:50:27,205 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 12:50:27,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385380500] [2025-02-08 12:50:27,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385380500] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:50:27,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:50:27,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 12:50:27,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532230614] [2025-02-08 12:50:27,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:50:27,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 12:50:27,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 12:50:27,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 12:50:27,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 12:50:27,231 INFO L87 Difference]: Start difference. First operand has 28 states, 17 states have (on average 1.588235294117647) internal successors, (27), 24 states have internal predecessors, (27), 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 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 12:50:27,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:50:27,269 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2025-02-08 12:50:27,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 12:50:27,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 10 [2025-02-08 12:50:27,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:50:27,275 INFO L225 Difference]: With dead ends: 39 [2025-02-08 12:50:27,275 INFO L226 Difference]: Without dead ends: 31 [2025-02-08 12:50:27,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-02-08 12:50:27,284 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:50:27,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 83 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:50:27,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-08 12:50:27,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2025-02-08 12:50:27,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 25 states have internal predecessors, (31), 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-02-08 12:50:27,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2025-02-08 12:50:27,323 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 10 [2025-02-08 12:50:27,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:50:27,324 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2025-02-08 12:50:27,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 12:50:27,324 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2025-02-08 12:50:27,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 12:50:27,325 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:50:27,325 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:50:27,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 12:50:27,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 12:50:27,526 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 12:50:27,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:50:27,526 INFO L85 PathProgramCache]: Analyzing trace with hash 365558370, now seen corresponding path program 1 times [2025-02-08 12:50:27,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 12:50:27,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1583565903] [2025-02-08 12:50:27,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:50:27,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 12:50:27,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 12:50:27,532 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 12:50:27,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 12:50:27,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 12:50:27,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 12:50:27,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:50:27,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:50:27,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 12:50:27,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 12:50:27,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 12:50:27,655 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 12:50:27,655 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 12:50:27,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583565903] [2025-02-08 12:50:27,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583565903] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:50:27,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:50:27,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 12:50:27,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979853770] [2025-02-08 12:50:27,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:50:27,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 12:50:27,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 12:50:27,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 12:50:27,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 12:50:27,657 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 12:50:27,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:50:27,695 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2025-02-08 12:50:27,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 12:50:27,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-02-08 12:50:27,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:50:27,697 INFO L225 Difference]: With dead ends: 48 [2025-02-08 12:50:27,697 INFO L226 Difference]: Without dead ends: 38 [2025-02-08 12:50:27,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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-02-08 12:50:27,697 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:50:27,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 61 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:50:27,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-08 12:50:27,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-02-08 12:50:27,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 33 states have internal predecessors, (40), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 12:50:27,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2025-02-08 12:50:27,705 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 12 [2025-02-08 12:50:27,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:50:27,705 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2025-02-08 12:50:27,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 12:50:27,705 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2025-02-08 12:50:27,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 12:50:27,705 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:50:27,705 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:50:27,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 12:50:27,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 12:50:27,910 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 12:50:27,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:50:27,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1687675922, now seen corresponding path program 1 times [2025-02-08 12:50:27,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 12:50:27,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1967634569] [2025-02-08 12:50:27,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:50:27,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 12:50:27,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 12:50:27,918 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 12:50:27,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 12:50:27,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 12:50:28,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 12:50:28,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:50:28,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 12:50:28,003 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 12:50:28,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 12:50:28,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 12:50:28,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:50:28,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 12:50:28,046 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-08 12:50:28,047 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 12:50:28,048 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-02-08 12:50:28,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-02-08 12:50:28,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-02-08 12:50:28,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-02-08 12:50:28,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-02-08 12:50:28,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-02-08 12:50:28,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 12:50:28,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 12:50:28,254 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 12:50:28,271 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 12:50:28,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:50:28 BoogieIcfgContainer [2025-02-08 12:50:28,277 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 12:50:28,278 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 12:50:28,278 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 12:50:28,278 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 12:50:28,279 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:50:26" (3/4) ... [2025-02-08 12:50:28,280 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 12:50:28,281 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 12:50:28,286 INFO L158 Benchmark]: Toolchain (without parser) took 2398.75ms. Allocated memory is still 83.9MB. Free memory was 56.2MB in the beginning and 36.9MB in the end (delta: 19.2MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2025-02-08 12:50:28,286 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 83.9MB. Free memory was 63.0MB in the beginning and 63.0MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 12:50:28,286 INFO L158 Benchmark]: CACSL2BoogieTranslator took 727.71ms. Allocated memory is still 83.9MB. Free memory was 56.2MB in the beginning and 50.0MB in the end (delta: 6.1MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. [2025-02-08 12:50:28,286 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.02ms. Allocated memory is still 83.9MB. Free memory was 50.0MB in the beginning and 47.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 12:50:28,287 INFO L158 Benchmark]: Boogie Preprocessor took 33.69ms. Allocated memory is still 83.9MB. Free memory was 47.3MB in the beginning and 44.9MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 12:50:28,287 INFO L158 Benchmark]: IcfgBuilder took 285.43ms. Allocated memory is still 83.9MB. Free memory was 44.9MB in the beginning and 30.2MB in the end (delta: 14.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 12:50:28,287 INFO L158 Benchmark]: TraceAbstraction took 1304.09ms. Allocated memory is still 83.9MB. Free memory was 29.5MB in the beginning and 37.4MB in the end (delta: -7.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 12:50:28,287 INFO L158 Benchmark]: Witness Printer took 3.14ms. Allocated memory is still 83.9MB. Free memory was 36.9MB in the beginning and 36.9MB in the end (delta: 2.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 12:50:28,292 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.33ms. Allocated memory is still 83.9MB. Free memory was 63.0MB in the beginning and 63.0MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 727.71ms. Allocated memory is still 83.9MB. Free memory was 56.2MB in the beginning and 50.0MB in the end (delta: 6.1MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.02ms. Allocated memory is still 83.9MB. Free memory was 50.0MB in the beginning and 47.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.69ms. Allocated memory is still 83.9MB. Free memory was 47.3MB in the beginning and 44.9MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 285.43ms. Allocated memory is still 83.9MB. Free memory was 44.9MB in the beginning and 30.2MB in the end (delta: 14.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1304.09ms. Allocated memory is still 83.9MB. Free memory was 29.5MB in the beginning and 37.4MB in the end (delta: -7.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.14ms. Allocated memory is still 83.9MB. Free memory was 36.9MB in the beginning and 36.9MB in the end (delta: 2.8kB). 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: 1570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1559, overapproximation of fgets at line 1557. 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); [L1579] CALL printLine("Calling bad()...") VAL [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) [L1579] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1580] CALL CWE191_Integer_Underflow__int_fgets_postdec_17_bad() [L1550] int i,j; [L1551] int data; [L1552] data = 0 [L1553] i = 0 VAL [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, i=0] [L1553] COND TRUE i < 1 [L1556] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [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, i=0] [L1557] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1559] data = atoi(inputBuffer) [L1553] i++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=1] [L1553] COND FALSE !(i < 1) [L1567] j = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1567] COND TRUE j < 1 [L1570] data-- VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] - UnprovableResult [Line: 1567]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1567]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: 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, 28 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 144 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 91 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29 IncrementalHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 53 mSDtfsCounter, 29 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=2, InterpolantAutomatonStates: 8, 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, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 36 SizeOfPredicates, 0 NumberOfNonLiveVariables, 102 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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-02-08 12:50:28,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample