./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_11_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_11_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 8bf7a6a41434023d5fc39841ce049ae649f51ab7e37e83c0c7aaceb626bb7505 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 03:47:50,300 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 03:47:50,359 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 03:47:50,366 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 03:47:50,366 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 03:47:50,388 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 03:47:50,388 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 03:47:50,388 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 03:47:50,389 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 03:47:50,389 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 03:47:50,389 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 03:47:50,390 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 03:47:50,390 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 03:47:50,390 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 03:47:50,390 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 03:47:50,390 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 03:47:50,391 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 03:47:50,391 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 03:47:50,391 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 03:47:50,391 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 03:47:50,391 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 03:47:50,391 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 03:47:50,391 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 03:47:50,391 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 03:47:50,391 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 03:47:50,391 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 03:47:50,391 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 03:47:50,391 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 03:47:50,391 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 03:47:50,391 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 03:47:50,391 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 03:47:50,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 03:47:50,392 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 03:47:50,392 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 03:47:50,392 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 03:47:50,392 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 03:47:50,392 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 03:47:50,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 03:47:50,392 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 03:47:50,392 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 03:47:50,392 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 03:47:50,392 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 03:47:50,392 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 -> 8bf7a6a41434023d5fc39841ce049ae649f51ab7e37e83c0c7aaceb626bb7505 [2025-03-09 03:47:50,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 03:47:50,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 03:47:50,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 03:47:50,625 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 03:47:50,625 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 03:47:50,627 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_multiply_11_bad.i [2025-03-09 03:47:51,758 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/766de5246/00c2a000a5374e5197cd837e54ddcfd0/FLAGba801be21 [2025-03-09 03:47:52,110 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 03:47:52,113 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_11_bad.i [2025-03-09 03:47:52,139 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/766de5246/00c2a000a5374e5197cd837e54ddcfd0/FLAGba801be21 [2025-03-09 03:47:52,312 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/766de5246/00c2a000a5374e5197cd837e54ddcfd0 [2025-03-09 03:47:52,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 03:47:52,315 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 03:47:52,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 03:47:52,316 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 03:47:52,319 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 03:47:52,320 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 03:47:52" (1/1) ... [2025-03-09 03:47:52,320 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39af41fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:47:52, skipping insertion in model container [2025-03-09 03:47:52,320 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 03:47:52" (1/1) ... [2025-03-09 03:47:52,351 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 03:47:52,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 03:47:52,921 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 03:47:52,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 03:47:53,061 INFO L204 MainTranslator]: Completed translation [2025-03-09 03:47:53,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:47:53 WrapperNode [2025-03-09 03:47:53,062 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 03:47:53,062 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 03:47:53,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 03:47:53,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 03:47:53,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:47:53" (1/1) ... [2025-03-09 03:47:53,077 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:47:53" (1/1) ... [2025-03-09 03:47:53,093 INFO L138 Inliner]: procedures = 498, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 69 [2025-03-09 03:47:53,093 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 03:47:53,093 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 03:47:53,093 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 03:47:53,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 03:47:53,100 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:47:53" (1/1) ... [2025-03-09 03:47:53,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:47:53" (1/1) ... [2025-03-09 03:47:53,102 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:47:53" (1/1) ... [2025-03-09 03:47:53,113 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2025-03-09 03:47:53,114 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:47:53" (1/1) ... [2025-03-09 03:47:53,114 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:47:53" (1/1) ... [2025-03-09 03:47:53,116 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:47:53" (1/1) ... [2025-03-09 03:47:53,117 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:47:53" (1/1) ... [2025-03-09 03:47:53,118 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:47:53" (1/1) ... [2025-03-09 03:47:53,118 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:47:53" (1/1) ... [2025-03-09 03:47:53,120 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 03:47:53,120 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 03:47:53,120 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 03:47:53,120 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 03:47:53,121 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:47:53" (1/1) ... [2025-03-09 03:47:53,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 03:47:53,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 03:47:53,147 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 03:47:53,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 03:47:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-09 03:47:53,167 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-09 03:47:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrue [2025-03-09 03:47:53,167 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrue [2025-03-09 03:47:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 03:47:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 03:47:53,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 03:47:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 03:47:53,280 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 03:47:53,281 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 03:47:53,360 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-09 03:47:53,361 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 03:47:53,366 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 03:47:53,366 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 03:47:53,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:47:53 BoogieIcfgContainer [2025-03-09 03:47:53,367 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 03:47:53,368 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 03:47:53,368 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 03:47:53,371 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 03:47:53,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 03:47:52" (1/3) ... [2025-03-09 03:47:53,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a0fdec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 03:47:53, skipping insertion in model container [2025-03-09 03:47:53,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:47:53" (2/3) ... [2025-03-09 03:47:53,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a0fdec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 03:47:53, skipping insertion in model container [2025-03-09 03:47:53,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:47:53" (3/3) ... [2025-03-09 03:47:53,373 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_multiply_11_bad.i [2025-03-09 03:47:53,383 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 03:47:53,385 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fgets_multiply_11_bad.i that has 3 procedures, 32 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-09 03:47:53,418 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 03:47:53,425 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;@4d3141f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 03:47:53,425 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-09 03:47:53,428 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 25 states have internal predecessors, (29), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 03:47:53,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 03:47:53,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:47:53,433 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-09 03:47:53,434 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-09 03:47:53,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:47:53,438 INFO L85 PathProgramCache]: Analyzing trace with hash -689199482, now seen corresponding path program 1 times [2025-03-09 03:47:53,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 03:47:53,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428559151] [2025-03-09 03:47:53,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:47:53,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 03:47:53,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 03:47:53,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 03:47:53,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:47:53,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:47:53,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 03:47:53,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 03:47:53,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428559151] [2025-03-09 03:47:53,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428559151] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 03:47:53,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203976923] [2025-03-09 03:47:53,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:47:53,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 03:47:53,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 03:47:53,679 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 03:47:53,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 03:47:53,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 03:47:53,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 03:47:53,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:47:53,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:47:53,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 03:47:53,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 03:47:53,795 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-09 03:47:53,795 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 03:47:53,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203976923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:47:53,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 03:47:53,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-09 03:47:53,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951796453] [2025-03-09 03:47:53,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:47:53,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 03:47:53,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 03:47:53,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 03:47:53,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 03:47:53,813 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 25 states have internal predecessors, (29), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 4.666666666666667) 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-09 03:47:53,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:47:53,835 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2025-03-09 03:47:53,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 03:47:53,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) 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-09 03:47:53,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:47:53,840 INFO L225 Difference]: With dead ends: 53 [2025-03-09 03:47:53,840 INFO L226 Difference]: Without dead ends: 24 [2025-03-09 03:47:53,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 03:47:53,843 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 4 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:47:53,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 69 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:47:53,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-09 03:47:53,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-09 03:47:53,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 03:47:53,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2025-03-09 03:47:53,863 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2025-03-09 03:47:53,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:47:53,863 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2025-03-09 03:47:53,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) 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-09 03:47:53,863 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2025-03-09 03:47:53,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-09 03:47:53,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:47:53,864 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, 1] [2025-03-09 03:47:53,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 03:47:54,067 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,SelfDestructingSolverStorable0 [2025-03-09 03:47:54,067 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-09 03:47:54,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:47:54,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1253015260, now seen corresponding path program 1 times [2025-03-09 03:47:54,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 03:47:54,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271836306] [2025-03-09 03:47:54,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:47:54,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 03:47:54,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 03:47:54,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 03:47:54,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:47:54,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:47:54,136 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-09 03:47:54,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 03:47:54,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271836306] [2025-03-09 03:47:54,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271836306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:47:54,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:47:54,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 03:47:54,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200566734] [2025-03-09 03:47:54,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:47:54,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 03:47:54,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 03:47:54,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 03:47:54,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 03:47:54,138 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-09 03:47:54,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:47:54,151 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2025-03-09 03:47:54,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 03:47:54,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 24 [2025-03-09 03:47:54,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:47:54,152 INFO L225 Difference]: With dead ends: 24 [2025-03-09 03:47:54,153 INFO L226 Difference]: Without dead ends: 23 [2025-03-09 03:47:54,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 03:47:54,153 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:47:54,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:47:54,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-09 03:47:54,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-09 03:47:54,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 03:47:54,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2025-03-09 03:47:54,158 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 24 [2025-03-09 03:47:54,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:47:54,158 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2025-03-09 03:47:54,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-09 03:47:54,158 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2025-03-09 03:47:54,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-09 03:47:54,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:47:54,159 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, 1, 1] [2025-03-09 03:47:54,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 03:47:54,159 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-09 03:47:54,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:47:54,159 INFO L85 PathProgramCache]: Analyzing trace with hash -188767416, now seen corresponding path program 1 times [2025-03-09 03:47:54,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 03:47:54,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476703042] [2025-03-09 03:47:54,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:47:54,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 03:47:54,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 03:47:54,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 03:47:54,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:47:54,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 03:47:54,181 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 03:47:54,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 03:47:54,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 03:47:54,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:47:54,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 03:47:54,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 03:47:54,208 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 03:47:54,209 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2025-03-09 03:47:54,210 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2025-03-09 03:47:54,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 03:47:54,213 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-09 03:47:54,234 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 03:47:54,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 03:47:54 BoogieIcfgContainer [2025-03-09 03:47:54,236 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 03:47:54,237 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 03:47:54,237 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 03:47:54,237 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 03:47:54,237 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:47:53" (3/4) ... [2025-03-09 03:47:54,239 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 03:47:54,239 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 03:47:54,239 INFO L158 Benchmark]: Toolchain (without parser) took 1924.36ms. Allocated memory is still 142.6MB. Free memory was 108.6MB in the beginning and 50.2MB in the end (delta: 58.4MB). Peak memory consumption was 64.3MB. Max. memory is 16.1GB. [2025-03-09 03:47:54,240 INFO L158 Benchmark]: CDTParser took 0.73ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:47:54,240 INFO L158 Benchmark]: CACSL2BoogieTranslator took 745.78ms. Allocated memory is still 142.6MB. Free memory was 108.1MB in the beginning and 50.1MB in the end (delta: 58.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-09 03:47:54,240 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.53ms. Allocated memory is still 142.6MB. Free memory was 50.1MB in the beginning and 47.5MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 03:47:54,240 INFO L158 Benchmark]: Boogie Preprocessor took 26.23ms. Allocated memory is still 142.6MB. Free memory was 47.5MB in the beginning and 46.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:47:54,240 INFO L158 Benchmark]: IcfgBuilder took 246.59ms. Allocated memory is still 142.6MB. Free memory was 46.2MB in the beginning and 102.0MB in the end (delta: -55.8MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2025-03-09 03:47:54,240 INFO L158 Benchmark]: TraceAbstraction took 868.10ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 50.2MB in the end (delta: 51.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-09 03:47:54,240 INFO L158 Benchmark]: Witness Printer took 2.32ms. Allocated memory is still 142.6MB. Free memory is still 50.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:47:54,241 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.73ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 745.78ms. Allocated memory is still 142.6MB. Free memory was 108.1MB in the beginning and 50.1MB in the end (delta: 58.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.53ms. Allocated memory is still 142.6MB. Free memory was 50.1MB in the beginning and 47.5MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.23ms. Allocated memory is still 142.6MB. Free memory was 47.5MB in the beginning and 46.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 246.59ms. Allocated memory is still 142.6MB. Free memory was 46.2MB in the beginning and 102.0MB in the end (delta: -55.8MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * TraceAbstraction took 868.10ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 50.2MB in the end (delta: 51.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 2.32ms. Allocated memory is still 142.6MB. Free memory is still 50.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1558, overapproximation of fgets at line 1556. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1578] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1578] 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] [L1579] CALL CWE190_Integer_Overflow__int_fgets_multiply_11_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 globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1512] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] RET globalReturnsTrue() 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 globalReturnsTrue() [L1555] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1558] data = atoi(inputBuffer) [L1566] CALL globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1512] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1566] RET globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1566] COND TRUE globalReturnsTrue() [L1568] COND TRUE data > 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] data * 2 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: 1570]: 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 3 procedures, 32 locations, 44 edges, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16 IncrementalHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 67 mSDtfsCounter, 16 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred 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, 93 NumberOfCodeBlocks, 93 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 65 ConstructedInterpolants, 0 QuantifiedInterpolants, 89 SizeOfPredicates, 0 NumberOfNonLiveVariables, 91 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 7/9 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-09 03:47:54,253 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_multiply_11_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 8bf7a6a41434023d5fc39841ce049ae649f51ab7e37e83c0c7aaceb626bb7505 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 03:47:56,105 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 03:47:56,183 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2025-03-09 03:47:56,188 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 03:47:56,188 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 03:47:56,188 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2025-03-09 03:47:56,212 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 03:47:56,213 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 03:47:56,213 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 03:47:56,214 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 03:47:56,215 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 03:47:56,215 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 03:47:56,215 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 03:47:56,215 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 03:47:56,215 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 03:47:56,216 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 03:47:56,216 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 03:47:56,216 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 03:47:56,216 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 03:47:56,216 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 03:47:56,216 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 03:47:56,216 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 03:47:56,216 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 03:47:56,217 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-09 03:47:56,217 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 03:47:56,217 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-09 03:47:56,217 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 03:47:56,217 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 03:47:56,217 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 03:47:56,217 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 03:47:56,218 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 03:47:56,218 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 03:47:56,218 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 03:47:56,218 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 03:47:56,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 03:47:56,218 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 03:47:56,219 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 03:47:56,219 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 03:47:56,219 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 03:47:56,219 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-09 03:47:56,219 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-09 03:47:56,219 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 03:47:56,219 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 03:47:56,219 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 03:47:56,219 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 03:47:56,219 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 -> 8bf7a6a41434023d5fc39841ce049ae649f51ab7e37e83c0c7aaceb626bb7505 [2025-03-09 03:47:56,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 03:47:56,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 03:47:56,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 03:47:56,461 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 03:47:56,461 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 03:47:56,462 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_multiply_11_bad.i [2025-03-09 03:47:57,616 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b461eb8a/8bac09542cc14763977cf5e9899ab827/FLAG28a66dc6d [2025-03-09 03:47:57,856 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 03:47:57,856 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_11_bad.i [2025-03-09 03:47:57,873 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b461eb8a/8bac09542cc14763977cf5e9899ab827/FLAG28a66dc6d [2025-03-09 03:47:58,172 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b461eb8a/8bac09542cc14763977cf5e9899ab827 [2025-03-09 03:47:58,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 03:47:58,175 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 03:47:58,176 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 03:47:58,176 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 03:47:58,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 03:47:58,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 03:47:58" (1/1) ... [2025-03-09 03:47:58,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@361f548e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:47:58, skipping insertion in model container [2025-03-09 03:47:58,179 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 03:47:58" (1/1) ... [2025-03-09 03:47:58,205 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 03:47:58,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 03:47:58,743 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 03:47:58,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 03:47:58,922 INFO L204 MainTranslator]: Completed translation [2025-03-09 03:47:58,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:47:58 WrapperNode [2025-03-09 03:47:58,923 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 03:47:58,923 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 03:47:58,924 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 03:47:58,924 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 03:47:58,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:47:58" (1/1) ... [2025-03-09 03:47:58,949 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:47:58" (1/1) ... [2025-03-09 03:47:58,963 INFO L138 Inliner]: procedures = 503, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 66 [2025-03-09 03:47:58,964 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 03:47:58,964 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 03:47:58,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 03:47:58,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 03:47:58,970 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:47:58" (1/1) ... [2025-03-09 03:47:58,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:47:58" (1/1) ... [2025-03-09 03:47:58,973 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:47:58" (1/1) ... [2025-03-09 03:47:58,989 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2025-03-09 03:47:58,992 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:47:58" (1/1) ... [2025-03-09 03:47:58,993 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:47:58" (1/1) ... [2025-03-09 03:47:59,002 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:47:58" (1/1) ... [2025-03-09 03:47:59,005 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:47:58" (1/1) ... [2025-03-09 03:47:59,006 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:47:58" (1/1) ... [2025-03-09 03:47:59,010 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:47:58" (1/1) ... [2025-03-09 03:47:59,012 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 03:47:59,016 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 03:47:59,016 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 03:47:59,016 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 03:47:59,017 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:47:58" (1/1) ... [2025-03-09 03:47:59,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 03:47:59,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 03:47:59,044 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 03:47:59,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 03:47:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-09 03:47:59,065 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-09 03:47:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrue [2025-03-09 03:47:59,065 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrue [2025-03-09 03:47:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-09 03:47:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 03:47:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 03:47:59,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 03:47:59,200 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 03:47:59,203 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 03:47:59,321 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-09 03:47:59,321 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 03:47:59,328 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 03:47:59,329 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 03:47:59,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:47:59 BoogieIcfgContainer [2025-03-09 03:47:59,329 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 03:47:59,331 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 03:47:59,332 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 03:47:59,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 03:47:59,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 03:47:58" (1/3) ... [2025-03-09 03:47:59,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5d093e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 03:47:59, skipping insertion in model container [2025-03-09 03:47:59,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:47:58" (2/3) ... [2025-03-09 03:47:59,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5d093e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 03:47:59, skipping insertion in model container [2025-03-09 03:47:59,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:47:59" (3/3) ... [2025-03-09 03:47:59,338 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_multiply_11_bad.i [2025-03-09 03:47:59,348 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 03:47:59,349 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fgets_multiply_11_bad.i that has 3 procedures, 30 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-09 03:47:59,387 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 03:47:59,397 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;@122d7e70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 03:47:59,398 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-09 03:47:59,402 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 03:47:59,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-09 03:47:59,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:47:59,407 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-09 03:47:59,407 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-09 03:47:59,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:47:59,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1366771331, now seen corresponding path program 1 times [2025-03-09 03:47:59,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 03:47:59,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [488099073] [2025-03-09 03:47:59,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:47:59,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 03:47:59,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 03:47:59,425 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 03:47:59,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 03:47:59,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 03:47:59,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 03:47:59,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:47:59,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:47:59,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 03:47:59,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 03:47:59,568 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-09 03:47:59,568 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 03:47:59,568 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 03:47:59,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488099073] [2025-03-09 03:47:59,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488099073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:47:59,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:47:59,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 03:47:59,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855632380] [2025-03-09 03:47:59,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:47:59,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 03:47:59,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 03:47:59,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 03:47:59,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 03:47:59,587 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-09 03:47:59,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:47:59,616 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2025-03-09 03:47:59,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 03:47:59,619 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), 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 20 [2025-03-09 03:47:59,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:47:59,624 INFO L225 Difference]: With dead ends: 30 [2025-03-09 03:47:59,625 INFO L226 Difference]: Without dead ends: 22 [2025-03-09 03:47:59,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 03:47:59,629 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:47:59,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 61 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:47:59,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-09 03:47:59,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-09 03:47:59,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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-09 03:47:59,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-03-09 03:47:59,652 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 20 [2025-03-09 03:47:59,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:47:59,653 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-03-09 03:47:59,654 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), 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-09 03:47:59,654 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-03-09 03:47:59,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-09 03:47:59,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:47:59,655 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-09 03:47:59,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 03:47:59,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 03:47:59,855 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-09 03:47:59,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:47:59,856 INFO L85 PathProgramCache]: Analyzing trace with hash -579761719, now seen corresponding path program 1 times [2025-03-09 03:47:59,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 03:47:59,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1500426762] [2025-03-09 03:47:59,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:47:59,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 03:47:59,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 03:47:59,859 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 03:47:59,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 03:47:59,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 03:47:59,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 03:47:59,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:47:59,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 03:47:59,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 03:47:59,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 03:47:59,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 03:47:59,944 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 03:47:59,944 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 03:47:59,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500426762] [2025-03-09 03:47:59,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500426762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 03:47:59,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 03:47:59,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 03:47:59,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387546826] [2025-03-09 03:47:59,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 03:47:59,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 03:47:59,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 03:47:59,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 03:47:59,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 03:47:59,945 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 03:47:59,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 03:47:59,952 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2025-03-09 03:47:59,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 03:47:59,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2025-03-09 03:47:59,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 03:47:59,953 INFO L225 Difference]: With dead ends: 31 [2025-03-09 03:47:59,953 INFO L226 Difference]: Without dead ends: 22 [2025-03-09 03:47:59,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 03:47:59,953 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 03:47:59,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 03:47:59,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-09 03:47:59,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-09 03:47:59,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 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-09 03:47:59,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-03-09 03:47:59,956 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 21 [2025-03-09 03:47:59,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 03:47:59,956 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-03-09 03:47:59,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 03:47:59,957 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-03-09 03:47:59,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-09 03:47:59,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 03:47:59,957 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-09 03:47:59,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 03:48:00,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 03:48:00,158 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-09 03:48:00,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 03:48:00,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1166508153, now seen corresponding path program 1 times [2025-03-09 03:48:00,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 03:48:00,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1519767347] [2025-03-09 03:48:00,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 03:48:00,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 03:48:00,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 03:48:00,161 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 03:48:00,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 03:48:00,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 03:48:00,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 03:48:00,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:48:00,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 03:48:00,238 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 03:48:00,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 03:48:00,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 03:48:00,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 03:48:00,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 03:48:00,270 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-09 03:48:00,271 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 03:48:00,271 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2025-03-09 03:48:00,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2025-03-09 03:48:00,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 03:48:00,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 03:48:00,476 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-09 03:48:00,497 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 03:48:00,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 03:48:00 BoogieIcfgContainer [2025-03-09 03:48:00,501 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 03:48:00,501 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 03:48:00,502 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 03:48:00,502 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 03:48:00,503 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 03:47:59" (3/4) ... [2025-03-09 03:48:00,504 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 03:48:00,505 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 03:48:00,506 INFO L158 Benchmark]: Toolchain (without parser) took 2330.94ms. Allocated memory is still 117.4MB. Free memory was 89.3MB in the beginning and 58.2MB in the end (delta: 31.1MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2025-03-09 03:48:00,506 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory is still 61.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:48:00,506 INFO L158 Benchmark]: CACSL2BoogieTranslator took 747.43ms. Allocated memory is still 117.4MB. Free memory was 89.1MB in the beginning and 76.9MB in the end (delta: 12.2MB). Peak memory consumption was 66.3MB. Max. memory is 16.1GB. [2025-03-09 03:48:00,507 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.43ms. Allocated memory is still 117.4MB. Free memory was 76.9MB in the beginning and 74.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:48:00,508 INFO L158 Benchmark]: Boogie Preprocessor took 47.99ms. Allocated memory is still 117.4MB. Free memory was 74.6MB in the beginning and 72.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:48:00,508 INFO L158 Benchmark]: IcfgBuilder took 313.61ms. Allocated memory is still 117.4MB. Free memory was 72.3MB in the beginning and 58.5MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 03:48:00,508 INFO L158 Benchmark]: TraceAbstraction took 1169.95ms. Allocated memory is still 117.4MB. Free memory was 57.7MB in the beginning and 58.7MB in the end (delta: -1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:48:00,508 INFO L158 Benchmark]: Witness Printer took 3.55ms. Allocated memory is still 117.4MB. Free memory was 58.7MB in the beginning and 58.2MB in the end (delta: 493.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 03:48:00,509 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 83.9MB. Free memory is still 61.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 747.43ms. Allocated memory is still 117.4MB. Free memory was 89.1MB in the beginning and 76.9MB in the end (delta: 12.2MB). Peak memory consumption was 66.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.43ms. Allocated memory is still 117.4MB. Free memory was 76.9MB in the beginning and 74.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.99ms. Allocated memory is still 117.4MB. Free memory was 74.6MB in the beginning and 72.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 313.61ms. Allocated memory is still 117.4MB. Free memory was 72.3MB in the beginning and 58.5MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1169.95ms. Allocated memory is still 117.4MB. Free memory was 57.7MB in the beginning and 58.7MB in the end (delta: -1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.55ms. Allocated memory is still 117.4MB. Free memory was 58.7MB in the beginning and 58.2MB in the end (delta: 493.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1558, overapproximation of fgets at line 1556. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1578] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1578] 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] [L1579] CALL CWE190_Integer_Overflow__int_fgets_multiply_11_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 globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1512] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] RET globalReturnsTrue() 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 globalReturnsTrue() [L1555] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1558] data = atoi(inputBuffer) [L1566] CALL globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1512] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1566] RET globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741825, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1566] COND TRUE globalReturnsTrue() [L1568] COND TRUE data > 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741825, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] data * 2 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: 1570]: 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 3 procedures, 30 locations, 42 edges, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 129 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13 IncrementalHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 57 mSDtfsCounter, 13 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 64 NumberOfCodeBlocks, 64 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 47 SizeOfPredicates, 0 NumberOfNonLiveVariables, 107 ConjunctsInSsa, 5 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-09 03:48:00,522 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