./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_07_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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_07_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 671d705a70336356947a97806e14e6e59074b41604d6d754fbc520319aac2b10 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 20:26:57,258 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 20:26:57,304 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-10 20:26:57,307 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 20:26:57,307 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 20:26:57,324 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 20:26:57,324 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 20:26:57,324 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 20:26:57,325 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 20:26:57,325 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 20:26:57,326 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 20:26:57,326 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 20:26:57,326 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 20:26:57,327 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 20:26:57,327 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 20:26:57,327 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 20:26:57,327 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 20:26:57,328 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 20:26:57,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 20:26:57,328 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 20:26:57,329 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 20:26:57,332 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 20:26:57,332 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 20:26:57,332 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 20:26:57,332 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 20:26:57,333 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 20:26:57,333 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 20:26:57,333 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 20:26:57,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 20:26:57,334 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 20:26:57,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 20:26:57,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 20:26:57,335 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 20:26:57,335 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 20:26:57,335 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 20:26:57,336 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 20:26:57,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 20:26:57,336 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 20:26:57,336 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 20:26:57,337 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 20:26:57,337 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 20:26:57,344 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 671d705a70336356947a97806e14e6e59074b41604d6d754fbc520319aac2b10 [2024-11-10 20:26:57,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 20:26:57,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 20:26:57,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 20:26:57,632 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 20:26:57,633 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 20:26:57,634 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_07_bad.i [2024-11-10 20:26:59,023 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 20:26:59,443 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 20:26:59,443 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_07_bad.i [2024-11-10 20:26:59,485 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc8a3764a/6c400fa9f9f84ae0a4104260a16de661/FLAG6b12b1ab0 [2024-11-10 20:26:59,606 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc8a3764a/6c400fa9f9f84ae0a4104260a16de661 [2024-11-10 20:26:59,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 20:26:59,610 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 20:26:59,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 20:26:59,612 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 20:26:59,616 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 20:26:59,619 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:26:59" (1/1) ... [2024-11-10 20:26:59,620 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17f450bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:26:59, skipping insertion in model container [2024-11-10 20:26:59,620 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:26:59" (1/1) ... [2024-11-10 20:26:59,694 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 20:27:00,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 20:27:00,663 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 20:27:00,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 20:27:00,796 INFO L204 MainTranslator]: Completed translation [2024-11-10 20:27:00,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:00 WrapperNode [2024-11-10 20:27:00,797 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 20:27:00,798 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 20:27:00,798 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 20:27:00,798 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 20:27:00,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:00" (1/1) ... [2024-11-10 20:27:00,828 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:00" (1/1) ... [2024-11-10 20:27:00,846 INFO L138 Inliner]: procedures = 498, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 68 [2024-11-10 20:27:00,847 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 20:27:00,847 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 20:27:00,848 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 20:27:00,848 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 20:27:00,856 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:00" (1/1) ... [2024-11-10 20:27:00,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:00" (1/1) ... [2024-11-10 20:27:00,858 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:00" (1/1) ... [2024-11-10 20:27:00,875 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]. [2024-11-10 20:27:00,875 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:00" (1/1) ... [2024-11-10 20:27:00,875 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:00" (1/1) ... [2024-11-10 20:27:00,880 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:00" (1/1) ... [2024-11-10 20:27:00,880 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:00" (1/1) ... [2024-11-10 20:27:00,881 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:00" (1/1) ... [2024-11-10 20:27:00,882 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:00" (1/1) ... [2024-11-10 20:27:00,883 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 20:27:00,884 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 20:27:00,884 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 20:27:00,884 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 20:27:00,885 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:00" (1/1) ... [2024-11-10 20:27:00,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 20:27:00,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 20:27:00,912 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) [2024-11-10 20:27:00,918 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 [2024-11-10 20:27:00,952 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-10 20:27:00,952 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-10 20:27:00,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 20:27:00,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 20:27:00,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 20:27:00,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 20:27:01,089 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 20:27:01,090 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 20:27:01,206 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-10 20:27:01,206 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 20:27:01,216 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 20:27:01,217 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 20:27:01,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:27:01 BoogieIcfgContainer [2024-11-10 20:27:01,220 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 20:27:01,221 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 20:27:01,221 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 20:27:01,224 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 20:27:01,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:26:59" (1/3) ... [2024-11-10 20:27:01,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791069ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:27:01, skipping insertion in model container [2024-11-10 20:27:01,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:00" (2/3) ... [2024-11-10 20:27:01,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791069ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:27:01, skipping insertion in model container [2024-11-10 20:27:01,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:27:01" (3/3) ... [2024-11-10 20:27:01,225 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_multiply_07_bad.i [2024-11-10 20:27:01,237 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 20:27:01,237 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 20:27:01,279 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 20:27:01,285 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;@4d614608, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 20:27:01,285 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 20:27:01,288 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 20 states have (on average 1.35) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 20:27:01,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 20:27:01,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 20:27:01,293 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 20:27:01,293 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 20:27:01,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 20:27:01,297 INFO L85 PathProgramCache]: Analyzing trace with hash -2099982641, now seen corresponding path program 1 times [2024-11-10 20:27:01,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 20:27:01,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121736818] [2024-11-10 20:27:01,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 20:27:01,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 20:27:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 20:27:01,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 20:27:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 20:27:01,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 20:27:01,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 20:27:01,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121736818] [2024-11-10 20:27:01,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121736818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 20:27:01,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 20:27:01,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 20:27:01,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134281500] [2024-11-10 20:27:01,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 20:27:01,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 20:27:01,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 20:27:01,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 20:27:01,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 20:27:01,550 INFO L87 Difference]: Start difference. First operand has 27 states, 20 states have (on average 1.35) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 20:27:01,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 20:27:01,595 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2024-11-10 20:27:01,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 20:27:01,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-10 20:27:01,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 20:27:01,614 INFO L225 Difference]: With dead ends: 45 [2024-11-10 20:27:01,615 INFO L226 Difference]: Without dead ends: 19 [2024-11-10 20:27:01,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 20:27:01,622 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 20:27:01,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 29 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 20:27:01,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-10 20:27:01,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-10 20:27:01,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 20:27:01,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-11-10 20:27:01,679 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2024-11-10 20:27:01,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 20:27:01,680 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-11-10 20:27:01,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 20:27:01,680 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-11-10 20:27:01,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 20:27:01,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 20:27:01,681 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 20:27:01,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 20:27:01,682 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 20:27:01,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 20:27:01,683 INFO L85 PathProgramCache]: Analyzing trace with hash 525575057, now seen corresponding path program 1 times [2024-11-10 20:27:01,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 20:27:01,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581210381] [2024-11-10 20:27:01,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 20:27:01,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 20:27:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 20:27:01,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 20:27:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 20:27:01,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 20:27:01,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 20:27:01,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581210381] [2024-11-10 20:27:01,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581210381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 20:27:01,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 20:27:01,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 20:27:01,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050736998] [2024-11-10 20:27:01,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 20:27:01,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 20:27:01,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 20:27:01,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 20:27:01,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 20:27:01,787 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 20:27:01,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 20:27:01,795 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2024-11-10 20:27:01,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 20:27:01,796 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-10 20:27:01,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 20:27:01,796 INFO L225 Difference]: With dead ends: 19 [2024-11-10 20:27:01,796 INFO L226 Difference]: Without dead ends: 18 [2024-11-10 20:27:01,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 20:27:01,802 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 33 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 [2024-11-10 20:27:01,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 33 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 20:27:01,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-10 20:27:01,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-10 20:27:01,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 20:27:01,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-11-10 20:27:01,811 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2024-11-10 20:27:01,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 20:27:01,811 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-11-10 20:27:01,811 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 20:27:01,811 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-11-10 20:27:01,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 20:27:01,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 20:27:01,812 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 20:27:01,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 20:27:01,812 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 20:27:01,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 20:27:01,812 INFO L85 PathProgramCache]: Analyzing trace with hash -887042436, now seen corresponding path program 1 times [2024-11-10 20:27:01,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 20:27:01,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164574555] [2024-11-10 20:27:01,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 20:27:01,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 20:27:01,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 20:27:01,868 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 20:27:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 20:27:01,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 20:27:01,908 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 20:27:01,910 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-10 20:27:01,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-10 20:27:01,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 20:27:01,913 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 20:27:01,930 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 20:27:01,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:27:01 BoogieIcfgContainer [2024-11-10 20:27:01,932 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 20:27:01,932 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 20:27:01,932 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 20:27:01,932 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 20:27:01,933 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:27:01" (3/4) ... [2024-11-10 20:27:01,935 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 20:27:01,935 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 20:27:01,936 INFO L158 Benchmark]: Toolchain (without parser) took 2326.11ms. Allocated memory is still 230.7MB. Free memory was 198.2MB in the beginning and 169.3MB in the end (delta: 28.9MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2024-11-10 20:27:01,936 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 155.2MB. Free memory is still 112.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 20:27:01,936 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1184.88ms. Allocated memory is still 230.7MB. Free memory was 198.2MB in the beginning and 136.0MB in the end (delta: 62.3MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2024-11-10 20:27:01,937 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.55ms. Allocated memory is still 230.7MB. Free memory was 134.9MB in the beginning and 132.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 20:27:01,937 INFO L158 Benchmark]: Boogie Preprocessor took 36.01ms. Allocated memory is still 230.7MB. Free memory was 132.8MB in the beginning and 130.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 20:27:01,937 INFO L158 Benchmark]: IcfgBuilder took 335.91ms. Allocated memory is still 230.7MB. Free memory was 130.7MB in the beginning and 116.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 20:27:01,938 INFO L158 Benchmark]: TraceAbstraction took 710.40ms. Allocated memory is still 230.7MB. Free memory was 115.0MB in the beginning and 169.3MB in the end (delta: -54.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 20:27:01,938 INFO L158 Benchmark]: Witness Printer took 3.27ms. Allocated memory is still 230.7MB. Free memory is still 169.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 20:27:01,941 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.22ms. Allocated memory is still 155.2MB. Free memory is still 112.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1184.88ms. Allocated memory is still 230.7MB. Free memory was 198.2MB in the beginning and 136.0MB in the end (delta: 62.3MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.55ms. Allocated memory is still 230.7MB. Free memory was 134.9MB in the beginning and 132.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.01ms. Allocated memory is still 230.7MB. Free memory was 132.8MB in the beginning and 130.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 335.91ms. Allocated memory is still 230.7MB. Free memory was 130.7MB in the beginning and 116.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 710.40ms. Allocated memory is still 230.7MB. Free memory was 115.0MB in the beginning and 169.3MB in the end (delta: -54.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.27ms. Allocated memory is still 230.7MB. Free memory is still 169.3MB. 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: 1571]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1559, overapproximation of large string literal at line 1579, overapproximation of fgets at line 1557. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); [L1548] static int staticFive = 5; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, staticFive=5] [L1579] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, staticFive=5] [L1414] COND TRUE line != ((void *)0) [L1579] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, staticFive=5] [L1580] CALL CWE190_Integer_Overflow__int_fgets_multiply_07_bad() [L1551] int data; [L1552] 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, staticFive=5] [L1553] COND TRUE staticFive==5 [L1556] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, staticFive=5] [L1557] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1559] data = atoi(inputBuffer) [L1567] COND TRUE staticFive==5 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, staticFive=5] [L1569] 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, staticFive=5] [L1571] 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, staticFive=5] - UnprovableResult [Line: 1571]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7 IncrementalHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 47 mSDtfsCounter, 7 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred 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, 41 NumberOfCodeBlocks, 41 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 34 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 20:27:01,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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_07_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 671d705a70336356947a97806e14e6e59074b41604d6d754fbc520319aac2b10 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 20:27:04,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 20:27:04,713 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-10 20:27:04,721 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 20:27:04,721 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 20:27:04,722 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-10 20:27:04,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 20:27:04,765 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 20:27:04,766 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 20:27:04,766 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 20:27:04,766 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 20:27:04,766 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 20:27:04,767 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 20:27:04,767 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 20:27:04,767 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 20:27:04,767 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 20:27:04,768 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 20:27:04,768 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 20:27:04,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 20:27:04,768 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 20:27:04,769 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 20:27:04,775 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 20:27:04,775 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 20:27:04,775 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 20:27:04,775 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 20:27:04,775 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 20:27:04,776 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 20:27:04,787 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 20:27:04,787 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 20:27:04,787 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 20:27:04,788 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 20:27:04,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 20:27:04,788 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 20:27:04,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 20:27:04,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 20:27:04,788 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 20:27:04,789 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 20:27:04,789 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 20:27:04,789 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 20:27:04,789 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 20:27:04,789 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 20:27:04,793 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 20:27:04,793 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 20:27:04,794 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 20:27:04,794 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 671d705a70336356947a97806e14e6e59074b41604d6d754fbc520319aac2b10 [2024-11-10 20:27:05,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 20:27:05,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 20:27:05,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 20:27:05,267 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 20:27:05,268 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 20:27:05,269 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_07_bad.i [2024-11-10 20:27:06,579 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 20:27:06,860 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 20:27:06,862 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_07_bad.i [2024-11-10 20:27:06,886 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41f0fcd89/fd0de01d23c1427ca591e3203adba37b/FLAGc3b642d20 [2024-11-10 20:27:06,899 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41f0fcd89/fd0de01d23c1427ca591e3203adba37b [2024-11-10 20:27:06,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 20:27:06,902 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 20:27:06,903 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 20:27:06,903 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 20:27:06,907 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 20:27:06,907 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:27:06" (1/1) ... [2024-11-10 20:27:06,908 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63618fd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:06, skipping insertion in model container [2024-11-10 20:27:06,908 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:27:06" (1/1) ... [2024-11-10 20:27:06,951 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 20:27:07,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 20:27:07,614 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 20:27:07,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 20:27:07,805 INFO L204 MainTranslator]: Completed translation [2024-11-10 20:27:07,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:07 WrapperNode [2024-11-10 20:27:07,806 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 20:27:07,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 20:27:07,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 20:27:07,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 20:27:07,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:07" (1/1) ... [2024-11-10 20:27:07,830 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:07" (1/1) ... [2024-11-10 20:27:07,849 INFO L138 Inliner]: procedures = 503, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 67 [2024-11-10 20:27:07,850 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 20:27:07,850 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 20:27:07,850 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 20:27:07,851 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 20:27:07,858 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:07" (1/1) ... [2024-11-10 20:27:07,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:07" (1/1) ... [2024-11-10 20:27:07,861 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:07" (1/1) ... [2024-11-10 20:27:07,876 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]. [2024-11-10 20:27:07,877 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:07" (1/1) ... [2024-11-10 20:27:07,877 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:07" (1/1) ... [2024-11-10 20:27:07,881 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:07" (1/1) ... [2024-11-10 20:27:07,882 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:07" (1/1) ... [2024-11-10 20:27:07,883 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:07" (1/1) ... [2024-11-10 20:27:07,884 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:07" (1/1) ... [2024-11-10 20:27:07,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 20:27:07,890 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 20:27:07,890 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 20:27:07,890 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 20:27:07,891 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:07" (1/1) ... [2024-11-10 20:27:07,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 20:27:07,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 20:27:07,915 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) [2024-11-10 20:27:07,926 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 [2024-11-10 20:27:07,984 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-10 20:27:07,984 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-10 20:27:07,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 20:27:07,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 20:27:07,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 20:27:07,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 20:27:08,183 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 20:27:08,191 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 20:27:08,385 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-10 20:27:08,385 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 20:27:08,403 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 20:27:08,408 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 20:27:08,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:27:08 BoogieIcfgContainer [2024-11-10 20:27:08,408 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 20:27:08,410 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 20:27:08,410 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 20:27:08,413 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 20:27:08,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:27:06" (1/3) ... [2024-11-10 20:27:08,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cfd5ccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:27:08, skipping insertion in model container [2024-11-10 20:27:08,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:07" (2/3) ... [2024-11-10 20:27:08,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cfd5ccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:27:08, skipping insertion in model container [2024-11-10 20:27:08,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:27:08" (3/3) ... [2024-11-10 20:27:08,423 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_multiply_07_bad.i [2024-11-10 20:27:08,447 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 20:27:08,448 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 20:27:08,513 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 20:27:08,525 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;@7e668b3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 20:27:08,525 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 20:27:08,532 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 20 states have (on average 1.35) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 20:27:08,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 20:27:08,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 20:27:08,546 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 20:27:08,546 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 20:27:08,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 20:27:08,552 INFO L85 PathProgramCache]: Analyzing trace with hash -2099982641, now seen corresponding path program 1 times [2024-11-10 20:27:08,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 20:27:08,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049613631] [2024-11-10 20:27:08,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 20:27:08,566 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 20:27:08,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 20:27:08,587 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 20:27:08,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 20:27:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 20:27:08,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 20:27:08,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 20:27:08,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 20:27:08,742 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 20:27:08,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 20:27:08,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049613631] [2024-11-10 20:27:08,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049613631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 20:27:08,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 20:27:08,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 20:27:08,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274313060] [2024-11-10 20:27:08,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 20:27:08,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 20:27:08,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 20:27:08,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 20:27:08,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 20:27:08,770 INFO L87 Difference]: Start difference. First operand has 27 states, 20 states have (on average 1.35) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 20:27:08,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 20:27:08,788 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2024-11-10 20:27:08,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 20:27:08,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-10 20:27:08,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 20:27:08,794 INFO L225 Difference]: With dead ends: 45 [2024-11-10 20:27:08,795 INFO L226 Difference]: Without dead ends: 19 [2024-11-10 20:27:08,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 20:27:08,800 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 20:27:08,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 29 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 20:27:08,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-10 20:27:08,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-10 20:27:08,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 20:27:08,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-11-10 20:27:08,829 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2024-11-10 20:27:08,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 20:27:08,830 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-11-10 20:27:08,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 20:27:08,830 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-11-10 20:27:08,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 20:27:08,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 20:27:08,831 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 20:27:08,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-10 20:27:09,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 20:27:09,032 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 20:27:09,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 20:27:09,034 INFO L85 PathProgramCache]: Analyzing trace with hash 525575057, now seen corresponding path program 1 times [2024-11-10 20:27:09,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 20:27:09,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1923816842] [2024-11-10 20:27:09,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 20:27:09,035 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 20:27:09,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 20:27:09,040 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 20:27:09,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 20:27:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 20:27:09,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 20:27:09,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 20:27:09,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 20:27:09,159 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 20:27:09,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 20:27:09,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1923816842] [2024-11-10 20:27:09,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1923816842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 20:27:09,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 20:27:09,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 20:27:09,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335791418] [2024-11-10 20:27:09,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 20:27:09,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 20:27:09,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 20:27:09,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 20:27:09,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 20:27:09,161 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 20:27:09,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 20:27:09,172 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2024-11-10 20:27:09,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 20:27:09,172 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-10 20:27:09,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 20:27:09,173 INFO L225 Difference]: With dead ends: 19 [2024-11-10 20:27:09,173 INFO L226 Difference]: Without dead ends: 18 [2024-11-10 20:27:09,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 20:27:09,174 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 33 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 [2024-11-10 20:27:09,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 33 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 20:27:09,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-10 20:27:09,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-10 20:27:09,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 20:27:09,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-11-10 20:27:09,177 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2024-11-10 20:27:09,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 20:27:09,177 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-11-10 20:27:09,178 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 20:27:09,178 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-11-10 20:27:09,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 20:27:09,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 20:27:09,178 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 20:27:09,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 20:27:09,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 20:27:09,381 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 20:27:09,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 20:27:09,382 INFO L85 PathProgramCache]: Analyzing trace with hash -887042436, now seen corresponding path program 1 times [2024-11-10 20:27:09,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 20:27:09,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856353203] [2024-11-10 20:27:09,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 20:27:09,383 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 20:27:09,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 20:27:09,385 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 20:27:09,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 20:27:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 20:27:09,455 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 20:27:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 20:27:09,490 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-10 20:27:09,491 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 20:27:09,491 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-10 20:27:09,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-10 20:27:09,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 20:27:09,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 20:27:09,696 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 20:27:09,745 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 20:27:09,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:27:09 BoogieIcfgContainer [2024-11-10 20:27:09,751 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 20:27:09,752 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 20:27:09,753 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 20:27:09,753 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 20:27:09,753 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:27:08" (3/4) ... [2024-11-10 20:27:09,755 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 20:27:09,774 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 20:27:09,779 INFO L158 Benchmark]: Toolchain (without parser) took 2876.89ms. Allocated memory was 60.8MB in the beginning and 102.8MB in the end (delta: 41.9MB). Free memory was 33.7MB in the beginning and 71.5MB in the end (delta: -37.7MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2024-11-10 20:27:09,779 INFO L158 Benchmark]: CDTParser took 0.90ms. Allocated memory is still 50.3MB. Free memory is still 24.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 20:27:09,779 INFO L158 Benchmark]: CACSL2BoogieTranslator took 903.16ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 33.5MB in the beginning and 35.3MB in the end (delta: -1.8MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2024-11-10 20:27:09,780 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.49ms. Allocated memory is still 75.5MB. Free memory was 35.3MB in the beginning and 32.0MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 20:27:09,780 INFO L158 Benchmark]: Boogie Preprocessor took 37.06ms. Allocated memory is still 75.5MB. Free memory was 32.0MB in the beginning and 29.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 20:27:09,780 INFO L158 Benchmark]: IcfgBuilder took 518.84ms. Allocated memory is still 75.5MB. Free memory was 29.4MB in the beginning and 36.5MB in the end (delta: -7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 20:27:09,781 INFO L158 Benchmark]: TraceAbstraction took 1340.88ms. Allocated memory was 75.5MB in the beginning and 102.8MB in the end (delta: 27.3MB). Free memory was 36.0MB in the beginning and 72.1MB in the end (delta: -36.1MB). Peak memory consumption was 1.4MB. Max. memory is 16.1GB. [2024-11-10 20:27:09,781 INFO L158 Benchmark]: Witness Printer took 25.82ms. Allocated memory is still 102.8MB. Free memory was 71.5MB in the beginning and 71.5MB in the end (delta: 59.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 20:27:09,786 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.90ms. Allocated memory is still 50.3MB. Free memory is still 24.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 903.16ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 33.5MB in the beginning and 35.3MB in the end (delta: -1.8MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.49ms. Allocated memory is still 75.5MB. Free memory was 35.3MB in the beginning and 32.0MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.06ms. Allocated memory is still 75.5MB. Free memory was 32.0MB in the beginning and 29.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 518.84ms. Allocated memory is still 75.5MB. Free memory was 29.4MB in the beginning and 36.5MB in the end (delta: -7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1340.88ms. Allocated memory was 75.5MB in the beginning and 102.8MB in the end (delta: 27.3MB). Free memory was 36.0MB in the beginning and 72.1MB in the end (delta: -36.1MB). Peak memory consumption was 1.4MB. Max. memory is 16.1GB. * Witness Printer took 25.82ms. Allocated memory is still 102.8MB. Free memory was 71.5MB in the beginning and 71.5MB in the end (delta: 59.9kB). Peak memory consumption was 2.1MB. 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: 1571]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1559, overapproximation of large string literal at line 1579, overapproximation of fgets at line 1557. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); [L1548] static int staticFive = 5; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, staticFive=5] [L1579] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, staticFive=5] [L1414] COND TRUE line != ((void *)0) [L1579] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, staticFive=5] [L1580] CALL CWE190_Integer_Overflow__int_fgets_multiply_07_bad() [L1551] int data; [L1552] 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, staticFive=5] [L1553] COND TRUE staticFive==5 [L1556] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, staticFive=5] [L1557] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1559] data = atoi(inputBuffer) [L1567] COND TRUE staticFive==5 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, staticFive=5] [L1569] 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, staticFive=5] [L1571] 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, staticFive=5] - UnprovableResult [Line: 1571]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 24 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7 IncrementalHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 47 mSDtfsCounter, 7 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred 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.1s InterpolantComputationTime, 41 NumberOfCodeBlocks, 41 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 42 SizeOfPredicates, 0 NumberOfNonLiveVariables, 106 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 20:27:09,816 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