./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_09_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d 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_09_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 aa05a18aecd26648795d669443e856f1c6673d34cbf544333932fd03ac8d6997 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 13:05:40,923 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 13:05:40,998 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-09 13:05:41,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 13:05:41,003 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 13:05:41,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 13:05:41,024 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 13:05:41,024 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 13:05:41,025 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 13:05:41,025 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 13:05:41,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 13:05:41,026 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 13:05:41,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 13:05:41,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 13:05:41,027 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 13:05:41,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 13:05:41,028 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 13:05:41,028 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 13:05:41,029 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 13:05:41,029 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 13:05:41,029 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 13:05:41,032 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 13:05:41,032 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 13:05:41,032 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 13:05:41,033 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 13:05:41,033 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 13:05:41,033 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 13:05:41,034 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 13:05:41,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 13:05:41,035 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 13:05:41,035 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 13:05:41,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 13:05:41,036 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 13:05:41,036 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 13:05:41,036 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 13:05:41,037 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 13:05:41,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 13:05:41,037 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 13:05:41,038 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 13:05:41,038 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 13:05:41,039 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 13:05:41,042 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 -> aa05a18aecd26648795d669443e856f1c6673d34cbf544333932fd03ac8d6997 [2024-11-09 13:05:41,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 13:05:41,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 13:05:41,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 13:05:41,311 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 13:05:41,311 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 13:05:41,312 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_09_bad.i [2024-11-09 13:05:42,900 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 13:05:43,279 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 13:05:43,280 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_09_bad.i [2024-11-09 13:05:43,311 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39c00eee8/be9b7ef22caf4e6aafb90d1aa4adff2e/FLAG2f92c9e4b [2024-11-09 13:05:43,329 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39c00eee8/be9b7ef22caf4e6aafb90d1aa4adff2e [2024-11-09 13:05:43,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 13:05:43,334 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 13:05:43,337 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 13:05:43,340 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 13:05:43,346 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 13:05:43,346 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:05:43" (1/1) ... [2024-11-09 13:05:43,347 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2762a76e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:43, skipping insertion in model container [2024-11-09 13:05:43,348 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:05:43" (1/1) ... [2024-11-09 13:05:43,402 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 13:05:44,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 13:05:44,147 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 13:05:44,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 13:05:44,343 INFO L204 MainTranslator]: Completed translation [2024-11-09 13:05:44,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:44 WrapperNode [2024-11-09 13:05:44,344 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 13:05:44,345 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 13:05:44,345 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 13:05:44,346 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 13:05:44,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:44" (1/1) ... [2024-11-09 13:05:44,390 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:44" (1/1) ... [2024-11-09 13:05:44,421 INFO L138 Inliner]: procedures = 498, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 67 [2024-11-09 13:05:44,422 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 13:05:44,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 13:05:44,423 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 13:05:44,423 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 13:05:44,435 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:44" (1/1) ... [2024-11-09 13:05:44,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:44" (1/1) ... [2024-11-09 13:05:44,439 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:44" (1/1) ... [2024-11-09 13:05:44,461 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-09 13:05:44,461 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:44" (1/1) ... [2024-11-09 13:05:44,462 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:44" (1/1) ... [2024-11-09 13:05:44,466 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:44" (1/1) ... [2024-11-09 13:05:44,472 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:44" (1/1) ... [2024-11-09 13:05:44,477 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:44" (1/1) ... [2024-11-09 13:05:44,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:44" (1/1) ... [2024-11-09 13:05:44,480 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 13:05:44,485 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 13:05:44,485 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 13:05:44,485 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 13:05:44,486 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:44" (1/1) ... [2024-11-09 13:05:44,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 13:05:44,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 13:05:44,523 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-09 13:05:44,526 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-09 13:05:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-09 13:05:44,567 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-09 13:05:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 13:05:44,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 13:05:44,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 13:05:44,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 13:05:44,704 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 13:05:44,706 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 13:05:44,835 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-09 13:05:44,835 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 13:05:44,846 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 13:05:44,846 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 13:05:44,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:05:44 BoogieIcfgContainer [2024-11-09 13:05:44,847 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 13:05:44,849 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 13:05:44,849 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 13:05:44,853 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 13:05:44,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:05:43" (1/3) ... [2024-11-09 13:05:44,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c314846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:05:44, skipping insertion in model container [2024-11-09 13:05:44,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:44" (2/3) ... [2024-11-09 13:05:44,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c314846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:05:44, skipping insertion in model container [2024-11-09 13:05:44,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:05:44" (3/3) ... [2024-11-09 13:05:44,856 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_multiply_09_bad.i [2024-11-09 13:05:44,871 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 13:05:44,871 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 13:05:44,921 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 13:05:44,930 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;@2831904f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 13:05:44,931 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 13:05:44,935 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 21 states have internal predecessors, (26), 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-09 13:05:44,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 13:05:44,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:05:44,943 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 13:05:44,960 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:05:44,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:05:44,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1593866737, now seen corresponding path program 1 times [2024-11-09 13:05:44,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 13:05:44,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871613393] [2024-11-09 13:05:44,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:05:44,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 13:05:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:05:45,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 13:05:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:05:45,328 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-09 13:05:45,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 13:05:45,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871613393] [2024-11-09 13:05:45,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871613393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 13:05:45,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 13:05:45,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 13:05:45,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333047215] [2024-11-09 13:05:45,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 13:05:45,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 13:05:45,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 13:05:45,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 13:05:45,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 13:05:45,362 INFO L87 Difference]: Start difference. First operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 21 states have internal predecessors, (26), 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-09 13:05:45,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 13:05:45,387 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2024-11-09 13:05:45,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 13:05:45,391 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-09 13:05:45,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 13:05:45,397 INFO L225 Difference]: With dead ends: 43 [2024-11-09 13:05:45,398 INFO L226 Difference]: Without dead ends: 19 [2024-11-09 13:05:45,401 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-09 13:05:45,405 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 28 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-09 13:05:45,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 28 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 13:05:45,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-09 13:05:45,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-09 13:05:45,442 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-09 13:05:45,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-11-09 13:05:45,445 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2024-11-09 13:05:45,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 13:05:45,447 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-11-09 13:05:45,447 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-09 13:05:45,447 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-11-09 13:05:45,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 13:05:45,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:05:45,449 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 13:05:45,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 13:05:45,450 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:05:45,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:05:45,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1271116596, now seen corresponding path program 1 times [2024-11-09 13:05:45,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 13:05:45,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083505210] [2024-11-09 13:05:45,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:05:45,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 13:05:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:05:45,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 13:05:45,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:05:45,603 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-09 13:05:45,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 13:05:45,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083505210] [2024-11-09 13:05:45,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083505210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 13:05:45,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 13:05:45,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 13:05:45,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16811339] [2024-11-09 13:05:45,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 13:05:45,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 13:05:45,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 13:05:45,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 13:05:45,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 13:05:45,610 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-09 13:05:45,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 13:05:45,628 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2024-11-09 13:05:45,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 13:05:45,628 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-09 13:05:45,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 13:05:45,630 INFO L225 Difference]: With dead ends: 19 [2024-11-09 13:05:45,630 INFO L226 Difference]: Without dead ends: 18 [2024-11-09 13:05:45,631 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-09 13:05:45,632 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-09 13:05:45,634 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-09 13:05:45,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-09 13:05:45,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-09 13:05:45,639 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-09 13:05:45,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-11-09 13:05:45,641 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2024-11-09 13:05:45,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 13:05:45,642 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-11-09 13:05:45,642 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-09 13:05:45,642 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-11-09 13:05:45,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 13:05:45,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:05:45,643 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 13:05:45,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 13:05:45,644 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:05:45,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:05:45,645 INFO L85 PathProgramCache]: Analyzing trace with hash 749908879, now seen corresponding path program 1 times [2024-11-09 13:05:45,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 13:05:45,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637756688] [2024-11-09 13:05:45,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:05:45,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 13:05:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 13:05:45,686 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 13:05:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 13:05:45,735 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 13:05:45,736 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 13:05:45,737 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-09 13:05:45,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-09 13:05:45,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 13:05:45,742 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-09 13:05:45,763 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 13:05:45,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:05:45 BoogieIcfgContainer [2024-11-09 13:05:45,766 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 13:05:45,767 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 13:05:45,768 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 13:05:45,768 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 13:05:45,768 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:05:44" (3/4) ... [2024-11-09 13:05:45,771 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 13:05:45,772 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 13:05:45,773 INFO L158 Benchmark]: Toolchain (without parser) took 2439.51ms. Allocated memory is still 184.5MB. Free memory was 111.1MB in the beginning and 109.2MB in the end (delta: 1.9MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. [2024-11-09 13:05:45,775 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 113.2MB. Free memory is still 76.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 13:05:45,776 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1006.80ms. Allocated memory is still 184.5MB. Free memory was 111.1MB in the beginning and 103.7MB in the end (delta: 7.5MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2024-11-09 13:05:45,777 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.19ms. Allocated memory is still 184.5MB. Free memory was 103.7MB in the beginning and 100.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 13:05:45,778 INFO L158 Benchmark]: Boogie Preprocessor took 61.40ms. Allocated memory is still 184.5MB. Free memory was 100.1MB in the beginning and 98.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 13:05:45,779 INFO L158 Benchmark]: RCFGBuilder took 362.19ms. Allocated memory is still 184.5MB. Free memory was 98.0MB in the beginning and 84.8MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 13:05:45,779 INFO L158 Benchmark]: TraceAbstraction took 917.39ms. Allocated memory is still 184.5MB. Free memory was 84.0MB in the beginning and 110.3MB in the end (delta: -26.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 13:05:45,780 INFO L158 Benchmark]: Witness Printer took 5.86ms. Allocated memory is still 184.5MB. Free memory was 110.3MB in the beginning and 109.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 13:05:45,782 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.50ms. Allocated memory is still 113.2MB. Free memory is still 76.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1006.80ms. Allocated memory is still 184.5MB. Free memory was 111.1MB in the beginning and 103.7MB in the end (delta: 7.5MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.19ms. Allocated memory is still 184.5MB. Free memory was 103.7MB in the beginning and 100.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.40ms. Allocated memory is still 184.5MB. Free memory was 100.1MB in the beginning and 98.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 362.19ms. Allocated memory is still 184.5MB. Free memory was 98.0MB in the beginning and 84.8MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 917.39ms. Allocated memory is still 184.5MB. Free memory was 84.0MB in the beginning and 110.3MB in the end (delta: -26.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.86ms. Allocated memory is still 184.5MB. Free memory was 110.3MB in the beginning and 109.2MB in the end (delta: 1.1MB). 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: 1570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1558, overapproximation of large string literal at line 1578, overapproximation of fgets at line 1556. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1578] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1578] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1579] CALL CWE190_Integer_Overflow__int_fgets_multiply_09_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE \read(GLOBAL_CONST_TRUE) [L1555] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1558] data = atoi(inputBuffer) [L1566] COND TRUE \read(GLOBAL_CONST_TRUE) 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] [L1568] COND TRUE data > 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] data * 2 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27 mSDsluCounter, 61 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, 46 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=26occurred 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.3s 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-09 13:05:45,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_09_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 aa05a18aecd26648795d669443e856f1c6673d34cbf544333932fd03ac8d6997 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 13:05:48,088 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 13:05:48,163 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-09 13:05:48,171 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 13:05:48,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 13:05:48,172 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-09 13:05:48,202 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 13:05:48,202 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 13:05:48,203 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 13:05:48,203 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 13:05:48,204 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 13:05:48,204 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 13:05:48,205 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 13:05:48,205 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 13:05:48,206 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 13:05:48,206 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 13:05:48,206 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 13:05:48,207 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 13:05:48,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 13:05:48,207 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 13:05:48,208 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 13:05:48,208 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 13:05:48,209 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 13:05:48,209 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 13:05:48,209 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 13:05:48,209 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 13:05:48,210 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 13:05:48,210 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 13:05:48,210 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 13:05:48,211 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 13:05:48,211 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 13:05:48,211 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 13:05:48,212 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 13:05:48,212 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 13:05:48,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 13:05:48,213 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 13:05:48,213 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 13:05:48,213 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 13:05:48,213 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 13:05:48,214 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 13:05:48,214 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 13:05:48,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 13:05:48,216 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 13:05:48,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 13:05:48,217 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 -> aa05a18aecd26648795d669443e856f1c6673d34cbf544333932fd03ac8d6997 [2024-11-09 13:05:48,530 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 13:05:48,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 13:05:48,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 13:05:48,561 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 13:05:48,562 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 13:05:48,564 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_09_bad.i [2024-11-09 13:05:50,147 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 13:05:50,513 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 13:05:50,513 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_09_bad.i [2024-11-09 13:05:50,548 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b2c3d98b/579121dffc114739b3bb87ba64f4ce1f/FLAG28e7f3b40 [2024-11-09 13:05:50,739 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b2c3d98b/579121dffc114739b3bb87ba64f4ce1f [2024-11-09 13:05:50,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 13:05:50,743 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 13:05:50,744 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 13:05:50,744 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 13:05:50,752 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 13:05:50,752 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:05:50" (1/1) ... [2024-11-09 13:05:50,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ad71f2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:50, skipping insertion in model container [2024-11-09 13:05:50,753 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:05:50" (1/1) ... [2024-11-09 13:05:50,805 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 13:05:51,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 13:05:51,636 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 13:05:51,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 13:05:51,886 INFO L204 MainTranslator]: Completed translation [2024-11-09 13:05:51,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:51 WrapperNode [2024-11-09 13:05:51,887 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 13:05:51,888 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 13:05:51,888 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 13:05:51,888 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 13:05:51,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:51" (1/1) ... [2024-11-09 13:05:51,933 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:51" (1/1) ... [2024-11-09 13:05:51,958 INFO L138 Inliner]: procedures = 503, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 66 [2024-11-09 13:05:51,959 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 13:05:51,959 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 13:05:51,960 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 13:05:51,960 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 13:05:51,971 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:51" (1/1) ... [2024-11-09 13:05:51,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:51" (1/1) ... [2024-11-09 13:05:51,975 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:51" (1/1) ... [2024-11-09 13:05:52,015 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-09 13:05:52,016 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:51" (1/1) ... [2024-11-09 13:05:52,016 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:51" (1/1) ... [2024-11-09 13:05:52,028 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:51" (1/1) ... [2024-11-09 13:05:52,034 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:51" (1/1) ... [2024-11-09 13:05:52,040 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:51" (1/1) ... [2024-11-09 13:05:52,042 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:51" (1/1) ... [2024-11-09 13:05:52,049 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 13:05:52,054 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 13:05:52,054 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 13:05:52,054 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 13:05:52,055 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:51" (1/1) ... [2024-11-09 13:05:52,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 13:05:52,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 13:05:52,095 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-09 13:05:52,101 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-09 13:05:52,144 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-09 13:05:52,145 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-09 13:05:52,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 13:05:52,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 13:05:52,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 13:05:52,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 13:05:52,317 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 13:05:52,319 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 13:05:52,492 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-09 13:05:52,492 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 13:05:52,504 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 13:05:52,505 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 13:05:52,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:05:52 BoogieIcfgContainer [2024-11-09 13:05:52,505 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 13:05:52,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 13:05:52,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 13:05:52,510 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 13:05:52,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:05:50" (1/3) ... [2024-11-09 13:05:52,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da6560d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:05:52, skipping insertion in model container [2024-11-09 13:05:52,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:05:51" (2/3) ... [2024-11-09 13:05:52,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da6560d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:05:52, skipping insertion in model container [2024-11-09 13:05:52,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:05:52" (3/3) ... [2024-11-09 13:05:52,514 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_multiply_09_bad.i [2024-11-09 13:05:52,533 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 13:05:52,534 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 13:05:52,603 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 13:05:52,615 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;@78ff6c38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 13:05:52,616 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 13:05:52,620 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 21 states have internal predecessors, (26), 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-09 13:05:52,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 13:05:52,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:05:52,644 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 13:05:52,645 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:05:52,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:05:52,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1593866737, now seen corresponding path program 1 times [2024-11-09 13:05:52,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 13:05:52,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [572596735] [2024-11-09 13:05:52,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:05:52,667 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-09 13:05:52,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 13:05:52,671 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-09 13:05:52,672 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-09 13:05:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:05:52,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 13:05:52,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 13:05:52,903 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-09 13:05:52,903 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 13:05:52,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 13:05:52,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [572596735] [2024-11-09 13:05:52,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [572596735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 13:05:52,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 13:05:52,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 13:05:52,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220565965] [2024-11-09 13:05:52,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 13:05:52,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 13:05:52,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 13:05:52,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 13:05:52,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 13:05:52,939 INFO L87 Difference]: Start difference. First operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 21 states have internal predecessors, (26), 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-09 13:05:52,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 13:05:52,971 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2024-11-09 13:05:52,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 13:05:52,974 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-09 13:05:52,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 13:05:52,979 INFO L225 Difference]: With dead ends: 43 [2024-11-09 13:05:52,979 INFO L226 Difference]: Without dead ends: 19 [2024-11-09 13:05:52,981 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-09 13:05:52,985 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 28 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-09 13:05:52,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 28 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 13:05:53,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-09 13:05:53,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-09 13:05:53,014 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-09 13:05:53,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-11-09 13:05:53,016 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2024-11-09 13:05:53,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 13:05:53,018 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-11-09 13:05:53,018 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-09 13:05:53,018 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-11-09 13:05:53,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 13:05:53,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:05:53,020 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 13:05:53,026 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 (2)] Ended with exit code 0 [2024-11-09 13:05:53,220 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-09 13:05:53,221 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:05:53,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:05:53,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1271116596, now seen corresponding path program 1 times [2024-11-09 13:05:53,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 13:05:53,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1605464490] [2024-11-09 13:05:53,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:05:53,223 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-09 13:05:53,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 13:05:53,227 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-09 13:05:53,228 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-09 13:05:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:05:53,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 13:05:53,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 13:05:53,364 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-09 13:05:53,364 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 13:05:53,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 13:05:53,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1605464490] [2024-11-09 13:05:53,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1605464490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 13:05:53,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 13:05:53,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 13:05:53,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317180679] [2024-11-09 13:05:53,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 13:05:53,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 13:05:53,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 13:05:53,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 13:05:53,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 13:05:53,373 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-09 13:05:53,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 13:05:53,392 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2024-11-09 13:05:53,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 13:05:53,393 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-09 13:05:53,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 13:05:53,394 INFO L225 Difference]: With dead ends: 19 [2024-11-09 13:05:53,394 INFO L226 Difference]: Without dead ends: 18 [2024-11-09 13:05:53,395 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-09 13:05:53,396 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-09 13:05:53,397 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-09 13:05:53,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-09 13:05:53,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-09 13:05:53,404 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-09 13:05:53,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-11-09 13:05:53,406 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2024-11-09 13:05:53,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 13:05:53,407 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-11-09 13:05:53,407 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-09 13:05:53,407 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-11-09 13:05:53,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 13:05:53,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:05:53,408 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 13:05:53,417 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 (3)] Ended with exit code 0 [2024-11-09 13:05:53,609 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-09 13:05:53,609 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:05:53,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:05:53,610 INFO L85 PathProgramCache]: Analyzing trace with hash 749908879, now seen corresponding path program 1 times [2024-11-09 13:05:53,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 13:05:53,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874095323] [2024-11-09 13:05:53,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:05:53,611 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-09 13:05:53,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 13:05:53,613 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-09 13:05:53,614 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-09 13:05:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 13:05:53,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 13:05:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 13:05:53,768 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 13:05:53,768 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 13:05:53,770 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-09 13:05:53,773 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-09 13:05:53,779 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-09 13:05:53,978 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-09 13:05:53,981 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-09 13:05:54,026 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 13:05:54,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:05:54 BoogieIcfgContainer [2024-11-09 13:05:54,049 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 13:05:54,050 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 13:05:54,050 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 13:05:54,050 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 13:05:54,050 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:05:52" (3/4) ... [2024-11-09 13:05:54,053 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 13:05:54,054 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 13:05:54,055 INFO L158 Benchmark]: Toolchain (without parser) took 3311.88ms. Allocated memory was 60.8MB in the beginning and 92.3MB in the end (delta: 31.5MB). Free memory was 31.4MB in the beginning and 62.0MB in the end (delta: -30.6MB). Peak memory consumption was 139.8kB. Max. memory is 16.1GB. [2024-11-09 13:05:54,055 INFO L158 Benchmark]: CDTParser took 1.11ms. Allocated memory is still 41.9MB. Free memory was 22.9MB in the beginning and 22.8MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 13:05:54,056 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1143.25ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 31.2MB in the beginning and 30.6MB in the end (delta: 644.0kB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. [2024-11-09 13:05:54,056 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.08ms. Allocated memory is still 75.5MB. Free memory was 30.6MB in the beginning and 27.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 13:05:54,057 INFO L158 Benchmark]: Boogie Preprocessor took 93.59ms. Allocated memory is still 75.5MB. Free memory was 27.2MB in the beginning and 47.8MB in the end (delta: -20.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 13:05:54,057 INFO L158 Benchmark]: RCFGBuilder took 451.41ms. Allocated memory is still 75.5MB. Free memory was 47.8MB in the beginning and 32.7MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 13:05:54,058 INFO L158 Benchmark]: TraceAbstraction took 1542.37ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 31.8MB in the beginning and 62.0MB in the end (delta: -30.2MB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. [2024-11-09 13:05:54,058 INFO L158 Benchmark]: Witness Printer took 4.70ms. Allocated memory is still 92.3MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 13:05:54,061 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.11ms. Allocated memory is still 41.9MB. Free memory was 22.9MB in the beginning and 22.8MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1143.25ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 31.2MB in the beginning and 30.6MB in the end (delta: 644.0kB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.08ms. Allocated memory is still 75.5MB. Free memory was 30.6MB in the beginning and 27.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.59ms. Allocated memory is still 75.5MB. Free memory was 27.2MB in the beginning and 47.8MB in the end (delta: -20.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 451.41ms. Allocated memory is still 75.5MB. Free memory was 47.8MB in the beginning and 32.7MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1542.37ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 31.8MB in the beginning and 62.0MB in the end (delta: -30.2MB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. * Witness Printer took 4.70ms. Allocated memory is still 92.3MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1558, overapproximation of large string literal at line 1578, overapproximation of fgets at line 1556. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1578] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1578] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1579] CALL CWE190_Integer_Overflow__int_fgets_multiply_09_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE \read(GLOBAL_CONST_TRUE) [L1555] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1558] data = atoi(inputBuffer) [L1566] COND TRUE \read(GLOBAL_CONST_TRUE) 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] [L1568] COND TRUE data > 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] data * 2 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 61 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, 46 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=26occurred 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, 104 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-09 13:05:54,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample