./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_15_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_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 9a77a47559c3db0095a0d9e91635830bd5e0732aeca71f3a76ad666eb508ddb5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 21:33:24,681 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 21:33:24,760 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-24 21:33:24,766 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 21:33:24,769 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 21:33:24,798 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 21:33:24,798 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 21:33:24,799 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 21:33:24,799 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 21:33:24,800 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 21:33:24,800 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 21:33:24,801 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 21:33:24,802 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 21:33:24,804 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 21:33:24,805 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 21:33:24,805 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 21:33:24,805 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 21:33:24,806 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 21:33:24,806 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 21:33:24,806 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 21:33:24,807 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 21:33:24,810 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 21:33:24,811 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 21:33:24,811 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 21:33:24,811 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 21:33:24,811 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 21:33:24,812 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 21:33:24,812 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 21:33:24,812 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 21:33:24,812 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 21:33:24,813 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 21:33:24,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 21:33:24,813 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 21:33:24,813 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 21:33:24,814 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 21:33:24,814 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 21:33:24,814 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 21:33:24,815 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 21:33:24,816 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 21:33:24,816 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 21:33:24,816 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 21:33:24,817 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 -> 9a77a47559c3db0095a0d9e91635830bd5e0732aeca71f3a76ad666eb508ddb5 [2024-10-24 21:33:25,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 21:33:25,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 21:33:25,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 21:33:25,108 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 21:33:25,109 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 21:33:25,110 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_15_bad.i [2024-10-24 21:33:26,594 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 21:33:26,941 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 21:33:26,942 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_15_bad.i [2024-10-24 21:33:26,975 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d767ef6e9/538b0bf768584266a2b02ab2b705a830/FLAGa3c861e17 [2024-10-24 21:33:27,169 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d767ef6e9/538b0bf768584266a2b02ab2b705a830 [2024-10-24 21:33:27,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 21:33:27,173 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 21:33:27,180 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 21:33:27,180 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 21:33:27,189 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 21:33:27,190 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:33:27" (1/1) ... [2024-10-24 21:33:27,191 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76565bc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:27, skipping insertion in model container [2024-10-24 21:33:27,191 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:33:27" (1/1) ... [2024-10-24 21:33:27,251 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 21:33:27,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 21:33:27,958 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 21:33:28,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 21:33:28,205 INFO L204 MainTranslator]: Completed translation [2024-10-24 21:33:28,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:28 WrapperNode [2024-10-24 21:33:28,206 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 21:33:28,207 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 21:33:28,208 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 21:33:28,208 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 21:33:28,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:28" (1/1) ... [2024-10-24 21:33:28,240 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:28" (1/1) ... [2024-10-24 21:33:28,276 INFO L138 Inliner]: procedures = 498, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 83 [2024-10-24 21:33:28,278 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 21:33:28,279 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 21:33:28,280 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 21:33:28,280 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 21:33:28,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:28" (1/1) ... [2024-10-24 21:33:28,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:28" (1/1) ... [2024-10-24 21:33:28,294 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:28" (1/1) ... [2024-10-24 21:33:28,325 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-10-24 21:33:28,325 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:28" (1/1) ... [2024-10-24 21:33:28,325 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:28" (1/1) ... [2024-10-24 21:33:28,335 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:28" (1/1) ... [2024-10-24 21:33:28,337 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:28" (1/1) ... [2024-10-24 21:33:28,343 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:28" (1/1) ... [2024-10-24 21:33:28,344 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:28" (1/1) ... [2024-10-24 21:33:28,350 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 21:33:28,351 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 21:33:28,354 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 21:33:28,354 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 21:33:28,355 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:28" (1/1) ... [2024-10-24 21:33:28,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 21:33:28,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 21:33:28,390 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-10-24 21:33:28,397 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-10-24 21:33:28,438 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-24 21:33:28,438 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-24 21:33:28,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 21:33:28,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 21:33:28,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 21:33:28,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 21:33:28,575 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 21:33:28,576 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 21:33:28,728 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-10-24 21:33:28,728 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 21:33:28,765 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 21:33:28,765 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 21:33:28,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:33:28 BoogieIcfgContainer [2024-10-24 21:33:28,766 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 21:33:28,768 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 21:33:28,768 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 21:33:28,771 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 21:33:28,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:33:27" (1/3) ... [2024-10-24 21:33:28,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d4db9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:33:28, skipping insertion in model container [2024-10-24 21:33:28,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:28" (2/3) ... [2024-10-24 21:33:28,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d4db9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:33:28, skipping insertion in model container [2024-10-24 21:33:28,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:33:28" (3/3) ... [2024-10-24 21:33:28,774 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_postinc_15_bad.i [2024-10-24 21:33:28,793 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 21:33:28,794 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 21:33:28,865 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 21:33:28,874 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;@2c9ae3e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 21:33:28,874 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 21:33:28,879 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 21 states have internal predecessors, (25), 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-10-24 21:33:28,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-24 21:33:28,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 21:33:28,887 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 21:33:28,888 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-24 21:33:28,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 21:33:28,893 INFO L85 PathProgramCache]: Analyzing trace with hash 212311233, now seen corresponding path program 1 times [2024-10-24 21:33:28,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 21:33:28,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552237595] [2024-10-24 21:33:28,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:33:28,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 21:33:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:33:29,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 21:33:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:33:29,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 21:33:29,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 21:33:29,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552237595] [2024-10-24 21:33:29,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552237595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 21:33:29,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 21:33:29,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 21:33:29,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161460475] [2024-10-24 21:33:29,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 21:33:29,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 21:33:29,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 21:33:29,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 21:33:29,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 21:33:29,201 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 21 states have internal predecessors, (25), 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 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 21:33:29,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 21:33:29,243 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2024-10-24 21:33:29,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 21:33:29,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-24 21:33:29,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 21:33:29,253 INFO L225 Difference]: With dead ends: 42 [2024-10-24 21:33:29,253 INFO L226 Difference]: Without dead ends: 18 [2024-10-24 21:33:29,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-24 21:33:29,259 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 21:33:29,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 21:33:29,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-10-24 21:33:29,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-10-24 21:33:29,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 21:33:29,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-10-24 21:33:29,292 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2024-10-24 21:33:29,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 21:33:29,294 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-10-24 21:33:29,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 21:33:29,294 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-10-24 21:33:29,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-24 21:33:29,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 21:33:29,295 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 21:33:29,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 21:33:29,296 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-24 21:33:29,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 21:33:29,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1958530186, now seen corresponding path program 1 times [2024-10-24 21:33:29,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 21:33:29,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146681418] [2024-10-24 21:33:29,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:33:29,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 21:33:29,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:33:29,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 21:33:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:33:29,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 21:33:29,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 21:33:29,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146681418] [2024-10-24 21:33:29,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146681418] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 21:33:29,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 21:33:29,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 21:33:29,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2405980] [2024-10-24 21:33:29,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 21:33:29,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 21:33:29,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 21:33:29,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 21:33:29,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 21:33:29,512 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 21:33:29,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 21:33:29,538 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2024-10-24 21:33:29,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 21:33:29,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-24 21:33:29,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 21:33:29,539 INFO L225 Difference]: With dead ends: 18 [2024-10-24 21:33:29,539 INFO L226 Difference]: Without dead ends: 17 [2024-10-24 21:33:29,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 21:33:29,541 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 21:33:29,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 36 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 21:33:29,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-24 21:33:29,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-10-24 21:33:29,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 21:33:29,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-10-24 21:33:29,546 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2024-10-24 21:33:29,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 21:33:29,546 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-10-24 21:33:29,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 21:33:29,546 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-10-24 21:33:29,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-24 21:33:29,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 21:33:29,547 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 21:33:29,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 21:33:29,548 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-24 21:33:29,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 21:33:29,548 INFO L85 PathProgramCache]: Analyzing trace with hash 584893693, now seen corresponding path program 1 times [2024-10-24 21:33:29,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 21:33:29,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907798578] [2024-10-24 21:33:29,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:33:29,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 21:33:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 21:33:29,586 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 21:33:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 21:33:29,629 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 21:33:29,630 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 21:33:29,631 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-10-24 21:33:29,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-10-24 21:33:29,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 21:33:29,638 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 21:33:29,657 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 21:33:29,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:33:29 BoogieIcfgContainer [2024-10-24 21:33:29,660 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 21:33:29,661 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 21:33:29,661 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 21:33:29,661 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 21:33:29,661 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:33:28" (3/4) ... [2024-10-24 21:33:29,664 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 21:33:29,666 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 21:33:29,667 INFO L158 Benchmark]: Toolchain (without parser) took 2493.71ms. Allocated memory was 146.8MB in the beginning and 188.7MB in the end (delta: 41.9MB). Free memory was 90.1MB in the beginning and 65.5MB in the end (delta: 24.6MB). Peak memory consumption was 68.3MB. Max. memory is 16.1GB. [2024-10-24 21:33:29,667 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 146.8MB. Free memory is still 80.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 21:33:29,668 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1026.83ms. Allocated memory was 146.8MB in the beginning and 188.7MB in the end (delta: 41.9MB). Free memory was 89.7MB in the beginning and 132.6MB in the end (delta: -42.9MB). Peak memory consumption was 62.0MB. Max. memory is 16.1GB. [2024-10-24 21:33:29,668 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.79ms. Allocated memory is still 188.7MB. Free memory was 132.6MB in the beginning and 129.5MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 21:33:29,668 INFO L158 Benchmark]: Boogie Preprocessor took 71.10ms. Allocated memory is still 188.7MB. Free memory was 129.5MB in the beginning and 127.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 21:33:29,669 INFO L158 Benchmark]: RCFGBuilder took 415.54ms. Allocated memory is still 188.7MB. Free memory was 127.4MB in the beginning and 111.7MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 21:33:29,670 INFO L158 Benchmark]: TraceAbstraction took 892.33ms. Allocated memory is still 188.7MB. Free memory was 110.6MB in the beginning and 65.5MB in the end (delta: 45.1MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-10-24 21:33:29,670 INFO L158 Benchmark]: Witness Printer took 5.21ms. Allocated memory is still 188.7MB. Free memory is still 65.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 21:33:29,673 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.18ms. Allocated memory is still 146.8MB. Free memory is still 80.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1026.83ms. Allocated memory was 146.8MB in the beginning and 188.7MB in the end (delta: 41.9MB). Free memory was 89.7MB in the beginning and 132.6MB in the end (delta: -42.9MB). Peak memory consumption was 62.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.79ms. Allocated memory is still 188.7MB. Free memory was 132.6MB in the beginning and 129.5MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.10ms. Allocated memory is still 188.7MB. Free memory was 129.5MB in the beginning and 127.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 415.54ms. Allocated memory is still 188.7MB. Free memory was 127.4MB in the beginning and 111.7MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 892.33ms. Allocated memory is still 188.7MB. Free memory was 110.6MB in the beginning and 65.5MB in the end (delta: 45.1MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Witness Printer took 5.21ms. Allocated memory is still 188.7MB. Free memory is still 65.5MB. 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: 1575]: 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); [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_postinc_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: [L1575] data++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1575]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 40 mSDtfsCounter, 22 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=0, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 23 ConstructedInterpolants, 0 QuantifiedInterpolants, 39 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-10-24 21:33:29,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_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 9a77a47559c3db0095a0d9e91635830bd5e0732aeca71f3a76ad666eb508ddb5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 21:33:32,022 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 21:33:32,106 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-10-24 21:33:32,112 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 21:33:32,113 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 21:33:32,114 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-10-24 21:33:32,146 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 21:33:32,147 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 21:33:32,148 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 21:33:32,149 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 21:33:32,150 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 21:33:32,151 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 21:33:32,151 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 21:33:32,152 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 21:33:32,155 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 21:33:32,155 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 21:33:32,155 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 21:33:32,156 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 21:33:32,156 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 21:33:32,156 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 21:33:32,156 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 21:33:32,157 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 21:33:32,157 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 21:33:32,157 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 21:33:32,157 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 21:33:32,158 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 21:33:32,158 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 21:33:32,158 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 21:33:32,158 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 21:33:32,159 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 21:33:32,159 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 21:33:32,159 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 21:33:32,159 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 21:33:32,159 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 21:33:32,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 21:33:32,160 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 21:33:32,163 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 21:33:32,163 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 21:33:32,163 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 21:33:32,164 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 21:33:32,164 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 21:33:32,164 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 21:33:32,164 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 21:33:32,165 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 21:33:32,165 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 21:33:32,165 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 -> 9a77a47559c3db0095a0d9e91635830bd5e0732aeca71f3a76ad666eb508ddb5 [2024-10-24 21:33:32,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 21:33:32,483 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 21:33:32,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 21:33:32,488 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 21:33:32,489 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 21:33:32,491 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_15_bad.i [2024-10-24 21:33:33,990 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 21:33:34,347 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 21:33:34,348 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_15_bad.i [2024-10-24 21:33:34,376 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3121f2950/5ce243c6dd8a44de8466f0802462fd87/FLAG5b13f5c96 [2024-10-24 21:33:34,393 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3121f2950/5ce243c6dd8a44de8466f0802462fd87 [2024-10-24 21:33:34,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 21:33:34,397 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 21:33:34,398 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 21:33:34,399 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 21:33:34,405 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 21:33:34,406 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:33:34" (1/1) ... [2024-10-24 21:33:34,407 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22649bdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:34, skipping insertion in model container [2024-10-24 21:33:34,408 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:33:34" (1/1) ... [2024-10-24 21:33:34,464 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 21:33:35,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 21:33:35,191 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 21:33:35,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 21:33:35,440 INFO L204 MainTranslator]: Completed translation [2024-10-24 21:33:35,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:35 WrapperNode [2024-10-24 21:33:35,441 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 21:33:35,442 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 21:33:35,442 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 21:33:35,442 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 21:33:35,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:35" (1/1) ... [2024-10-24 21:33:35,488 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:35" (1/1) ... [2024-10-24 21:33:35,523 INFO L138 Inliner]: procedures = 503, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 82 [2024-10-24 21:33:35,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 21:33:35,525 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 21:33:35,525 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 21:33:35,525 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 21:33:35,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:35" (1/1) ... [2024-10-24 21:33:35,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:35" (1/1) ... [2024-10-24 21:33:35,541 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:35" (1/1) ... [2024-10-24 21:33:35,561 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-10-24 21:33:35,561 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:35" (1/1) ... [2024-10-24 21:33:35,562 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:35" (1/1) ... [2024-10-24 21:33:35,573 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:35" (1/1) ... [2024-10-24 21:33:35,575 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:35" (1/1) ... [2024-10-24 21:33:35,578 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:35" (1/1) ... [2024-10-24 21:33:35,584 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:35" (1/1) ... [2024-10-24 21:33:35,587 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 21:33:35,589 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 21:33:35,589 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 21:33:35,589 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 21:33:35,590 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:35" (1/1) ... [2024-10-24 21:33:35,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 21:33:35,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 21:33:35,636 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-10-24 21:33:35,639 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-10-24 21:33:35,679 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-24 21:33:35,680 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-24 21:33:35,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 21:33:35,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 21:33:35,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 21:33:35,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 21:33:35,855 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 21:33:35,857 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 21:33:36,006 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-10-24 21:33:36,006 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 21:33:36,051 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 21:33:36,051 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 21:33:36,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:33:36 BoogieIcfgContainer [2024-10-24 21:33:36,052 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 21:33:36,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 21:33:36,055 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 21:33:36,058 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 21:33:36,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:33:34" (1/3) ... [2024-10-24 21:33:36,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49aa237d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:33:36, skipping insertion in model container [2024-10-24 21:33:36,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:35" (2/3) ... [2024-10-24 21:33:36,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49aa237d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:33:36, skipping insertion in model container [2024-10-24 21:33:36,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:33:36" (3/3) ... [2024-10-24 21:33:36,062 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_postinc_15_bad.i [2024-10-24 21:33:36,079 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 21:33:36,080 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 21:33:36,141 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 21:33:36,148 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;@411a62e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 21:33:36,150 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 21:33:36,154 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 21 states have internal predecessors, (25), 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-10-24 21:33:36,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-24 21:33:36,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 21:33:36,161 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 21:33:36,161 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-24 21:33:36,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 21:33:36,169 INFO L85 PathProgramCache]: Analyzing trace with hash 212311233, now seen corresponding path program 1 times [2024-10-24 21:33:36,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 21:33:36,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862890669] [2024-10-24 21:33:36,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:33:36,183 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-10-24 21:33:36,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 21:33:36,187 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-10-24 21:33:36,188 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-10-24 21:33:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:33:36,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 21:33:36,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 21:33:36,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 21:33:36,337 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 21:33:36,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 21:33:36,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1862890669] [2024-10-24 21:33:36,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1862890669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 21:33:36,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 21:33:36,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 21:33:36,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904195956] [2024-10-24 21:33:36,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 21:33:36,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 21:33:36,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 21:33:36,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 21:33:36,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 21:33:36,369 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 21 states have internal predecessors, (25), 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 2 states, 1 states have (on average 10.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 21:33:36,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 21:33:36,400 INFO L93 Difference]: Finished difference Result 26 states and 35 transitions. [2024-10-24 21:33:36,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 21:33:36,403 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 10.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-24 21:33:36,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 21:33:36,409 INFO L225 Difference]: With dead ends: 26 [2024-10-24 21:33:36,409 INFO L226 Difference]: Without dead ends: 19 [2024-10-24 21:33:36,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 21:33:36,417 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 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-10-24 21:33:36,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 21:33:36,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-24 21:33:36,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-10-24 21:33:36,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 21:33:36,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2024-10-24 21:33:36,449 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 12 [2024-10-24 21:33:36,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 21:33:36,450 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2024-10-24 21:33:36,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 10.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 21:33:36,451 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2024-10-24 21:33:36,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-24 21:33:36,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 21:33:36,452 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 21:33:36,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 21:33:36,656 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-10-24 21:33:36,656 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-24 21:33:36,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 21:33:36,657 INFO L85 PathProgramCache]: Analyzing trace with hash -2008286298, now seen corresponding path program 1 times [2024-10-24 21:33:36,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 21:33:36,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394156015] [2024-10-24 21:33:36,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:33:36,658 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-10-24 21:33:36,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 21:33:36,662 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-10-24 21:33:36,663 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-10-24 21:33:36,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:33:36,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 21:33:36,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 21:33:36,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 21:33:36,765 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 21:33:36,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 21:33:36,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394156015] [2024-10-24 21:33:36,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394156015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 21:33:36,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 21:33:36,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 21:33:36,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000366062] [2024-10-24 21:33:36,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 21:33:36,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 21:33:36,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 21:33:36,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 21:33:36,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 21:33:36,771 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 21:33:36,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 21:33:36,788 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2024-10-24 21:33:36,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 21:33:36,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-24 21:33:36,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 21:33:36,789 INFO L225 Difference]: With dead ends: 28 [2024-10-24 21:33:36,789 INFO L226 Difference]: Without dead ends: 17 [2024-10-24 21:33:36,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-10-24 21:33:36,791 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 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-10-24 21:33:36,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 21:33:36,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-24 21:33:36,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-10-24 21:33:36,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 21:33:36,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-10-24 21:33:36,798 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2024-10-24 21:33:36,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 21:33:36,798 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-10-24 21:33:36,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 21:33:36,799 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-10-24 21:33:36,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-24 21:33:36,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 21:33:36,800 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 21:33:36,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 21:33:37,001 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-10-24 21:33:37,002 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-24 21:33:37,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 21:33:37,003 INFO L85 PathProgramCache]: Analyzing trace with hash 584893693, now seen corresponding path program 1 times [2024-10-24 21:33:37,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 21:33:37,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910960694] [2024-10-24 21:33:37,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:33:37,004 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-10-24 21:33:37,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 21:33:37,007 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-10-24 21:33:37,008 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-10-24 21:33:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 21:33:37,078 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 21:33:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 21:33:37,128 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-24 21:33:37,128 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 21:33:37,129 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-10-24 21:33:37,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-10-24 21:33:37,138 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-10-24 21:33:37,336 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-10-24 21:33:37,339 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 21:33:37,372 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 21:33:37,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:33:37 BoogieIcfgContainer [2024-10-24 21:33:37,379 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 21:33:37,380 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 21:33:37,380 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 21:33:37,382 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 21:33:37,383 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:33:36" (3/4) ... [2024-10-24 21:33:37,388 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 21:33:37,393 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 21:33:37,394 INFO L158 Benchmark]: Toolchain (without parser) took 2997.08ms. Allocated memory was 71.3MB in the beginning and 94.4MB in the end (delta: 23.1MB). Free memory was 39.1MB in the beginning and 63.3MB in the end (delta: -24.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 21:33:37,394 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 50.3MB. Free memory is still 32.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 21:33:37,395 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1043.20ms. Allocated memory was 71.3MB in the beginning and 94.4MB in the end (delta: 23.1MB). Free memory was 38.8MB in the beginning and 46.9MB in the end (delta: -8.1MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2024-10-24 21:33:37,395 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.95ms. Allocated memory is still 94.4MB. Free memory was 46.9MB in the beginning and 43.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 21:33:37,395 INFO L158 Benchmark]: Boogie Preprocessor took 62.99ms. Allocated memory is still 94.4MB. Free memory was 43.6MB in the beginning and 41.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 21:33:37,396 INFO L158 Benchmark]: RCFGBuilder took 463.35ms. Allocated memory is still 94.4MB. Free memory was 41.1MB in the beginning and 49.9MB in the end (delta: -8.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 21:33:37,396 INFO L158 Benchmark]: TraceAbstraction took 1324.21ms. Allocated memory is still 94.4MB. Free memory was 49.3MB in the beginning and 63.3MB in the end (delta: -14.0MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-10-24 21:33:37,399 INFO L158 Benchmark]: Witness Printer took 13.48ms. Allocated memory is still 94.4MB. Free memory is still 63.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 21:33:37,401 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 50.3MB. Free memory is still 32.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1043.20ms. Allocated memory was 71.3MB in the beginning and 94.4MB in the end (delta: 23.1MB). Free memory was 38.8MB in the beginning and 46.9MB in the end (delta: -8.1MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.95ms. Allocated memory is still 94.4MB. Free memory was 46.9MB in the beginning and 43.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.99ms. Allocated memory is still 94.4MB. Free memory was 43.6MB in the beginning and 41.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 463.35ms. Allocated memory is still 94.4MB. Free memory was 41.1MB in the beginning and 49.9MB in the end (delta: -8.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1324.21ms. Allocated memory is still 94.4MB. Free memory was 49.3MB in the beginning and 63.3MB in the end (delta: -14.0MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * Witness Printer took 13.48ms. Allocated memory is still 94.4MB. Free memory is still 63.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1575]: 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); [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_postinc_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: [L1575] data++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1575]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9 IncrementalHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 47 mSDtfsCounter, 9 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 23 ConstructedInterpolants, 0 QuantifiedInterpolants, 23 SizeOfPredicates, 0 NumberOfNonLiveVariables, 95 ConjunctsInSsa, 3 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-10-24 21:33:37,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample