./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_12_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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_12_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 f9ab0f28220d4c56d024e1d051466cfff21d1d545d8edb81faa19718425e9629 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 16:49:44,993 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 16:49:45,048 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-17 16:49:45,055 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 16:49:45,055 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 16:49:45,076 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 16:49:45,078 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 16:49:45,078 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 16:49:45,079 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 16:49:45,079 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 16:49:45,079 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 16:49:45,079 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 16:49:45,080 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 16:49:45,080 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 16:49:45,080 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 16:49:45,083 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 16:49:45,084 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 16:49:45,084 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 16:49:45,084 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 16:49:45,084 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 16:49:45,084 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 16:49:45,084 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 16:49:45,084 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 16:49:45,084 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 16:49:45,084 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 16:49:45,084 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 16:49:45,084 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 16:49:45,084 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 16:49:45,084 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 16:49:45,084 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 16:49:45,084 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 16:49:45,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 16:49:45,084 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 16:49:45,084 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 16:49:45,084 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 16:49:45,084 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 16:49:45,084 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 16:49:45,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 16:49:45,085 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 16:49:45,085 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 16:49:45,085 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 16:49:45,085 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 16:49:45,085 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 -> f9ab0f28220d4c56d024e1d051466cfff21d1d545d8edb81faa19718425e9629 [2025-03-17 16:49:45,348 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 16:49:45,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 16:49:45,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 16:49:45,358 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 16:49:45,358 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 16:49:45,359 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_12_bad.i [2025-03-17 16:49:46,511 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e9f36514/560abe2896814b548310834a5cefd61e/FLAG426c2726f [2025-03-17 16:49:46,914 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 16:49:46,915 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_12_bad.i [2025-03-17 16:49:46,929 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e9f36514/560abe2896814b548310834a5cefd61e/FLAG426c2726f [2025-03-17 16:49:47,092 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e9f36514/560abe2896814b548310834a5cefd61e [2025-03-17 16:49:47,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 16:49:47,095 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 16:49:47,096 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 16:49:47,096 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 16:49:47,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 16:49:47,099 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:49:47" (1/1) ... [2025-03-17 16:49:47,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55ff7da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:49:47, skipping insertion in model container [2025-03-17 16:49:47,100 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:49:47" (1/1) ... [2025-03-17 16:49:47,132 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 16:49:47,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 16:49:47,696 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 16:49:47,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 16:49:47,844 INFO L204 MainTranslator]: Completed translation [2025-03-17 16:49:47,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:49:47 WrapperNode [2025-03-17 16:49:47,847 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 16:49:47,847 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 16:49:47,848 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 16:49:47,848 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 16:49:47,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:49:47" (1/1) ... [2025-03-17 16:49:47,863 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:49:47" (1/1) ... [2025-03-17 16:49:47,875 INFO L138 Inliner]: procedures = 498, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2025-03-17 16:49:47,876 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 16:49:47,876 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 16:49:47,876 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 16:49:47,877 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 16:49:47,882 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:49:47" (1/1) ... [2025-03-17 16:49:47,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:49:47" (1/1) ... [2025-03-17 16:49:47,884 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:49:47" (1/1) ... [2025-03-17 16:49:47,900 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-17 16:49:47,901 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:49:47" (1/1) ... [2025-03-17 16:49:47,901 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:49:47" (1/1) ... [2025-03-17 16:49:47,904 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:49:47" (1/1) ... [2025-03-17 16:49:47,904 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:49:47" (1/1) ... [2025-03-17 16:49:47,911 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:49:47" (1/1) ... [2025-03-17 16:49:47,912 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:49:47" (1/1) ... [2025-03-17 16:49:47,913 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 16:49:47,918 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 16:49:47,918 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 16:49:47,918 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 16:49:47,919 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:49:47" (1/1) ... [2025-03-17 16:49:47,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 16:49:47,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 16:49:47,943 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-17 16:49:47,945 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-17 16:49:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-17 16:49:47,961 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-17 16:49:47,961 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2025-03-17 16:49:47,961 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2025-03-17 16:49:47,961 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-17 16:49:47,961 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-17 16:49:47,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 16:49:47,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 16:49:47,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 16:49:47,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 16:49:48,069 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 16:49:48,070 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 16:49:48,119 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1520: havoc #t~nondet87; [2025-03-17 16:49:48,239 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-17 16:49:48,240 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 16:49:48,248 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 16:49:48,248 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 16:49:48,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:49:48 BoogieIcfgContainer [2025-03-17 16:49:48,248 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 16:49:48,250 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 16:49:48,250 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 16:49:48,254 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 16:49:48,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:49:47" (1/3) ... [2025-03-17 16:49:48,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af0e0f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:49:48, skipping insertion in model container [2025-03-17 16:49:48,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:49:47" (2/3) ... [2025-03-17 16:49:48,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af0e0f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:49:48, skipping insertion in model container [2025-03-17 16:49:48,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:49:48" (3/3) ... [2025-03-17 16:49:48,256 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_add_12_bad.i [2025-03-17 16:49:48,268 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 16:49:48,270 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fgets_add_12_bad.i that has 4 procedures, 41 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-17 16:49:48,309 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 16:49:48,318 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;@4b1451f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 16:49:48,318 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-17 16:49:48,322 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 25 states have (on average 1.36) internal successors, (34), 31 states have internal predecessors, (34), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 16:49:48,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 16:49:48,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:49:48,328 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 16:49:48,329 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 16:49:48,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:49:48,334 INFO L85 PathProgramCache]: Analyzing trace with hash -784742052, now seen corresponding path program 1 times [2025-03-17 16:49:48,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:49:48,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465923816] [2025-03-17 16:49:48,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:49:48,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:49:48,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 16:49:48,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 16:49:48,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:49:48,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:49:48,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 16:49:48,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:49:48,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465923816] [2025-03-17 16:49:48,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465923816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:49:48,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 16:49:48,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 16:49:48,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99884376] [2025-03-17 16:49:48,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:49:48,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 16:49:48,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:49:48,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 16:49:48,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 16:49:48,574 INFO L87 Difference]: Start difference. First operand has 41 states, 25 states have (on average 1.36) internal successors, (34), 31 states have internal predecessors, (34), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 16:49:48,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:49:48,624 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2025-03-17 16:49:48,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 16:49:48,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2025-03-17 16:49:48,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:49:48,629 INFO L225 Difference]: With dead ends: 63 [2025-03-17 16:49:48,630 INFO L226 Difference]: Without dead ends: 28 [2025-03-17 16:49:48,632 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-17 16:49:48,635 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 16:49:48,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 90 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:49:48,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-17 16:49:48,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-17 16:49:48,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 16:49:48,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2025-03-17 16:49:48,678 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 20 [2025-03-17 16:49:48,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:49:48,679 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2025-03-17 16:49:48,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 16:49:48,679 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2025-03-17 16:49:48,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 16:49:48,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:49:48,681 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 16:49:48,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 16:49:48,681 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 16:49:48,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:49:48,682 INFO L85 PathProgramCache]: Analyzing trace with hash -58855586, now seen corresponding path program 1 times [2025-03-17 16:49:48,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:49:48,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376080210] [2025-03-17 16:49:48,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:49:48,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:49:48,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 16:49:48,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 16:49:48,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:49:48,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:49:48,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 16:49:48,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:49:48,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376080210] [2025-03-17 16:49:48,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376080210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:49:48,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 16:49:48,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 16:49:48,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309549531] [2025-03-17 16:49:48,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:49:48,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 16:49:48,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:49:48,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 16:49:48,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 16:49:48,784 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 16:49:48,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:49:48,801 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2025-03-17 16:49:48,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 16:49:48,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2025-03-17 16:49:48,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:49:48,803 INFO L225 Difference]: With dead ends: 28 [2025-03-17 16:49:48,803 INFO L226 Difference]: Without dead ends: 26 [2025-03-17 16:49:48,804 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-17 16:49:48,804 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 16:49:48,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 36 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:49:48,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-17 16:49:48,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-17 16:49:48,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 16:49:48,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2025-03-17 16:49:48,808 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 22 [2025-03-17 16:49:48,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:49:48,808 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2025-03-17 16:49:48,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 16:49:48,808 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2025-03-17 16:49:48,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 16:49:48,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:49:48,809 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 16:49:48,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 16:49:48,809 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 16:49:48,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:49:48,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1824523182, now seen corresponding path program 1 times [2025-03-17 16:49:48,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:49:48,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409256987] [2025-03-17 16:49:48,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:49:48,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:49:48,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 16:49:48,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 16:49:48,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:49:48,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 16:49:48,838 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 16:49:48,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 16:49:48,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 16:49:48,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:49:48,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 16:49:48,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 16:49:48,866 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 16:49:48,867 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-03-17 16:49:48,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-03-17 16:49:48,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-03-17 16:49:48,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-03-17 16:49:48,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 16:49:48,872 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 16:49:48,893 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 16:49:48,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:49:48 BoogieIcfgContainer [2025-03-17 16:49:48,896 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 16:49:48,897 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 16:49:48,897 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 16:49:48,898 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 16:49:48,899 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:49:48" (3/4) ... [2025-03-17 16:49:48,901 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 16:49:48,902 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 16:49:48,902 INFO L158 Benchmark]: Toolchain (without parser) took 1807.59ms. Allocated memory is still 201.3MB. Free memory was 151.4MB in the beginning and 125.3MB in the end (delta: 26.1MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2025-03-17 16:49:48,902 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 16:49:48,902 INFO L158 Benchmark]: CACSL2BoogieTranslator took 751.46ms. Allocated memory is still 201.3MB. Free memory was 151.4MB in the beginning and 93.0MB in the end (delta: 58.4MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-17 16:49:48,903 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.53ms. Allocated memory is still 201.3MB. Free memory was 93.0MB in the beginning and 90.2MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 16:49:48,903 INFO L158 Benchmark]: Boogie Preprocessor took 36.78ms. Allocated memory is still 201.3MB. Free memory was 90.2MB in the beginning and 88.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 16:49:48,903 INFO L158 Benchmark]: IcfgBuilder took 330.84ms. Allocated memory is still 201.3MB. Free memory was 88.7MB in the beginning and 73.8MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 16:49:48,903 INFO L158 Benchmark]: TraceAbstraction took 646.48ms. Allocated memory is still 201.3MB. Free memory was 73.1MB in the beginning and 125.4MB in the end (delta: -52.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 16:49:48,903 INFO L158 Benchmark]: Witness Printer took 4.70ms. Allocated memory is still 201.3MB. Free memory was 125.4MB in the beginning and 125.3MB in the end (delta: 60.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 16:49:48,904 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 118.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 751.46ms. Allocated memory is still 201.3MB. Free memory was 151.4MB in the beginning and 93.0MB in the end (delta: 58.4MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.53ms. Allocated memory is still 201.3MB. Free memory was 93.0MB in the beginning and 90.2MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.78ms. Allocated memory is still 201.3MB. Free memory was 90.2MB in the beginning and 88.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 330.84ms. Allocated memory is still 201.3MB. Free memory was 88.7MB in the beginning and 73.8MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 646.48ms. Allocated memory is still 201.3MB. Free memory was 73.1MB in the beginning and 125.4MB in the end (delta: -52.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.70ms. Allocated memory is still 201.3MB. Free memory was 125.4MB in the beginning and 125.3MB in the end (delta: 60.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1573]: 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); [L1593] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={4:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1593] 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] [L1594] CALL CWE190_Integer_Overflow__int_fgets_add_12_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] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1552] RET globalReturnsTrueOrFalse() 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 globalReturnsTrueOrFalse() [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) [L1570] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1570] RET globalReturnsTrueOrFalse() 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] [L1570] COND TRUE globalReturnsTrueOrFalse() [L1573] 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: 1573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1581]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1581]: 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 4 procedures, 41 locations, 58 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 126 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 78 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred 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.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 65 NumberOfCodeBlocks, 65 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 40 ConstructedInterpolants, 0 QuantifiedInterpolants, 68 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 6/6 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-17 16:49:48,917 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_12_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 f9ab0f28220d4c56d024e1d051466cfff21d1d545d8edb81faa19718425e9629 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 16:49:50,828 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 16:49:50,925 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2025-03-17 16:49:50,943 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 16:49:50,943 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 16:49:50,944 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2025-03-17 16:49:50,967 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 16:49:50,968 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 16:49:50,968 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 16:49:50,969 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 16:49:50,969 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 16:49:50,969 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 16:49:50,970 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 16:49:50,970 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 16:49:50,970 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 16:49:50,970 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 16:49:50,970 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 16:49:50,971 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 16:49:50,971 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 16:49:50,971 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 16:49:50,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 16:49:50,971 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 16:49:50,971 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 16:49:50,971 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 16:49:50,971 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 16:49:50,971 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 16:49:50,971 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 16:49:50,971 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 16:49:50,972 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 16:49:50,972 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 16:49:50,972 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 16:49:50,972 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 16:49:50,972 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 16:49:50,972 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 16:49:50,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 16:49:50,973 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 16:49:50,973 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 16:49:50,973 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 16:49:50,973 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 16:49:50,973 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 16:49:50,973 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 16:49:50,973 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 16:49:50,973 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 16:49:50,974 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 16:49:50,974 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 16:49:50,974 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 -> f9ab0f28220d4c56d024e1d051466cfff21d1d545d8edb81faa19718425e9629 [2025-03-17 16:49:51,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 16:49:51,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 16:49:51,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 16:49:51,212 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 16:49:51,212 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 16:49:51,214 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_12_bad.i [2025-03-17 16:49:52,381 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3b0cd3a2/a1a0f2c5539d478dae030b8ec8a0237e/FLAG71cf32633 [2025-03-17 16:49:52,747 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 16:49:52,750 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_12_bad.i [2025-03-17 16:49:52,774 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3b0cd3a2/a1a0f2c5539d478dae030b8ec8a0237e/FLAG71cf32633 [2025-03-17 16:49:52,943 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3b0cd3a2/a1a0f2c5539d478dae030b8ec8a0237e [2025-03-17 16:49:52,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 16:49:52,945 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 16:49:52,946 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 16:49:52,946 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 16:49:52,949 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 16:49:52,950 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:49:52" (1/1) ... [2025-03-17 16:49:52,950 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691baf41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:49:52, skipping insertion in model container [2025-03-17 16:49:52,951 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:49:52" (1/1) ... [2025-03-17 16:49:52,994 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 16:49:53,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 16:49:53,522 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 16:49:53,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 16:49:53,747 INFO L204 MainTranslator]: Completed translation [2025-03-17 16:49:53,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:49:53 WrapperNode [2025-03-17 16:49:53,748 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 16:49:53,749 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 16:49:53,749 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 16:49:53,749 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 16:49:53,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:49:53" (1/1) ... [2025-03-17 16:49:53,785 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:49:53" (1/1) ... [2025-03-17 16:49:53,804 INFO L138 Inliner]: procedures = 503, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2025-03-17 16:49:53,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 16:49:53,805 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 16:49:53,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 16:49:53,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 16:49:53,813 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:49:53" (1/1) ... [2025-03-17 16:49:53,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:49:53" (1/1) ... [2025-03-17 16:49:53,819 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:49:53" (1/1) ... [2025-03-17 16:49:53,831 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-17 16:49:53,833 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:49:53" (1/1) ... [2025-03-17 16:49:53,835 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:49:53" (1/1) ... [2025-03-17 16:49:53,843 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:49:53" (1/1) ... [2025-03-17 16:49:53,844 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:49:53" (1/1) ... [2025-03-17 16:49:53,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:49:53" (1/1) ... [2025-03-17 16:49:53,847 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:49:53" (1/1) ... [2025-03-17 16:49:53,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 16:49:53,851 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 16:49:53,851 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 16:49:53,851 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 16:49:53,852 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:49:53" (1/1) ... [2025-03-17 16:49:53,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 16:49:53,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 16:49:53,883 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-17 16:49:53,885 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-17 16:49:53,904 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-17 16:49:53,904 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-17 16:49:53,904 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2025-03-17 16:49:53,904 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2025-03-17 16:49:53,904 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-17 16:49:53,904 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-17 16:49:53,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 16:49:53,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 16:49:53,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 16:49:53,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 16:49:54,022 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 16:49:54,024 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 16:49:54,069 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1520: havoc #t~nondet83; [2025-03-17 16:49:54,170 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-17 16:49:54,173 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 16:49:54,179 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 16:49:54,180 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 16:49:54,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:49:54 BoogieIcfgContainer [2025-03-17 16:49:54,181 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 16:49:54,182 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 16:49:54,183 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 16:49:54,186 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 16:49:54,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:49:52" (1/3) ... [2025-03-17 16:49:54,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@288a391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:49:54, skipping insertion in model container [2025-03-17 16:49:54,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:49:53" (2/3) ... [2025-03-17 16:49:54,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@288a391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:49:54, skipping insertion in model container [2025-03-17 16:49:54,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:49:54" (3/3) ... [2025-03-17 16:49:54,189 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_add_12_bad.i [2025-03-17 16:49:54,199 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 16:49:54,200 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fgets_add_12_bad.i that has 4 procedures, 39 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-17 16:49:54,240 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 16:49:54,250 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;@76792cb6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 16:49:54,250 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-17 16:49:54,253 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 23 states have (on average 1.391304347826087) internal successors, (32), 29 states have internal predecessors, (32), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 16:49:54,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 16:49:54,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:49:54,258 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 16:49:54,258 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 16:49:54,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:49:54,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1371125985, now seen corresponding path program 1 times [2025-03-17 16:49:54,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 16:49:54,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2117425198] [2025-03-17 16:49:54,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:49:54,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 16:49:54,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 16:49:54,275 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-17 16:49:54,277 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-17 16:49:54,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 16:49:54,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 16:49:54,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:49:54,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:49:54,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 16:49:54,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 16:49:54,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 16:49:54,440 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 16:49:54,440 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 16:49:54,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117425198] [2025-03-17 16:49:54,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117425198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:49:54,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 16:49:54,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 16:49:54,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50079483] [2025-03-17 16:49:54,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:49:54,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 16:49:54,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 16:49:54,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 16:49:54,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 16:49:54,457 INFO L87 Difference]: Start difference. First operand has 39 states, 23 states have (on average 1.391304347826087) internal successors, (32), 29 states have internal predecessors, (32), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 1 states have (on average 10.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 16:49:54,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:49:54,469 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2025-03-17 16:49:54,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 16:49:54,472 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 10.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 18 [2025-03-17 16:49:54,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:49:54,477 INFO L225 Difference]: With dead ends: 39 [2025-03-17 16:49:54,477 INFO L226 Difference]: Without dead ends: 24 [2025-03-17 16:49:54,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 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-17 16:49:54,482 INFO L435 NwaCegarLoop]: 46 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, 46 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-17 16:49:54,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:49:54,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-17 16:49:54,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-17 16:49:54,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 16:49:54,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2025-03-17 16:49:54,512 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 18 [2025-03-17 16:49:54,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:49:54,513 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2025-03-17 16:49:54,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 10.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 16:49:54,513 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2025-03-17 16:49:54,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 16:49:54,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:49:54,514 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 16:49:54,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 16:49:54,715 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-17 16:49:54,715 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 16:49:54,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:49:54,716 INFO L85 PathProgramCache]: Analyzing trace with hash -444767441, now seen corresponding path program 1 times [2025-03-17 16:49:54,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 16:49:54,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1730298830] [2025-03-17 16:49:54,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:49:54,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 16:49:54,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 16:49:54,721 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-17 16:49:54,722 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-17 16:49:54,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 16:49:54,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 16:49:54,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:49:54,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:49:54,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 16:49:54,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 16:49:54,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 16:49:54,832 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 16:49:54,832 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 16:49:54,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730298830] [2025-03-17 16:49:54,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730298830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:49:54,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 16:49:54,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 16:49:54,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458698019] [2025-03-17 16:49:54,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:49:54,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 16:49:54,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 16:49:54,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 16:49:54,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 16:49:54,835 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 16:49:54,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:49:54,858 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2025-03-17 16:49:54,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 16:49:54,858 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2025-03-17 16:49:54,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:49:54,859 INFO L225 Difference]: With dead ends: 33 [2025-03-17 16:49:54,859 INFO L226 Difference]: Without dead ends: 24 [2025-03-17 16:49:54,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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-17 16:49:54,860 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 3 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 16:49:54,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 45 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:49:54,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-17 16:49:54,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-17 16:49:54,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 16:49:54,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2025-03-17 16:49:54,866 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 19 [2025-03-17 16:49:54,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:49:54,866 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-03-17 16:49:54,866 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 16:49:54,866 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2025-03-17 16:49:54,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 16:49:54,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:49:54,867 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 16:49:54,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 16:49:55,068 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-17 16:49:55,068 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 16:49:55,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:49:55,069 INFO L85 PathProgramCache]: Analyzing trace with hash -723665455, now seen corresponding path program 1 times [2025-03-17 16:49:55,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 16:49:55,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1420046037] [2025-03-17 16:49:55,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:49:55,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 16:49:55,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 16:49:55,071 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-17 16:49:55,073 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-17 16:49:55,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 16:49:55,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 16:49:55,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:49:55,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 16:49:55,151 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 16:49:55,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 16:49:55,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 16:49:55,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:49:55,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 16:49:55,196 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-17 16:49:55,196 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 16:49:55,197 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-03-17 16:49:55,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-03-17 16:49:55,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-03-17 16:49:55,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-03-17 16:49:55,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 16:49:55,400 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-17 16:49:55,403 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 16:49:55,427 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 16:49:55,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:49:55 BoogieIcfgContainer [2025-03-17 16:49:55,430 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 16:49:55,430 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 16:49:55,430 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 16:49:55,430 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 16:49:55,431 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:49:54" (3/4) ... [2025-03-17 16:49:55,433 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 16:49:55,437 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 16:49:55,437 INFO L158 Benchmark]: Toolchain (without parser) took 2491.96ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 87.2MB in the beginning and 173.9MB in the end (delta: -86.7MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. [2025-03-17 16:49:55,438 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 117.4MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 16:49:55,438 INFO L158 Benchmark]: CACSL2BoogieTranslator took 801.74ms. Allocated memory is still 117.4MB. Free memory was 87.0MB in the beginning and 64.9MB in the end (delta: 22.1MB). Peak memory consumption was 58.5MB. Max. memory is 16.1GB. [2025-03-17 16:49:55,438 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.41ms. Allocated memory is still 117.4MB. Free memory was 64.9MB in the beginning and 62.4MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 16:49:55,438 INFO L158 Benchmark]: Boogie Preprocessor took 43.30ms. Allocated memory is still 117.4MB. Free memory was 62.4MB in the beginning and 60.0MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 16:49:55,438 INFO L158 Benchmark]: IcfgBuilder took 330.19ms. Allocated memory is still 117.4MB. Free memory was 60.0MB in the beginning and 44.0MB in the end (delta: 16.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 16:49:55,438 INFO L158 Benchmark]: TraceAbstraction took 1247.15ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 43.8MB in the beginning and 174.0MB in the end (delta: -130.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 16:49:55,439 INFO L158 Benchmark]: Witness Printer took 6.59ms. Allocated memory is still 234.9MB. Free memory was 174.0MB in the beginning and 173.9MB in the end (delta: 42.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 16:49:55,440 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.23ms. Allocated memory is still 117.4MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 801.74ms. Allocated memory is still 117.4MB. Free memory was 87.0MB in the beginning and 64.9MB in the end (delta: 22.1MB). Peak memory consumption was 58.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.41ms. Allocated memory is still 117.4MB. Free memory was 64.9MB in the beginning and 62.4MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.30ms. Allocated memory is still 117.4MB. Free memory was 62.4MB in the beginning and 60.0MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 330.19ms. Allocated memory is still 117.4MB. Free memory was 60.0MB in the beginning and 44.0MB in the end (delta: 16.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1247.15ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 43.8MB in the beginning and 174.0MB in the end (delta: -130.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.59ms. Allocated memory is still 234.9MB. Free memory was 174.0MB in the beginning and 173.9MB in the end (delta: 42.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1573]: 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); [L1593] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={4:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1593] 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] [L1594] CALL CWE190_Integer_Overflow__int_fgets_add_12_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] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1552] RET globalReturnsTrueOrFalse() 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 globalReturnsTrueOrFalse() [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) [L1570] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1570] RET globalReturnsTrueOrFalse() 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] [L1570] COND TRUE globalReturnsTrueOrFalse() [L1573] 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: 1573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1581]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1581]: 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 4 procedures, 39 locations, 56 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 91 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10 IncrementalHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 71 mSDtfsCounter, 10 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred 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.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 43 SizeOfPredicates, 0 NumberOfNonLiveVariables, 119 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 6/6 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-17 16:49:55,454 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