./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_15_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_15_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 01c9b8bd6bf6d03f55698c37d5c9b4987e10acd19718f3511ca3202d68056c02 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 11:59:20,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 11:59:20,206 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-19 11:59:20,212 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 11:59:20,212 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 11:59:20,244 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 11:59:20,245 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 11:59:20,245 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 11:59:20,246 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 11:59:20,247 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 11:59:20,248 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 11:59:20,248 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 11:59:20,249 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 11:59:20,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 11:59:20,252 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 11:59:20,253 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 11:59:20,253 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 11:59:20,253 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 11:59:20,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 11:59:20,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 11:59:20,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 11:59:20,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 11:59:20,255 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 11:59:20,255 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 11:59:20,256 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 11:59:20,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 11:59:20,256 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 11:59:20,256 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 11:59:20,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 11:59:20,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 11:59:20,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 11:59:20,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 11:59:20,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 11:59:20,258 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 11:59:20,258 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 11:59:20,259 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 11:59:20,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 11:59:20,260 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 11:59:20,260 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 11:59:20,260 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 11:59:20,261 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 11:59:20,261 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 -> 01c9b8bd6bf6d03f55698c37d5c9b4987e10acd19718f3511ca3202d68056c02 [2024-11-19 11:59:20,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 11:59:20,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 11:59:20,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 11:59:20,575 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 11:59:20,575 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 11:59:20,577 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_15_bad.i [2024-11-19 11:59:21,933 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 11:59:22,279 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 11:59:22,281 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_15_bad.i [2024-11-19 11:59:22,310 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9784fd7e2/7d449075a3d14d149ef10f8250a13711/FLAGb18ee99ed [2024-11-19 11:59:22,533 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9784fd7e2/7d449075a3d14d149ef10f8250a13711 [2024-11-19 11:59:22,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 11:59:22,538 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 11:59:22,540 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 11:59:22,540 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 11:59:22,547 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 11:59:22,549 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:59:22" (1/1) ... [2024-11-19 11:59:22,550 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7048ab77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:22, skipping insertion in model container [2024-11-19 11:59:22,550 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:59:22" (1/1) ... [2024-11-19 11:59:22,617 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 11:59:23,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 11:59:23,360 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 11:59:23,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 11:59:23,533 INFO L204 MainTranslator]: Completed translation [2024-11-19 11:59:23,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:23 WrapperNode [2024-11-19 11:59:23,533 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 11:59:23,534 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 11:59:23,535 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 11:59:23,535 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 11:59:23,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:23" (1/1) ... [2024-11-19 11:59:23,563 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:23" (1/1) ... [2024-11-19 11:59:23,593 INFO L138 Inliner]: procedures = 498, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 93 [2024-11-19 11:59:23,594 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 11:59:23,594 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 11:59:23,594 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 11:59:23,594 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 11:59:23,605 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:23" (1/1) ... [2024-11-19 11:59:23,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:23" (1/1) ... [2024-11-19 11:59:23,610 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:23" (1/1) ... [2024-11-19 11:59:23,625 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-19 11:59:23,626 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:23" (1/1) ... [2024-11-19 11:59:23,626 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:23" (1/1) ... [2024-11-19 11:59:23,632 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:23" (1/1) ... [2024-11-19 11:59:23,635 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:23" (1/1) ... [2024-11-19 11:59:23,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:23" (1/1) ... [2024-11-19 11:59:23,638 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:23" (1/1) ... [2024-11-19 11:59:23,640 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 11:59:23,641 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 11:59:23,641 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 11:59:23,641 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 11:59:23,644 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:23" (1/1) ... [2024-11-19 11:59:23,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 11:59:23,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:59:23,681 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-19 11:59:23,687 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-19 11:59:23,749 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-19 11:59:23,750 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-19 11:59:23,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 11:59:23,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 11:59:23,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 11:59:23,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 11:59:23,923 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 11:59:23,925 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 11:59:24,045 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-19 11:59:24,045 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 11:59:24,057 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 11:59:24,058 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 11:59:24,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:59:24 BoogieIcfgContainer [2024-11-19 11:59:24,060 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 11:59:24,062 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 11:59:24,063 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 11:59:24,066 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 11:59:24,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:59:22" (1/3) ... [2024-11-19 11:59:24,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ae82c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:59:24, skipping insertion in model container [2024-11-19 11:59:24,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:23" (2/3) ... [2024-11-19 11:59:24,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ae82c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:59:24, skipping insertion in model container [2024-11-19 11:59:24,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:59:24" (3/3) ... [2024-11-19 11:59:24,070 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_multiply_15_bad.i [2024-11-19 11:59:24,085 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 11:59:24,086 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 11:59:24,140 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 11:59:24,145 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;@64d79976, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 11:59:24,145 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 11:59:24,149 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 23 states have (on average 1.391304347826087) internal successors, (32), 27 states have internal predecessors, (32), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 11:59:24,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 11:59:24,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:59:24,155 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:59:24,156 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-19 11:59:24,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:59:24,161 INFO L85 PathProgramCache]: Analyzing trace with hash -387103850, now seen corresponding path program 1 times [2024-11-19 11:59:24,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:59:24,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110845079] [2024-11-19 11:59:24,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:59:24,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:59:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:59:24,406 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-19 11:59:24,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:59:24,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110845079] [2024-11-19 11:59:24,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110845079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:59:24,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:59:24,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 11:59:24,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654742818] [2024-11-19 11:59:24,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:59:24,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 11:59:24,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:59:24,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 11:59:24,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 11:59:24,435 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.391304347826087) internal successors, (32), 27 states have internal predecessors, (32), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 11:59:24,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:59:24,462 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2024-11-19 11:59:24,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 11:59:24,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-19 11:59:24,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:59:24,470 INFO L225 Difference]: With dead ends: 53 [2024-11-19 11:59:24,470 INFO L226 Difference]: Without dead ends: 20 [2024-11-19 11:59:24,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 11:59:24,476 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:59:24,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:59:24,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-19 11:59:24,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-19 11:59:24,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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-19 11:59:24,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-11-19 11:59:24,508 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 14 [2024-11-19 11:59:24,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:59:24,510 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-19 11:59:24,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 11:59:24,511 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2024-11-19 11:59:24,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 11:59:24,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:59:24,512 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:59:24,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 11:59:24,513 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-19 11:59:24,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:59:24,513 INFO L85 PathProgramCache]: Analyzing trace with hash -698058931, now seen corresponding path program 1 times [2024-11-19 11:59:24,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:59:24,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787708458] [2024-11-19 11:59:24,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:59:24,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:59:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:59:24,665 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-19 11:59:24,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:59:24,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787708458] [2024-11-19 11:59:24,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787708458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:59:24,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:59:24,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 11:59:24,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136968196] [2024-11-19 11:59:24,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:59:24,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 11:59:24,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:59:24,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 11:59:24,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 11:59:24,672 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-19 11:59:24,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:59:24,688 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2024-11-19 11:59:24,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 11:59:24,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 15 [2024-11-19 11:59:24,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:59:24,690 INFO L225 Difference]: With dead ends: 20 [2024-11-19 11:59:24,690 INFO L226 Difference]: Without dead ends: 19 [2024-11-19 11:59:24,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 11:59:24,691 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:59:24,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 35 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:59:24,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-19 11:59:24,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-19 11:59:24,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 11:59:24,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-11-19 11:59:24,696 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2024-11-19 11:59:24,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:59:24,696 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-11-19 11:59:24,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-19 11:59:24,697 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-11-19 11:59:24,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 11:59:24,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:59:24,697 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:59:24,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 11:59:24,698 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-19 11:59:24,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:59:24,698 INFO L85 PathProgramCache]: Analyzing trace with hash -164990307, now seen corresponding path program 1 times [2024-11-19 11:59:24,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:59:24,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608777010] [2024-11-19 11:59:24,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:59:24,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:59:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 11:59:24,741 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 11:59:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 11:59:24,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 11:59:24,765 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 11:59:24,766 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-19 11:59:24,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-19 11:59:24,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 11:59:24,769 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-19 11:59:24,787 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 11:59:24,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 11:59:24 BoogieIcfgContainer [2024-11-19 11:59:24,789 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 11:59:24,789 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 11:59:24,789 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 11:59:24,789 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 11:59:24,790 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:59:24" (3/4) ... [2024-11-19 11:59:24,792 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 11:59:24,793 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 11:59:24,793 INFO L158 Benchmark]: Toolchain (without parser) took 2255.10ms. Allocated memory was 169.9MB in the beginning and 222.3MB in the end (delta: 52.4MB). Free memory was 136.0MB in the beginning and 133.9MB in the end (delta: 2.1MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB. [2024-11-19 11:59:24,794 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 169.9MB. Free memory is still 138.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 11:59:24,794 INFO L158 Benchmark]: CACSL2BoogieTranslator took 994.06ms. Allocated memory is still 169.9MB. Free memory was 136.0MB in the beginning and 133.2MB in the end (delta: 2.8MB). Peak memory consumption was 67.8MB. Max. memory is 16.1GB. [2024-11-19 11:59:24,794 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.41ms. Allocated memory is still 169.9MB. Free memory was 133.2MB in the beginning and 130.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 11:59:24,795 INFO L158 Benchmark]: Boogie Preprocessor took 45.82ms. Allocated memory is still 169.9MB. Free memory was 130.3MB in the beginning and 128.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 11:59:24,795 INFO L158 Benchmark]: RCFGBuilder took 418.89ms. Allocated memory was 169.9MB in the beginning and 222.3MB in the end (delta: 52.4MB). Free memory was 128.2MB in the beginning and 178.0MB in the end (delta: -49.8MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2024-11-19 11:59:24,796 INFO L158 Benchmark]: TraceAbstraction took 727.06ms. Allocated memory is still 222.3MB. Free memory was 178.0MB in the beginning and 133.9MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-19 11:59:24,796 INFO L158 Benchmark]: Witness Printer took 3.59ms. Allocated memory is still 222.3MB. Free memory is still 133.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 11:59:24,798 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 169.9MB. Free memory is still 138.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 994.06ms. Allocated memory is still 169.9MB. Free memory was 136.0MB in the beginning and 133.2MB in the end (delta: 2.8MB). Peak memory consumption was 67.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.41ms. Allocated memory is still 169.9MB. Free memory was 133.2MB in the beginning and 130.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.82ms. Allocated memory is still 169.9MB. Free memory was 130.3MB in the beginning and 128.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 418.89ms. Allocated memory was 169.9MB in the beginning and 222.3MB in the end (delta: 52.4MB). Free memory was 128.2MB in the beginning and 178.0MB in the end (delta: -49.8MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * TraceAbstraction took 727.06ms. Allocated memory is still 222.3MB. Free memory was 178.0MB in the beginning and 133.9MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Witness Printer took 3.59ms. Allocated memory is still 222.3MB. Free memory is still 133.9MB. 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: 1576]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1559, overapproximation of large string literal at line 1588. 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] [L1588] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={5:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1588] 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] [L1589] CALL CWE190_Integer_Overflow__int_fgets_multiply_15_bad() [L1550] int data; [L1551] data = 0 [L1554] case 6: [L1556] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] case 6: [L1559] data = atoi(inputBuffer) [L1573] case 7: VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1576] data * 2 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1576]: 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, 32 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 104 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9 IncrementalHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 55 mSDtfsCounter, 9 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 45 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 29 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-19 11:59:24,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_15_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 01c9b8bd6bf6d03f55698c37d5c9b4987e10acd19718f3511ca3202d68056c02 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 11:59:27,064 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 11:59:27,138 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-19 11:59:27,144 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 11:59:27,145 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 11:59:27,146 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-19 11:59:27,185 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 11:59:27,186 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 11:59:27,186 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 11:59:27,190 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 11:59:27,190 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 11:59:27,190 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 11:59:27,191 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 11:59:27,194 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 11:59:27,195 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 11:59:27,195 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 11:59:27,195 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 11:59:27,196 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 11:59:27,196 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 11:59:27,196 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 11:59:27,196 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 11:59:27,197 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 11:59:27,197 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 11:59:27,197 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 11:59:27,197 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 11:59:27,197 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 11:59:27,198 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 11:59:27,198 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 11:59:27,198 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 11:59:27,198 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 11:59:27,199 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 11:59:27,199 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 11:59:27,199 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 11:59:27,199 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 11:59:27,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 11:59:27,199 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 11:59:27,200 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 11:59:27,200 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 11:59:27,202 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 11:59:27,202 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 11:59:27,202 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 11:59:27,203 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 11:59:27,203 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 11:59:27,203 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 11:59:27,204 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 -> 01c9b8bd6bf6d03f55698c37d5c9b4987e10acd19718f3511ca3202d68056c02 [2024-11-19 11:59:27,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 11:59:27,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 11:59:27,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 11:59:27,548 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 11:59:27,548 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 11:59:27,550 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_15_bad.i [2024-11-19 11:59:29,111 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 11:59:29,434 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 11:59:29,435 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_15_bad.i [2024-11-19 11:59:29,458 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f00f5e45/53b76468a2ee432280f3c1a964d5208f/FLAG7c9f612ef [2024-11-19 11:59:29,473 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f00f5e45/53b76468a2ee432280f3c1a964d5208f [2024-11-19 11:59:29,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 11:59:29,476 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 11:59:29,479 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 11:59:29,479 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 11:59:29,484 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 11:59:29,485 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:59:29" (1/1) ... [2024-11-19 11:59:29,485 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75d12613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:29, skipping insertion in model container [2024-11-19 11:59:29,486 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:59:29" (1/1) ... [2024-11-19 11:59:29,540 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 11:59:30,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 11:59:30,388 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 11:59:30,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 11:59:30,623 INFO L204 MainTranslator]: Completed translation [2024-11-19 11:59:30,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:30 WrapperNode [2024-11-19 11:59:30,623 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 11:59:30,624 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 11:59:30,625 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 11:59:30,625 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 11:59:30,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:30" (1/1) ... [2024-11-19 11:59:30,659 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:30" (1/1) ... [2024-11-19 11:59:30,683 INFO L138 Inliner]: procedures = 503, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 92 [2024-11-19 11:59:30,683 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 11:59:30,684 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 11:59:30,684 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 11:59:30,684 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 11:59:30,701 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:30" (1/1) ... [2024-11-19 11:59:30,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:30" (1/1) ... [2024-11-19 11:59:30,705 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:30" (1/1) ... [2024-11-19 11:59:30,719 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-19 11:59:30,719 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:30" (1/1) ... [2024-11-19 11:59:30,720 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:30" (1/1) ... [2024-11-19 11:59:30,727 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:30" (1/1) ... [2024-11-19 11:59:30,729 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:30" (1/1) ... [2024-11-19 11:59:30,731 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:30" (1/1) ... [2024-11-19 11:59:30,733 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:30" (1/1) ... [2024-11-19 11:59:30,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 11:59:30,738 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 11:59:30,738 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 11:59:30,738 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 11:59:30,739 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:30" (1/1) ... [2024-11-19 11:59:30,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 11:59:30,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:59:30,769 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-19 11:59:30,772 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-19 11:59:30,809 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-19 11:59:30,809 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-19 11:59:30,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 11:59:30,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 11:59:30,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 11:59:30,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 11:59:30,948 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 11:59:30,953 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 11:59:31,126 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-19 11:59:31,127 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 11:59:31,139 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 11:59:31,140 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 11:59:31,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:59:31 BoogieIcfgContainer [2024-11-19 11:59:31,141 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 11:59:31,142 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 11:59:31,142 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 11:59:31,146 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 11:59:31,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:59:29" (1/3) ... [2024-11-19 11:59:31,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78a8117a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:59:31, skipping insertion in model container [2024-11-19 11:59:31,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:59:30" (2/3) ... [2024-11-19 11:59:31,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78a8117a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:59:31, skipping insertion in model container [2024-11-19 11:59:31,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:59:31" (3/3) ... [2024-11-19 11:59:31,150 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_multiply_15_bad.i [2024-11-19 11:59:31,165 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 11:59:31,166 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 11:59:31,231 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 11:59:31,238 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;@53696bc3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 11:59:31,239 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 11:59:31,242 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 23 states have (on average 1.391304347826087) internal successors, (32), 27 states have internal predecessors, (32), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 11:59:31,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 11:59:31,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:59:31,252 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:59:31,252 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-19 11:59:31,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:59:31,264 INFO L85 PathProgramCache]: Analyzing trace with hash -387103850, now seen corresponding path program 1 times [2024-11-19 11:59:31,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 11:59:31,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888636584] [2024-11-19 11:59:31,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:59:31,279 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-19 11:59:31,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 11:59:31,282 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-19 11:59:31,283 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-19 11:59:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:59:31,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 11:59:31,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:59:31,444 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-19 11:59:31,444 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:59:31,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 11:59:31,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1888636584] [2024-11-19 11:59:31,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1888636584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:59:31,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:59:31,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 11:59:31,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147076322] [2024-11-19 11:59:31,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:59:31,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 11:59:31,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 11:59:31,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 11:59:31,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 11:59:31,473 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.391304347826087) internal successors, (32), 27 states have internal predecessors, (32), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 11:59:31,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:59:31,500 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2024-11-19 11:59:31,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 11:59:31,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-19 11:59:31,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:59:31,507 INFO L225 Difference]: With dead ends: 53 [2024-11-19 11:59:31,508 INFO L226 Difference]: Without dead ends: 20 [2024-11-19 11:59:31,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 11:59:31,513 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:59:31,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:59:31,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-19 11:59:31,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-19 11:59:31,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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-19 11:59:31,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-11-19 11:59:31,544 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 14 [2024-11-19 11:59:31,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:59:31,545 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-19 11:59:31,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 11:59:31,546 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2024-11-19 11:59:31,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 11:59:31,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:59:31,547 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:59:31,551 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-19 11:59:31,747 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-19 11:59:31,748 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-19 11:59:31,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:59:31,749 INFO L85 PathProgramCache]: Analyzing trace with hash -698058931, now seen corresponding path program 1 times [2024-11-19 11:59:31,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 11:59:31,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345334970] [2024-11-19 11:59:31,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:59:31,750 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-19 11:59:31,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 11:59:31,754 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-19 11:59:31,755 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-19 11:59:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:59:31,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 11:59:31,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:59:31,882 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-19 11:59:31,882 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:59:31,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 11:59:31,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345334970] [2024-11-19 11:59:31,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1345334970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:59:31,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:59:31,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 11:59:31,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721324159] [2024-11-19 11:59:31,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:59:31,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 11:59:31,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 11:59:31,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 11:59:31,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 11:59:31,886 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-19 11:59:31,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:59:31,897 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2024-11-19 11:59:31,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 11:59:31,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 15 [2024-11-19 11:59:31,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:59:31,898 INFO L225 Difference]: With dead ends: 20 [2024-11-19 11:59:31,898 INFO L226 Difference]: Without dead ends: 19 [2024-11-19 11:59:31,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 11:59:31,900 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:59:31,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 35 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:59:31,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-19 11:59:31,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-19 11:59:31,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 11:59:31,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-11-19 11:59:31,915 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2024-11-19 11:59:31,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:59:31,915 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-11-19 11:59:31,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-19 11:59:31,916 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-11-19 11:59:31,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 11:59:31,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:59:31,917 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:59:31,922 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-19 11:59:32,117 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-19 11:59:32,118 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-19 11:59:32,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:59:32,119 INFO L85 PathProgramCache]: Analyzing trace with hash -164990307, now seen corresponding path program 1 times [2024-11-19 11:59:32,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 11:59:32,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41453993] [2024-11-19 11:59:32,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:59:32,120 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-19 11:59:32,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 11:59:32,123 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 11:59:32,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 11:59:32,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 11:59:32,217 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 11:59:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 11:59:32,298 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-19 11:59:32,298 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 11:59:32,300 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-19 11:59:32,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-19 11:59:32,309 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 (4)] Forceful destruction successful, exit code 0 [2024-11-19 11:59:32,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 11:59:32,510 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-19 11:59:32,549 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 11:59:32,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 11:59:32 BoogieIcfgContainer [2024-11-19 11:59:32,556 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 11:59:32,572 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 11:59:32,576 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 11:59:32,576 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 11:59:32,577 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:59:31" (3/4) ... [2024-11-19 11:59:32,579 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 11:59:32,584 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 11:59:32,585 INFO L158 Benchmark]: Toolchain (without parser) took 3108.48ms. Allocated memory was 60.8MB in the beginning and 96.5MB in the end (delta: 35.7MB). Free memory was 27.2MB in the beginning and 65.4MB in the end (delta: -38.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 11:59:32,585 INFO L158 Benchmark]: CDTParser took 1.03ms. Allocated memory is still 39.8MB. Free memory is still 21.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 11:59:32,586 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1144.73ms. Allocated memory was 60.8MB in the beginning and 79.7MB in the end (delta: 18.9MB). Free memory was 26.9MB in the beginning and 31.6MB in the end (delta: -4.7MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2024-11-19 11:59:32,586 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.09ms. Allocated memory is still 79.7MB. Free memory was 31.6MB in the beginning and 28.3MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 11:59:32,586 INFO L158 Benchmark]: Boogie Preprocessor took 52.23ms. Allocated memory is still 79.7MB. Free memory was 28.3MB in the beginning and 50.3MB in the end (delta: -22.0MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2024-11-19 11:59:32,587 INFO L158 Benchmark]: RCFGBuilder took 403.26ms. Allocated memory is still 79.7MB. Free memory was 50.3MB in the beginning and 34.2MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 11:59:32,594 INFO L158 Benchmark]: TraceAbstraction took 1414.15ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 33.5MB in the beginning and 66.1MB in the end (delta: -32.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 11:59:32,594 INFO L158 Benchmark]: Witness Printer took 12.71ms. Allocated memory is still 96.5MB. Free memory was 66.1MB in the beginning and 65.4MB in the end (delta: 662.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 11:59:32,596 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.03ms. Allocated memory is still 39.8MB. Free memory is still 21.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1144.73ms. Allocated memory was 60.8MB in the beginning and 79.7MB in the end (delta: 18.9MB). Free memory was 26.9MB in the beginning and 31.6MB in the end (delta: -4.7MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.09ms. Allocated memory is still 79.7MB. Free memory was 31.6MB in the beginning and 28.3MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.23ms. Allocated memory is still 79.7MB. Free memory was 28.3MB in the beginning and 50.3MB in the end (delta: -22.0MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. * RCFGBuilder took 403.26ms. Allocated memory is still 79.7MB. Free memory was 50.3MB in the beginning and 34.2MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1414.15ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 33.5MB in the beginning and 66.1MB in the end (delta: -32.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 12.71ms. Allocated memory is still 96.5MB. Free memory was 66.1MB in the beginning and 65.4MB in the end (delta: 662.2kB). 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: 1576]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1559, overapproximation of large string literal at line 1588. 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] [L1588] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={5:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1588] 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] [L1589] CALL CWE190_Integer_Overflow__int_fgets_multiply_15_bad() [L1550] int data; [L1551] data = 0 [L1554] case 6: [L1556] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] case 6: [L1559] data = atoi(inputBuffer) [L1573] case 7: VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1576] data * 2 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1576]: 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, 32 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 104 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9 IncrementalHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 55 mSDtfsCounter, 9 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 45 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 29 SizeOfPredicates, 0 NumberOfNonLiveVariables, 118 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 11:59:32,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample