./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_13_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_13_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d2965ba2f95fa88a11de221781578b1346697c68ecd81d7cf3354351e788228d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 03:46:47,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 03:46:47,886 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 03:46:47,891 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 03:46:47,893 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 03:46:47,913 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 03:46:47,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 03:46:47,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 03:46:47,914 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 03:46:47,914 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 03:46:47,914 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 03:46:47,914 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 03:46:47,914 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 03:46:47,914 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 03:46:47,915 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 03:46:47,915 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 03:46:47,915 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 03:46:47,915 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 03:46:47,915 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 03:46:47,915 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 03:46:47,915 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 03:46:47,915 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 03:46:47,915 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 03:46:47,915 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 03:46:47,915 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 03:46:47,915 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 03:46:47,915 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 03:46:47,915 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 03:46:47,915 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 03:46:47,915 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 03:46:47,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 03:46:47,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 03:46:47,916 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 03:46:47,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 03:46:47,916 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 03:46:47,916 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 03:46:47,916 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 03:46:47,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 03:46:47,916 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 03:46:47,916 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 03:46:47,916 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 03:46:47,916 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 03:46:47,916 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d2965ba2f95fa88a11de221781578b1346697c68ecd81d7cf3354351e788228d [2025-03-09 03:46:48,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 03:46:48,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 03:46:48,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 03:46:48,144 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 03:46:48,144 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 03:46:48,145 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_13_bad.i [2025-03-09 03:46:49,270 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2ec7d087/d3f21b4d73514b2ba92ef18cf7c12d77/FLAG3fd67ca64 [2025-03-09 03:46:49,633 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 03:46:49,635 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_13_bad.i [2025-03-09 03:46:49,659 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2ec7d087/d3f21b4d73514b2ba92ef18cf7c12d77/FLAG3fd67ca64 [2025-03-09 03:46:49,828 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2ec7d087/d3f21b4d73514b2ba92ef18cf7c12d77 [2025-03-09 03:46:49,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 03:46:49,831 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 03:46:49,831 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 03:46:49,831 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 03:46:49,834 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 03:46:49,835 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 03:46:49" (1/1) ... [2025-03-09 03:46:49,837 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b9979ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:46:49, skipping insertion in model container [2025-03-09 03:46:49,837 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 03:46:49" (1/1) ... [2025-03-09 03:46:49,864 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 03:46:50,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 03:46:50,338 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 03:46:50,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 03:46:50,465 INFO L204 MainTranslator]: Completed translation [2025-03-09 03:46:50,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:46:50 WrapperNode [2025-03-09 03:46:50,465 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 03:46:50,466 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 03:46:50,466 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 03:46:50,466 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 03:46:50,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:46:50" (1/1) ... [2025-03-09 03:46:50,490 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:46:50" (1/1) ... [2025-03-09 03:46:50,503 INFO L138 Inliner]: procedures = 498, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2025-03-09 03:46:50,504 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 03:46:50,504 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 03:46:50,504 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 03:46:50,504 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 03:46:50,510 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:46:50" (1/1) ... [2025-03-09 03:46:50,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:46:50" (1/1) ... [2025-03-09 03:46:50,515 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:46:50" (1/1) ... [2025-03-09 03:46:50,524 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2025-03-09 03:46:50,525 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:46:50" (1/1) ... [2025-03-09 03:46:50,525 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:46:50" (1/1) ... [2025-03-09 03:46:50,528 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:46:50" (1/1) ... [2025-03-09 03:46:50,528 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:46:50" (1/1) ... [2025-03-09 03:46:50,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:46:50" (1/1) ... [2025-03-09 03:46:50,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:46:50" (1/1) ... [2025-03-09 03:46:50,531 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 03:46:50,532 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 03:46:50,532 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 03:46:50,532 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 03:46:50,532 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:46:50" (1/1) ... [2025-03-09 03:46:50,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 03:46:50,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 03:46:50,559 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 03:46:50,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 03:46:50,576 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-09 03:46:50,577 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-09 03:46:50,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 03:46:50,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 03:46:50,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 03:46:50,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 03:46:50,691 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 03:46:50,693 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 03:46:50,774 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-09 03:46:50,774 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 03:46:50,781 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 03:46:50,782 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 03:46:50,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:46:50 BoogieIcfgContainer [2025-03-09 03:46:50,782 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 03:46:50,783 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 03:46:50,783 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 03:46:50,786 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 03:46:50,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 03:46:49" (1/3) ... [2025-03-09 03:46:50,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5adaee3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 03:46:50, skipping insertion in model container [2025-03-09 03:46:50,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:46:50" (2/3) ... [2025-03-09 03:46:50,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5adaee3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 03:46:50, skipping insertion in model container [2025-03-09 03:46:50,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:46:50" (3/3) ... [2025-03-09 03:46:50,788 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_add_13_bad.i [2025-03-09 03:46:50,801 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 03:46:50,803 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fgets_add_13_bad.i that has 2 procedures, 24 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-09 03:46:50,841 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 03:46:50,851 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;@22a28625, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 03:46:50,852 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-09 03:46:50,855 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 03:46:50,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-09 03:46:50,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:46:50,860 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 03:46:50,861 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-09 03:46:50,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:46:50,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1138838200, now seen corresponding path program 1 times [2025-03-09 03:46:50,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 03:46:50,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490787622] [2025-03-09 03:46:50,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:46:50,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 03:46:50,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 03:46:50,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 03:46:50,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:46:50,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:46:51,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 03:46:51,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 03:46:51,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490787622] [2025-03-09 03:46:51,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490787622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:46:51,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:46:51,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 03:46:51,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275688796] [2025-03-09 03:46:51,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:46:51,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 03:46:51,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 03:46:51,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 03:46:51,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 03:46:51,093 INFO L87 Difference]: Start difference. First operand has 24 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 20 states have internal predecessors, (23), 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 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 03:46:51,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:46:51,114 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2025-03-09 03:46:51,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 03:46:51,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-03-09 03:46:51,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:46:51,127 INFO L225 Difference]: With dead ends: 40 [2025-03-09 03:46:51,128 INFO L226 Difference]: Without dead ends: 17 [2025-03-09 03:46:51,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 03:46:51,133 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:46:51,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 25 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:46:51,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-03-09 03:46:51,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-09 03:46:51,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 03:46:51,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2025-03-09 03:46:51,158 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2025-03-09 03:46:51,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:46:51,158 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2025-03-09 03:46:51,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 03:46:51,159 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2025-03-09 03:46:51,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 03:46:51,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:46:51,159 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 03:46:51,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 03:46:51,161 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-09 03:46:51,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:46:51,162 INFO L85 PathProgramCache]: Analyzing trace with hash -793981098, now seen corresponding path program 1 times [2025-03-09 03:46:51,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 03:46:51,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064617682] [2025-03-09 03:46:51,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:46:51,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 03:46:51,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 03:46:51,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 03:46:51,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:46:51,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:46:51,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 03:46:51,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 03:46:51,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064617682] [2025-03-09 03:46:51,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064617682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:46:51,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:46:51,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 03:46:51,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747749902] [2025-03-09 03:46:51,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:46:51,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 03:46:51,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 03:46:51,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 03:46:51,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 03:46:51,276 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 03:46:51,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:46:51,282 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2025-03-09 03:46:51,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 03:46:51,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-03-09 03:46:51,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:46:51,283 INFO L225 Difference]: With dead ends: 17 [2025-03-09 03:46:51,283 INFO L226 Difference]: Without dead ends: 16 [2025-03-09 03:46:51,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 03:46:51,284 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 3 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:46:51,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 25 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:46:51,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-09 03:46:51,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-09 03:46:51,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 03:46:51,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2025-03-09 03:46:51,287 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2025-03-09 03:46:51,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:46:51,287 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2025-03-09 03:46:51,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 03:46:51,288 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2025-03-09 03:46:51,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-09 03:46:51,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:46:51,288 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 03:46:51,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 03:46:51,288 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-09 03:46:51,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:46:51,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1156389718, now seen corresponding path program 1 times [2025-03-09 03:46:51,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 03:46:51,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523366424] [2025-03-09 03:46:51,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:46:51,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 03:46:51,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 03:46:51,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 03:46:51,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:46:51,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 03:46:51,314 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 03:46:51,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 03:46:51,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 03:46:51,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:46:51,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 03:46:51,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 03:46:51,345 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 03:46:51,346 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2025-03-09 03:46:51,347 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2025-03-09 03:46:51,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 03:46:51,349 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-09 03:46:51,364 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 03:46:51,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 03:46:51 BoogieIcfgContainer [2025-03-09 03:46:51,367 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 03:46:51,368 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 03:46:51,368 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 03:46:51,368 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 03:46:51,373 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:46:50" (3/4) ... [2025-03-09 03:46:51,374 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 03:46:51,375 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 03:46:51,375 INFO L158 Benchmark]: Toolchain (without parser) took 1544.70ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 62.7MB in the end (delta: 47.8MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. [2025-03-09 03:46:51,375 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:46:51,376 INFO L158 Benchmark]: CACSL2BoogieTranslator took 634.18ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 51.0MB in the end (delta: 59.4MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-09 03:46:51,376 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.59ms. Allocated memory is still 142.6MB. Free memory was 51.0MB in the beginning and 48.7MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 03:46:51,376 INFO L158 Benchmark]: Boogie Preprocessor took 26.91ms. Allocated memory is still 142.6MB. Free memory was 48.7MB in the beginning and 47.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:46:51,376 INFO L158 Benchmark]: IcfgBuilder took 250.70ms. Allocated memory is still 142.6MB. Free memory was 47.2MB in the beginning and 102.4MB in the end (delta: -55.3MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2025-03-09 03:46:51,376 INFO L158 Benchmark]: TraceAbstraction took 583.88ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 63.4MB in the end (delta: 38.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-09 03:46:51,376 INFO L158 Benchmark]: Witness Printer took 7.03ms. Allocated memory is still 142.6MB. Free memory was 63.4MB in the beginning and 62.7MB in the end (delta: 778.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:46:51,377 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.20ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 634.18ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 51.0MB in the end (delta: 59.4MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.59ms. Allocated memory is still 142.6MB. Free memory was 51.0MB in the beginning and 48.7MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.91ms. Allocated memory is still 142.6MB. Free memory was 48.7MB in the beginning and 47.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 250.70ms. Allocated memory is still 142.6MB. Free memory was 47.2MB in the beginning and 102.4MB in the end (delta: -55.3MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. * TraceAbstraction took 583.88ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 63.4MB in the end (delta: 38.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Witness Printer took 7.03ms. Allocated memory is still 142.6MB. Free memory was 63.4MB in the beginning and 62.7MB in the end (delta: 778.0kB). 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: 1569]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1558, overapproximation of fgets at line 1556. 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); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1577] 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) [L1577] 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] [L1578] CALL CWE190_Integer_Overflow__int_fgets_add_13_bad() [L1550] int data; [L1551] data = 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] [L1552] COND TRUE GLOBAL_CONST_FIVE==5 [L1555] 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] [L1556] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1558] data = atoi(inputBuffer) [L1566] COND TRUE GLOBAL_CONST_FIVE==5 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1569] data + 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1569]: 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, 24 locations, 32 edges, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26 mSDsluCounter, 50 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 41 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=0, InterpolantAutomatonStates: 6, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 42 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-03-09 03:46:51,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_13_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d2965ba2f95fa88a11de221781578b1346697c68ecd81d7cf3354351e788228d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 03:46:53,267 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 03:46:53,344 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2025-03-09 03:46:53,350 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 03:46:53,350 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 03:46:53,350 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2025-03-09 03:46:53,377 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 03:46:53,377 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 03:46:53,377 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 03:46:53,378 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 03:46:53,378 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 03:46:53,378 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 03:46:53,378 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 03:46:53,378 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 03:46:53,378 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 03:46:53,378 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 03:46:53,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 03:46:53,379 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 03:46:53,379 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 03:46:53,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 03:46:53,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 03:46:53,379 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 03:46:53,380 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 03:46:53,380 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-09 03:46:53,380 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 03:46:53,380 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-09 03:46:53,380 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 03:46:53,380 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 03:46:53,380 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 03:46:53,380 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 03:46:53,380 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 03:46:53,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 03:46:53,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 03:46:53,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 03:46:53,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 03:46:53,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 03:46:53,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 03:46:53,380 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 03:46:53,380 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 03:46:53,380 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-09 03:46:53,380 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-09 03:46:53,380 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 03:46:53,380 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 03:46:53,381 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 03:46:53,381 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 03:46:53,381 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d2965ba2f95fa88a11de221781578b1346697c68ecd81d7cf3354351e788228d [2025-03-09 03:46:53,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 03:46:53,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 03:46:53,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 03:46:53,628 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 03:46:53,628 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 03:46:53,630 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_13_bad.i [2025-03-09 03:46:54,748 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f63a32819/0903c222398d44dc96a9208b0383fa43/FLAG2ca1d9361 [2025-03-09 03:46:55,052 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 03:46:55,053 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_13_bad.i [2025-03-09 03:46:55,075 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f63a32819/0903c222398d44dc96a9208b0383fa43/FLAG2ca1d9361 [2025-03-09 03:46:55,090 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f63a32819/0903c222398d44dc96a9208b0383fa43 [2025-03-09 03:46:55,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 03:46:55,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 03:46:55,095 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 03:46:55,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 03:46:55,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 03:46:55,099 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 03:46:55" (1/1) ... [2025-03-09 03:46:55,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c79becb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:46:55, skipping insertion in model container [2025-03-09 03:46:55,101 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 03:46:55" (1/1) ... [2025-03-09 03:46:55,136 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 03:46:55,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 03:46:55,640 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 03:46:55,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 03:46:55,820 INFO L204 MainTranslator]: Completed translation [2025-03-09 03:46:55,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:46:55 WrapperNode [2025-03-09 03:46:55,821 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 03:46:55,821 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 03:46:55,822 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 03:46:55,822 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 03:46:55,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:46:55" (1/1) ... [2025-03-09 03:46:55,846 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:46:55" (1/1) ... [2025-03-09 03:46:55,859 INFO L138 Inliner]: procedures = 503, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 59 [2025-03-09 03:46:55,859 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 03:46:55,859 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 03:46:55,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 03:46:55,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 03:46:55,865 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:46:55" (1/1) ... [2025-03-09 03:46:55,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:46:55" (1/1) ... [2025-03-09 03:46:55,870 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:46:55" (1/1) ... [2025-03-09 03:46:55,881 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2025-03-09 03:46:55,881 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:46:55" (1/1) ... [2025-03-09 03:46:55,881 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:46:55" (1/1) ... [2025-03-09 03:46:55,885 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:46:55" (1/1) ... [2025-03-09 03:46:55,886 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:46:55" (1/1) ... [2025-03-09 03:46:55,887 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:46:55" (1/1) ... [2025-03-09 03:46:55,888 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:46:55" (1/1) ... [2025-03-09 03:46:55,890 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 03:46:55,890 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 03:46:55,891 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 03:46:55,891 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 03:46:55,891 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:46:55" (1/1) ... [2025-03-09 03:46:55,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 03:46:55,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 03:46:55,919 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 03:46:55,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 03:46:55,941 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-09 03:46:55,942 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-09 03:46:55,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-09 03:46:55,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 03:46:55,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 03:46:55,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 03:46:56,046 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 03:46:56,048 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 03:46:56,147 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-09 03:46:56,147 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 03:46:56,154 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 03:46:56,154 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 03:46:56,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:46:56 BoogieIcfgContainer [2025-03-09 03:46:56,154 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 03:46:56,156 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 03:46:56,156 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 03:46:56,159 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 03:46:56,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 03:46:55" (1/3) ... [2025-03-09 03:46:56,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a1a241e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 03:46:56, skipping insertion in model container [2025-03-09 03:46:56,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:46:55" (2/3) ... [2025-03-09 03:46:56,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a1a241e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 03:46:56, skipping insertion in model container [2025-03-09 03:46:56,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:46:56" (3/3) ... [2025-03-09 03:46:56,163 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_add_13_bad.i [2025-03-09 03:46:56,173 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 03:46:56,174 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fgets_add_13_bad.i that has 2 procedures, 24 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-09 03:46:56,215 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 03:46:56,223 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;@43815022, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 03:46:56,224 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-09 03:46:56,228 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 03:46:56,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-09 03:46:56,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:46:56,233 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 03:46:56,233 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-09 03:46:56,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:46:56,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1138838200, now seen corresponding path program 1 times [2025-03-09 03:46:56,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 03:46:56,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1881745620] [2025-03-09 03:46:56,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:46:56,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 03:46:56,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 03:46:56,252 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 03:46:56,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 03:46:56,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 03:46:56,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 03:46:56,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:46:56,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:46:56,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-09 03:46:56,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 03:46:56,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 03:46:56,357 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 03:46:56,357 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 03:46:56,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881745620] [2025-03-09 03:46:56,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881745620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:46:56,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:46:56,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 03:46:56,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200108976] [2025-03-09 03:46:56,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:46:56,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 03:46:56,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 03:46:56,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 03:46:56,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 03:46:56,381 INFO L87 Difference]: Start difference. First operand has 24 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 03:46:56,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:46:56,406 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2025-03-09 03:46:56,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 03:46:56,408 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-03-09 03:46:56,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:46:56,412 INFO L225 Difference]: With dead ends: 24 [2025-03-09 03:46:56,413 INFO L226 Difference]: Without dead ends: 16 [2025-03-09 03:46:56,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 03:46:56,419 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:46:56,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:46:56,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-09 03:46:56,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-09 03:46:56,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 03:46:56,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2025-03-09 03:46:56,446 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 11 [2025-03-09 03:46:56,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:46:56,447 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2025-03-09 03:46:56,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 03:46:56,447 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2025-03-09 03:46:56,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 03:46:56,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:46:56,449 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 03:46:56,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 03:46:56,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 03:46:56,650 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-09 03:46:56,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:46:56,650 INFO L85 PathProgramCache]: Analyzing trace with hash 944245812, now seen corresponding path program 1 times [2025-03-09 03:46:56,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 03:46:56,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [162334310] [2025-03-09 03:46:56,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:46:56,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 03:46:56,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 03:46:56,652 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 03:46:56,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 03:46:56,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 03:46:56,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 03:46:56,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:46:56,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:46:56,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 03:46:56,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 03:46:56,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 03:46:56,735 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 03:46:56,735 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 03:46:56,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162334310] [2025-03-09 03:46:56,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162334310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:46:56,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:46:56,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 03:46:56,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698671113] [2025-03-09 03:46:56,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:46:56,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 03:46:56,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 03:46:56,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 03:46:56,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 03:46:56,738 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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-03-09 03:46:56,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:46:56,747 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2025-03-09 03:46:56,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 03:46:56,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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-03-09 03:46:56,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:46:56,748 INFO L225 Difference]: With dead ends: 20 [2025-03-09 03:46:56,748 INFO L226 Difference]: Without dead ends: 16 [2025-03-09 03:46:56,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 03:46:56,749 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:46:56,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 16 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:46:56,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-09 03:46:56,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-09 03:46:56,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 03:46:56,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2025-03-09 03:46:56,752 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2025-03-09 03:46:56,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:46:56,753 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2025-03-09 03:46:56,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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-03-09 03:46:56,753 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2025-03-09 03:46:56,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-09 03:46:56,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:46:56,753 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 03:46:56,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 03:46:56,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 03:46:56,954 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-09 03:46:56,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:46:56,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1156389718, now seen corresponding path program 1 times [2025-03-09 03:46:56,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 03:46:56,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1094953248] [2025-03-09 03:46:56,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:46:56,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 03:46:56,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 03:46:56,958 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 03:46:56,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 03:46:57,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 03:46:57,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 03:46:57,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:46:57,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 03:46:57,018 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 03:46:57,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 03:46:57,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 03:46:57,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:46:57,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 03:46:57,044 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-09 03:46:57,044 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 03:46:57,045 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2025-03-09 03:46:57,047 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2025-03-09 03:46:57,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 03:46:57,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 03:46:57,251 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-09 03:46:57,265 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 03:46:57,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 03:46:57 BoogieIcfgContainer [2025-03-09 03:46:57,267 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 03:46:57,267 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 03:46:57,267 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 03:46:57,267 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 03:46:57,268 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:46:56" (3/4) ... [2025-03-09 03:46:57,269 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 03:46:57,270 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 03:46:57,270 INFO L158 Benchmark]: Toolchain (without parser) took 2176.90ms. Allocated memory is still 117.4MB. Free memory was 89.7MB in the beginning and 65.1MB in the end (delta: 24.6MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2025-03-09 03:46:57,271 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 83.9MB. Free memory was 63.0MB in the beginning and 62.9MB in the end (delta: 37.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:46:57,271 INFO L158 Benchmark]: CACSL2BoogieTranslator took 726.04ms. Allocated memory is still 117.4MB. Free memory was 89.7MB in the beginning and 78.5MB in the end (delta: 11.1MB). Peak memory consumption was 66.5MB. Max. memory is 16.1GB. [2025-03-09 03:46:57,271 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.63ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 76.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:46:57,271 INFO L158 Benchmark]: Boogie Preprocessor took 30.46ms. Allocated memory is still 117.4MB. Free memory was 76.2MB in the beginning and 73.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:46:57,272 INFO L158 Benchmark]: IcfgBuilder took 263.81ms. Allocated memory is still 117.4MB. Free memory was 73.9MB in the beginning and 60.4MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 03:46:57,272 INFO L158 Benchmark]: TraceAbstraction took 1110.95ms. Allocated memory is still 117.4MB. Free memory was 59.6MB in the beginning and 65.7MB in the end (delta: -6.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:46:57,272 INFO L158 Benchmark]: Witness Printer took 2.86ms. Allocated memory is still 117.4MB. Free memory was 65.1MB in the beginning and 65.1MB in the end (delta: 10.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:46:57,273 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.49ms. Allocated memory is still 83.9MB. Free memory was 63.0MB in the beginning and 62.9MB in the end (delta: 37.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 726.04ms. Allocated memory is still 117.4MB. Free memory was 89.7MB in the beginning and 78.5MB in the end (delta: 11.1MB). Peak memory consumption was 66.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.63ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 76.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.46ms. Allocated memory is still 117.4MB. Free memory was 76.2MB in the beginning and 73.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 263.81ms. Allocated memory is still 117.4MB. Free memory was 73.9MB in the beginning and 60.4MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1110.95ms. Allocated memory is still 117.4MB. Free memory was 59.6MB in the beginning and 65.7MB in the end (delta: -6.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.86ms. Allocated memory is still 117.4MB. Free memory was 65.1MB in the beginning and 65.1MB in the end (delta: 10.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: 1569]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1558, overapproximation of fgets at line 1556. 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); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1577] 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) [L1577] 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] [L1578] CALL CWE190_Integer_Overflow__int_fgets_add_13_bad() [L1550] int data; [L1551] data = 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] [L1552] COND TRUE GLOBAL_CONST_FIVE==5 [L1555] 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] [L1556] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1558] data = atoi(inputBuffer) [L1566] COND TRUE GLOBAL_CONST_FIVE==5 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1569] data + 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1569]: 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, 24 locations, 32 edges, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, 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, 10 mSDsluCounter, 44 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 44 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 37 SizeOfPredicates, 0 NumberOfNonLiveVariables, 81 ConjunctsInSsa, 3 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-03-09 03:46:57,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample