./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_03_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_postinc_03_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 6543db5d30f08824d9246bc55c721a6a0069742fa30ebaba77edc99892d3bbc9 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 13:06:35,184 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 13:06:35,264 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-09 13:06:35,270 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 13:06:35,272 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 13:06:35,295 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 13:06:35,299 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 13:06:35,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 13:06:35,300 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 13:06:35,300 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 13:06:35,300 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 13:06:35,301 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 13:06:35,301 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 13:06:35,301 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 13:06:35,301 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 13:06:35,302 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 13:06:35,302 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 13:06:35,302 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 13:06:35,306 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 13:06:35,306 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 13:06:35,306 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 13:06:35,307 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 13:06:35,307 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 13:06:35,307 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 13:06:35,307 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 13:06:35,307 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 13:06:35,307 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 13:06:35,308 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 13:06:35,308 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 13:06:35,308 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 13:06:35,308 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 13:06:35,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 13:06:35,308 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 13:06:35,308 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 13:06:35,309 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 13:06:35,309 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 13:06:35,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 13:06:35,309 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 13:06:35,309 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 13:06:35,309 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 13:06:35,309 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 13:06:35,310 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 -> 6543db5d30f08824d9246bc55c721a6a0069742fa30ebaba77edc99892d3bbc9 [2024-11-09 13:06:35,522 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 13:06:35,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 13:06:35,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 13:06:35,562 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 13:06:35,562 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 13:06:35,563 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_postinc_03_bad.i [2024-11-09 13:06:36,925 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 13:06:37,381 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 13:06:37,382 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_03_bad.i [2024-11-09 13:06:37,430 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19e465da0/bfde117d923d4c378e627e75a540e298/FLAG79ccc83e5 [2024-11-09 13:06:37,517 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19e465da0/bfde117d923d4c378e627e75a540e298 [2024-11-09 13:06:37,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 13:06:37,528 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 13:06:37,530 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 13:06:37,531 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 13:06:37,536 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 13:06:37,539 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:06:37" (1/1) ... [2024-11-09 13:06:37,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e4b1a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:06:37, skipping insertion in model container [2024-11-09 13:06:37,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:06:37" (1/1) ... [2024-11-09 13:06:37,638 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 13:06:38,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 13:06:38,628 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 13:06:38,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 13:06:38,929 INFO L204 MainTranslator]: Completed translation [2024-11-09 13:06:38,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:06:38 WrapperNode [2024-11-09 13:06:38,930 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 13:06:38,935 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 13:06:38,935 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 13:06:38,935 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 13:06:38,944 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:06:38" (1/1) ... [2024-11-09 13:06:38,992 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:06:38" (1/1) ... [2024-11-09 13:06:39,037 INFO L138 Inliner]: procedures = 498, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 69 [2024-11-09 13:06:39,038 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 13:06:39,039 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 13:06:39,040 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 13:06:39,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 13:06:39,065 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:06:38" (1/1) ... [2024-11-09 13:06:39,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:06:38" (1/1) ... [2024-11-09 13:06:39,073 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:06:38" (1/1) ... [2024-11-09 13:06:39,111 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:06:39,111 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:06:38" (1/1) ... [2024-11-09 13:06:39,111 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:06:38" (1/1) ... [2024-11-09 13:06:39,118 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:06:38" (1/1) ... [2024-11-09 13:06:39,131 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:06:38" (1/1) ... [2024-11-09 13:06:39,132 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:06:38" (1/1) ... [2024-11-09 13:06:39,133 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:06:38" (1/1) ... [2024-11-09 13:06:39,135 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 13:06:39,136 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 13:06:39,136 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 13:06:39,136 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 13:06:39,144 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:06:38" (1/1) ... [2024-11-09 13:06:39,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 13:06:39,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 13:06:39,189 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:06:39,202 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:06:39,246 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-09 13:06:39,246 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-09 13:06:39,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 13:06:39,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 13:06:39,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 13:06:39,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 13:06:39,403 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 13:06:39,405 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 13:06:39,549 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-09 13:06:39,549 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 13:06:39,568 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 13:06:39,568 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 13:06:39,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:06:39 BoogieIcfgContainer [2024-11-09 13:06:39,569 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 13:06:39,575 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 13:06:39,575 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 13:06:39,579 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 13:06:39,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:06:37" (1/3) ... [2024-11-09 13:06:39,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae619e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:06:39, skipping insertion in model container [2024-11-09 13:06:39,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:06:38" (2/3) ... [2024-11-09 13:06:39,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae619e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:06:39, skipping insertion in model container [2024-11-09 13:06:39,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:06:39" (3/3) ... [2024-11-09 13:06:39,581 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_postinc_03_bad.i [2024-11-09 13:06:39,604 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 13:06:39,604 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 13:06:39,659 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 13:06:39,664 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;@12a85bba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 13:06:39,664 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 13:06:39,672 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 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:06:39,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 13:06:39,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:06:39,678 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 13:06:39,678 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:06:39,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:06:39,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1958583963, now seen corresponding path program 1 times [2024-11-09 13:06:39,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 13:06:39,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44522992] [2024-11-09 13:06:39,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:06:39,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 13:06:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:06:39,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 13:06:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:06:39,976 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:06:39,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 13:06:39,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44522992] [2024-11-09 13:06:39,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44522992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 13:06:39,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 13:06:39,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 13:06:39,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029064615] [2024-11-09 13:06:39,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 13:06:39,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 13:06:39,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 13:06:40,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 13:06:40,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 13:06:40,011 INFO L87 Difference]: Start difference. First operand has 25 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 13:06:40,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 13:06:40,023 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2024-11-09 13:06:40,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 13:06:40,025 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-09 13:06:40,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 13:06:40,029 INFO L225 Difference]: With dead ends: 41 [2024-11-09 13:06:40,029 INFO L226 Difference]: Without dead ends: 18 [2024-11-09 13:06:40,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 13:06:40,033 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 13:06:40,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 13:06:40,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-09 13:06:40,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-09 13:06:40,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) 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:06:40,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-11-09 13:06:40,055 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 11 [2024-11-09 13:06:40,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 13:06:40,056 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-11-09 13:06:40,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 13:06:40,056 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-11-09 13:06:40,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 13:06:40,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:06:40,057 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 13:06:40,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 13:06:40,058 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:06:40,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:06:40,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1014034784, now seen corresponding path program 1 times [2024-11-09 13:06:40,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 13:06:40,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278074140] [2024-11-09 13:06:40,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:06:40,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 13:06:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:06:40,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 13:06:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:06:40,216 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:06:40,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 13:06:40,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278074140] [2024-11-09 13:06:40,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278074140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 13:06:40,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 13:06:40,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 13:06:40,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653747919] [2024-11-09 13:06:40,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 13:06:40,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 13:06:40,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 13:06:40,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 13:06:40,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 13:06:40,223 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 13:06:40,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 13:06:40,239 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2024-11-09 13:06:40,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 13:06:40,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-09 13:06:40,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 13:06:40,240 INFO L225 Difference]: With dead ends: 18 [2024-11-09 13:06:40,243 INFO L226 Difference]: Without dead ends: 17 [2024-11-09 13:06:40,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 13:06:40,244 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 13:06:40,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 40 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 13:06:40,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-09 13:06:40,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-09 13:06:40,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 13:06:40,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-11-09 13:06:40,251 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2024-11-09 13:06:40,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 13:06:40,251 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-09 13:06:40,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 13:06:40,251 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-11-09 13:06:40,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 13:06:40,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:06:40,252 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 13:06:40,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 13:06:40,252 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:06:40,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:06:40,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1370307168, now seen corresponding path program 1 times [2024-11-09 13:06:40,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 13:06:40,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178836027] [2024-11-09 13:06:40,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:06:40,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 13:06:40,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 13:06:40,293 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 13:06:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 13:06:40,336 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 13:06:40,339 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 13:06:40,340 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-09 13:06:40,345 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-09 13:06:40,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 13:06:40,347 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-09 13:06:40,372 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 13:06:40,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:06:40 BoogieIcfgContainer [2024-11-09 13:06:40,375 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 13:06:40,376 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 13:06:40,376 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 13:06:40,376 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 13:06:40,377 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:06:39" (3/4) ... [2024-11-09 13:06:40,379 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 13:06:40,380 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 13:06:40,380 INFO L158 Benchmark]: Toolchain (without parser) took 2852.31ms. Allocated memory is still 169.9MB. Free memory was 137.5MB in the beginning and 102.1MB in the end (delta: 35.3MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. [2024-11-09 13:06:40,381 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 125.8MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 13:06:40,382 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1399.50ms. Allocated memory is still 169.9MB. Free memory was 137.2MB in the beginning and 123.4MB in the end (delta: 13.8MB). Peak memory consumption was 63.1MB. Max. memory is 16.1GB. [2024-11-09 13:06:40,383 INFO L158 Benchmark]: Boogie Procedure Inliner took 103.39ms. Allocated memory is still 169.9MB. Free memory was 123.4MB in the beginning and 120.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 13:06:40,384 INFO L158 Benchmark]: Boogie Preprocessor took 95.73ms. Allocated memory is still 169.9MB. Free memory was 120.3MB in the beginning and 118.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 13:06:40,384 INFO L158 Benchmark]: RCFGBuilder took 432.90ms. Allocated memory is still 169.9MB. Free memory was 118.2MB in the beginning and 104.5MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 13:06:40,384 INFO L158 Benchmark]: TraceAbstraction took 800.45ms. Allocated memory is still 169.9MB. Free memory was 104.5MB in the beginning and 102.1MB in the end (delta: 2.4MB). Peak memory consumption was 1.3MB. Max. memory is 16.1GB. [2024-11-09 13:06:40,384 INFO L158 Benchmark]: Witness Printer took 4.08ms. Allocated memory is still 169.9MB. Free memory is still 102.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 13:06:40,388 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.17ms. Allocated memory is still 125.8MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1399.50ms. Allocated memory is still 169.9MB. Free memory was 137.2MB in the beginning and 123.4MB in the end (delta: 13.8MB). Peak memory consumption was 63.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 103.39ms. Allocated memory is still 169.9MB. Free memory was 123.4MB in the beginning and 120.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.73ms. Allocated memory is still 169.9MB. Free memory was 120.3MB in the beginning and 118.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 432.90ms. Allocated memory is still 169.9MB. Free memory was 118.2MB in the beginning and 104.5MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 800.45ms. Allocated memory is still 169.9MB. Free memory was 104.5MB in the beginning and 102.1MB in the end (delta: 2.4MB). Peak memory consumption was 1.3MB. Max. memory is 16.1GB. * Witness Printer took 4.08ms. Allocated memory is still 169.9MB. Free memory is still 102.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1569]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1558, overapproximation of 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_postinc_03_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] [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) [L1569] data++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1569]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 68 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8 IncrementalHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 44 mSDtfsCounter, 8 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred 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, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 22 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:06:40,414 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_postinc_03_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 6543db5d30f08824d9246bc55c721a6a0069742fa30ebaba77edc99892d3bbc9 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 13:06:42,788 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 13:06:42,852 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-09 13:06:42,857 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 13:06:42,857 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 13:06:42,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-09 13:06:42,882 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 13:06:42,885 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 13:06:42,886 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 13:06:42,886 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 13:06:42,887 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 13:06:42,887 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 13:06:42,887 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 13:06:42,888 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 13:06:42,889 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 13:06:42,890 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 13:06:42,890 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 13:06:42,890 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 13:06:42,890 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 13:06:42,890 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 13:06:42,891 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 13:06:42,891 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 13:06:42,891 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 13:06:42,892 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 13:06:42,892 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 13:06:42,892 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 13:06:42,892 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 13:06:42,892 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 13:06:42,893 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 13:06:42,893 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 13:06:42,893 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 13:06:42,893 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 13:06:42,893 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 13:06:42,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 13:06:42,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 13:06:42,900 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 13:06:42,900 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 13:06:42,900 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 13:06:42,900 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 13:06:42,900 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 13:06:42,901 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 13:06:42,902 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 13:06:42,903 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 13:06:42,903 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 13:06:42,903 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 -> 6543db5d30f08824d9246bc55c721a6a0069742fa30ebaba77edc99892d3bbc9 [2024-11-09 13:06:43,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 13:06:43,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 13:06:43,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 13:06:43,175 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 13:06:43,175 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 13:06:43,176 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_postinc_03_bad.i [2024-11-09 13:06:44,518 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 13:06:44,862 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 13:06:44,863 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_03_bad.i [2024-11-09 13:06:44,882 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/789ba444f/840e3155a109496cb3019e325b743e6f/FLAG59291c734 [2024-11-09 13:06:44,895 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/789ba444f/840e3155a109496cb3019e325b743e6f [2024-11-09 13:06:44,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 13:06:44,898 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 13:06:44,899 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 13:06:44,899 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 13:06:44,903 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 13:06:44,903 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:06:44" (1/1) ... [2024-11-09 13:06:44,904 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19954928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:06:44, skipping insertion in model container [2024-11-09 13:06:44,904 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:06:44" (1/1) ... [2024-11-09 13:06:44,943 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 13:06:45,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 13:06:45,490 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 13:06:45,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 13:06:45,663 INFO L204 MainTranslator]: Completed translation [2024-11-09 13:06:45,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:06:45 WrapperNode [2024-11-09 13:06:45,664 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 13:06:45,665 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 13:06:45,665 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 13:06:45,665 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 13:06:45,669 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:06:45" (1/1) ... [2024-11-09 13:06:45,694 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:06:45" (1/1) ... [2024-11-09 13:06:45,719 INFO L138 Inliner]: procedures = 503, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 68 [2024-11-09 13:06:45,720 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 13:06:45,721 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 13:06:45,721 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 13:06:45,721 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 13:06:45,728 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:06:45" (1/1) ... [2024-11-09 13:06:45,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:06:45" (1/1) ... [2024-11-09 13:06:45,735 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:06:45" (1/1) ... [2024-11-09 13:06:45,749 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:06:45,749 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:06:45" (1/1) ... [2024-11-09 13:06:45,749 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:06:45" (1/1) ... [2024-11-09 13:06:45,756 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:06:45" (1/1) ... [2024-11-09 13:06:45,759 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:06:45" (1/1) ... [2024-11-09 13:06:45,761 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:06:45" (1/1) ... [2024-11-09 13:06:45,762 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:06:45" (1/1) ... [2024-11-09 13:06:45,769 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 13:06:45,769 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 13:06:45,769 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 13:06:45,769 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 13:06:45,770 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:06:45" (1/1) ... [2024-11-09 13:06:45,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 13:06:45,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 13:06:45,799 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:06:45,810 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:06:45,858 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-09 13:06:45,858 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-09 13:06:45,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 13:06:45,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 13:06:45,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 13:06:45,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 13:06:45,979 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 13:06:45,981 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 13:06:46,096 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-09 13:06:46,096 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 13:06:46,108 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 13:06:46,109 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 13:06:46,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:06:46 BoogieIcfgContainer [2024-11-09 13:06:46,109 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 13:06:46,111 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 13:06:46,111 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 13:06:46,113 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 13:06:46,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:06:44" (1/3) ... [2024-11-09 13:06:46,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f51651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:06:46, skipping insertion in model container [2024-11-09 13:06:46,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:06:45" (2/3) ... [2024-11-09 13:06:46,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f51651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:06:46, skipping insertion in model container [2024-11-09 13:06:46,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:06:46" (3/3) ... [2024-11-09 13:06:46,116 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_postinc_03_bad.i [2024-11-09 13:06:46,128 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 13:06:46,128 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 13:06:46,167 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 13:06:46,172 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;@38988709, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 13:06:46,172 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 13:06:46,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 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:06:46,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 13:06:46,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:06:46,181 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 13:06:46,181 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:06:46,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:06:46,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1958583963, now seen corresponding path program 1 times [2024-11-09 13:06:46,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 13:06:46,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1558334151] [2024-11-09 13:06:46,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:06:46,194 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:06:46,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 13:06:46,197 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:06:46,198 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:06:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:06:46,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 13:06:46,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 13:06:46,346 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:06:46,346 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 13:06:46,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 13:06:46,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1558334151] [2024-11-09 13:06:46,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1558334151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 13:06:46,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 13:06:46,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 13:06:46,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214018919] [2024-11-09 13:06:46,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 13:06:46,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 13:06:46,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 13:06:46,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 13:06:46,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 13:06:46,370 INFO L87 Difference]: Start difference. First operand has 25 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 13:06:46,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 13:06:46,381 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-11-09 13:06:46,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 13:06:46,383 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-09 13:06:46,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 13:06:46,388 INFO L225 Difference]: With dead ends: 40 [2024-11-09 13:06:46,388 INFO L226 Difference]: Without dead ends: 17 [2024-11-09 13:06:46,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 13:06:46,392 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 13:06:46,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 13:06:46,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-09 13:06:46,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-09 13:06:46,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 13:06:46,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-11-09 13:06:46,416 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2024-11-09 13:06:46,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 13:06:46,416 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-09 13:06:46,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 13:06:46,417 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-11-09 13:06:46,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 13:06:46,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:06:46,418 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 13:06:46,423 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:06:46,620 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:06:46,621 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:06:46,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:06:46,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1370307168, now seen corresponding path program 1 times [2024-11-09 13:06:46,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 13:06:46,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1126874053] [2024-11-09 13:06:46,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:06:46,625 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:06:46,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 13:06:46,628 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:06:46,633 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:06:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 13:06:46,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 13:06:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 13:06:46,790 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 13:06:46,790 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 13:06:46,792 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-09 13:06:46,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-09 13:06:46,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 13:06:46,997 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:06:47,001 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-09 13:06:47,022 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 13:06:47,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:06:47 BoogieIcfgContainer [2024-11-09 13:06:47,026 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 13:06:47,028 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 13:06:47,028 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 13:06:47,028 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 13:06:47,028 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:06:46" (3/4) ... [2024-11-09 13:06:47,031 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 13:06:47,032 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 13:06:47,032 INFO L158 Benchmark]: Toolchain (without parser) took 2133.95ms. Allocated memory was 58.7MB in the beginning and 102.8MB in the end (delta: 44.0MB). Free memory was 30.1MB in the beginning and 65.2MB in the end (delta: -35.2MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2024-11-09 13:06:47,033 INFO L158 Benchmark]: CDTParser took 0.80ms. Allocated memory is still 58.7MB. Free memory was 33.7MB in the beginning and 33.6MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 13:06:47,033 INFO L158 Benchmark]: CACSL2BoogieTranslator took 765.02ms. Allocated memory was 58.7MB in the beginning and 77.6MB in the end (delta: 18.9MB). Free memory was 29.8MB in the beginning and 41.4MB in the end (delta: -11.6MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2024-11-09 13:06:47,034 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.43ms. Allocated memory is still 77.6MB. Free memory was 41.4MB in the beginning and 38.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 13:06:47,034 INFO L158 Benchmark]: Boogie Preprocessor took 48.02ms. Allocated memory is still 77.6MB. Free memory was 38.4MB in the beginning and 35.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 13:06:47,035 INFO L158 Benchmark]: RCFGBuilder took 340.09ms. Allocated memory is still 77.6MB. Free memory was 35.4MB in the beginning and 46.1MB in the end (delta: -10.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 13:06:47,036 INFO L158 Benchmark]: TraceAbstraction took 916.15ms. Allocated memory was 77.6MB in the beginning and 102.8MB in the end (delta: 25.2MB). Free memory was 45.5MB in the beginning and 65.2MB in the end (delta: -19.8MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2024-11-09 13:06:47,036 INFO L158 Benchmark]: Witness Printer took 4.33ms. Allocated memory is still 102.8MB. Free memory is still 65.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 13:06:47,041 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.80ms. Allocated memory is still 58.7MB. Free memory was 33.7MB in the beginning and 33.6MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 765.02ms. Allocated memory was 58.7MB in the beginning and 77.6MB in the end (delta: 18.9MB). Free memory was 29.8MB in the beginning and 41.4MB in the end (delta: -11.6MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.43ms. Allocated memory is still 77.6MB. Free memory was 41.4MB in the beginning and 38.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.02ms. Allocated memory is still 77.6MB. Free memory was 38.4MB in the beginning and 35.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 340.09ms. Allocated memory is still 77.6MB. Free memory was 35.4MB in the beginning and 46.1MB in the end (delta: -10.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 916.15ms. Allocated memory was 77.6MB in the beginning and 102.8MB in the end (delta: 25.2MB). Free memory was 45.5MB in the beginning and 65.2MB in the end (delta: -19.8MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * Witness Printer took 4.33ms. Allocated memory is still 102.8MB. Free memory is still 65.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1569]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1558, overapproximation of 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_postinc_03_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] [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) [L1569] data++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1569]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 27 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 27 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 10 SizeOfPredicates, 0 NumberOfNonLiveVariables, 42 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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:06:47,083 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