./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_16_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_16_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 d03d41497e0f5058a2c8524383adbc0c8d28214654016469a458919e0265b126 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 20:27:12,704 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 20:27:12,799 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-10 20:27:12,803 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 20:27:12,804 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 20:27:12,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 20:27:12,828 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 20:27:12,829 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 20:27:12,829 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 20:27:12,830 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 20:27:12,831 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 20:27:12,832 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 20:27:12,832 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 20:27:12,833 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 20:27:12,834 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 20:27:12,835 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 20:27:12,835 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 20:27:12,835 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 20:27:12,835 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 20:27:12,836 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 20:27:12,836 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 20:27:12,840 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 20:27:12,840 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 20:27:12,840 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 20:27:12,840 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 20:27:12,841 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 20:27:12,841 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 20:27:12,841 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 20:27:12,841 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 20:27:12,842 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 20:27:12,842 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 20:27:12,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 20:27:12,842 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 20:27:12,843 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 20:27:12,843 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 20:27:12,843 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 20:27:12,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 20:27:12,844 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 20:27:12,844 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 20:27:12,844 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 20:27:12,844 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 20:27:12,846 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 -> d03d41497e0f5058a2c8524383adbc0c8d28214654016469a458919e0265b126 [2024-11-10 20:27:13,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 20:27:13,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 20:27:13,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 20:27:13,145 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 20:27:13,145 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 20:27:13,146 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_16_bad.i [2024-11-10 20:27:14,611 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 20:27:14,944 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 20:27:14,946 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_16_bad.i [2024-11-10 20:27:14,967 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31bf031ac/57eb345474e448b2b387f47501f49976/FLAG5580a4be1 [2024-11-10 20:27:14,983 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31bf031ac/57eb345474e448b2b387f47501f49976 [2024-11-10 20:27:14,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 20:27:14,987 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 20:27:14,990 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 20:27:14,991 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 20:27:14,996 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 20:27:14,997 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:27:14" (1/1) ... [2024-11-10 20:27:14,998 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18f26a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:14, skipping insertion in model container [2024-11-10 20:27:14,998 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:27:14" (1/1) ... [2024-11-10 20:27:15,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 20:27:15,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 20:27:15,807 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 20:27:15,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 20:27:16,134 INFO L204 MainTranslator]: Completed translation [2024-11-10 20:27:16,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:16 WrapperNode [2024-11-10 20:27:16,135 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 20:27:16,136 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 20:27:16,137 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 20:27:16,137 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 20:27:16,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:16" (1/1) ... [2024-11-10 20:27:16,177 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:16" (1/1) ... [2024-11-10 20:27:16,202 INFO L138 Inliner]: procedures = 498, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2024-11-10 20:27:16,203 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 20:27:16,204 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 20:27:16,204 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 20:27:16,204 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 20:27:16,213 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:16" (1/1) ... [2024-11-10 20:27:16,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:16" (1/1) ... [2024-11-10 20:27:16,216 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:16" (1/1) ... [2024-11-10 20:27:16,236 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2024-11-10 20:27:16,237 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:16" (1/1) ... [2024-11-10 20:27:16,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:16" (1/1) ... [2024-11-10 20:27:16,241 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:16" (1/1) ... [2024-11-10 20:27:16,242 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:16" (1/1) ... [2024-11-10 20:27:16,243 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:16" (1/1) ... [2024-11-10 20:27:16,244 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:16" (1/1) ... [2024-11-10 20:27:16,247 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 20:27:16,248 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 20:27:16,248 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 20:27:16,248 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 20:27:16,249 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:16" (1/1) ... [2024-11-10 20:27:16,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 20:27:16,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 20:27:16,294 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 20:27:16,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 20:27:16,339 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-10 20:27:16,339 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-10 20:27:16,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 20:27:16,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 20:27:16,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 20:27:16,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 20:27:16,514 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 20:27:16,516 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 20:27:16,654 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-10 20:27:16,657 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 20:27:16,671 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 20:27:16,672 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 20:27:16,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:27:16 BoogieIcfgContainer [2024-11-10 20:27:16,674 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 20:27:16,676 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 20:27:16,677 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 20:27:16,680 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 20:27:16,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:27:14" (1/3) ... [2024-11-10 20:27:16,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f37bcd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:27:16, skipping insertion in model container [2024-11-10 20:27:16,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:16" (2/3) ... [2024-11-10 20:27:16,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f37bcd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:27:16, skipping insertion in model container [2024-11-10 20:27:16,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:27:16" (3/3) ... [2024-11-10 20:27:16,684 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_multiply_16_bad.i [2024-11-10 20:27:16,701 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 20:27:16,702 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 20:27:16,768 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 20:27:16,774 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;@73447946, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 20:27:16,774 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 20:27:16,778 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 20:27:16,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 20:27:16,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 20:27:16,786 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 20:27:16,788 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 20:27:16,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 20:27:16,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1649752907, now seen corresponding path program 1 times [2024-11-10 20:27:16,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 20:27:16,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687449187] [2024-11-10 20:27:16,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 20:27:16,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 20:27:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 20:27:17,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 20:27:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 20:27:17,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 20:27:17,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 20:27:17,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687449187] [2024-11-10 20:27:17,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687449187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 20:27:17,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 20:27:17,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 20:27:17,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651363095] [2024-11-10 20:27:17,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 20:27:17,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 20:27:17,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 20:27:17,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 20:27:17,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 20:27:17,085 INFO L87 Difference]: Start difference. First operand has 29 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 20:27:17,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 20:27:17,099 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2024-11-10 20:27:17,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 20:27:17,101 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-10 20:27:17,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 20:27:17,107 INFO L225 Difference]: With dead ends: 48 [2024-11-10 20:27:17,107 INFO L226 Difference]: Without dead ends: 21 [2024-11-10 20:27:17,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 20:27:17,113 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 20:27:17,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 20:27:17,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-10 20:27:17,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-10 20:27:17,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 20:27:17,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2024-11-10 20:27:17,142 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 13 [2024-11-10 20:27:17,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 20:27:17,143 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-11-10 20:27:17,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 20:27:17,143 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2024-11-10 20:27:17,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 20:27:17,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 20:27:17,144 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 20:27:17,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 20:27:17,145 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 20:27:17,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 20:27:17,145 INFO L85 PathProgramCache]: Analyzing trace with hash -859399346, now seen corresponding path program 1 times [2024-11-10 20:27:17,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 20:27:17,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727681725] [2024-11-10 20:27:17,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 20:27:17,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 20:27:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 20:27:17,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 20:27:17,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 20:27:17,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 20:27:17,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 20:27:17,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727681725] [2024-11-10 20:27:17,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727681725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 20:27:17,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 20:27:17,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 20:27:17,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517927866] [2024-11-10 20:27:17,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 20:27:17,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 20:27:17,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 20:27:17,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 20:27:17,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 20:27:17,284 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 20:27:17,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 20:27:17,307 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2024-11-10 20:27:17,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 20:27:17,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 16 [2024-11-10 20:27:17,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 20:27:17,309 INFO L225 Difference]: With dead ends: 21 [2024-11-10 20:27:17,309 INFO L226 Difference]: Without dead ends: 20 [2024-11-10 20:27:17,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 20:27:17,311 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 20:27:17,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 37 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 20:27:17,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-10 20:27:17,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-10 20:27:17,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 20:27:17,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-11-10 20:27:17,317 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 16 [2024-11-10 20:27:17,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 20:27:17,317 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-10 20:27:17,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 20:27:17,318 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2024-11-10 20:27:17,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 20:27:17,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 20:27:17,320 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 20:27:17,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 20:27:17,320 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 20:27:17,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 20:27:17,321 INFO L85 PathProgramCache]: Analyzing trace with hash -871575969, now seen corresponding path program 1 times [2024-11-10 20:27:17,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 20:27:17,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985475770] [2024-11-10 20:27:17,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 20:27:17,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 20:27:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 20:27:17,375 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 20:27:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 20:27:17,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 20:27:17,435 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 20:27:17,438 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-10 20:27:17,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-10 20:27:17,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 20:27:17,445 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 20:27:17,464 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 20:27:17,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:27:17 BoogieIcfgContainer [2024-11-10 20:27:17,469 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 20:27:17,470 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 20:27:17,470 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 20:27:17,470 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 20:27:17,471 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:27:16" (3/4) ... [2024-11-10 20:27:17,473 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 20:27:17,474 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 20:27:17,475 INFO L158 Benchmark]: Toolchain (without parser) took 2487.47ms. Allocated memory was 167.8MB in the beginning and 239.1MB in the end (delta: 71.3MB). Free memory was 105.8MB in the beginning and 110.6MB in the end (delta: -4.8MB). Peak memory consumption was 68.0MB. Max. memory is 16.1GB. [2024-11-10 20:27:17,475 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 167.8MB. Free memory is still 129.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 20:27:17,476 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1144.98ms. Allocated memory was 167.8MB in the beginning and 239.1MB in the end (delta: 71.3MB). Free memory was 105.8MB in the beginning and 174.6MB in the end (delta: -68.8MB). Peak memory consumption was 53.3MB. Max. memory is 16.1GB. [2024-11-10 20:27:17,480 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.25ms. Allocated memory is still 239.1MB. Free memory was 174.6MB in the beginning and 172.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 20:27:17,481 INFO L158 Benchmark]: Boogie Preprocessor took 43.41ms. Allocated memory is still 239.1MB. Free memory was 172.5MB in the beginning and 170.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 20:27:17,481 INFO L158 Benchmark]: IcfgBuilder took 425.95ms. Allocated memory is still 239.1MB. Free memory was 170.4MB in the beginning and 155.7MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 20:27:17,481 INFO L158 Benchmark]: TraceAbstraction took 793.35ms. Allocated memory is still 239.1MB. Free memory was 154.7MB in the beginning and 110.6MB in the end (delta: 44.1MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-10 20:27:17,481 INFO L158 Benchmark]: Witness Printer took 4.59ms. Allocated memory is still 239.1MB. Free memory is still 110.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 20:27:17,483 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.19ms. Allocated memory is still 167.8MB. Free memory is still 129.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1144.98ms. Allocated memory was 167.8MB in the beginning and 239.1MB in the end (delta: 71.3MB). Free memory was 105.8MB in the beginning and 174.6MB in the end (delta: -68.8MB). Peak memory consumption was 53.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.25ms. Allocated memory is still 239.1MB. Free memory was 174.6MB in the beginning and 172.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.41ms. Allocated memory is still 239.1MB. Free memory was 172.5MB in the beginning and 170.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 425.95ms. Allocated memory is still 239.1MB. Free memory was 170.4MB in the beginning and 155.7MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 793.35ms. Allocated memory is still 239.1MB. Free memory was 154.7MB in the beginning and 110.6MB in the end (delta: 44.1MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Witness Printer took 4.59ms. Allocated memory is still 239.1MB. Free memory is still 110.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1571]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1558, overapproximation of large string literal at line 1580, overapproximation of fgets at line 1556. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1580] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1580] 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] [L1581] CALL CWE190_Integer_Overflow__int_fgets_multiply_16_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE 1 [L1555] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1558] data = atoi(inputBuffer) [L1567] COND TRUE 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1569] COND TRUE data > 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1571] data * 2 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1571]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 70 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 53 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred 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.2s InterpolantComputationTime, 46 NumberOfCodeBlocks, 46 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 29 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 20:27:17,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_16_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 d03d41497e0f5058a2c8524383adbc0c8d28214654016469a458919e0265b126 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 20:27:19,783 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 20:27:19,856 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-10 20:27:19,861 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 20:27:19,861 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 20:27:19,862 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-10 20:27:19,893 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 20:27:19,897 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 20:27:19,898 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 20:27:19,899 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 20:27:19,901 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 20:27:19,901 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 20:27:19,901 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 20:27:19,902 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 20:27:19,905 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 20:27:19,905 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 20:27:19,905 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 20:27:19,906 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 20:27:19,906 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 20:27:19,906 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 20:27:19,906 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 20:27:19,908 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 20:27:19,908 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 20:27:19,909 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 20:27:19,909 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 20:27:19,909 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 20:27:19,909 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 20:27:19,910 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 20:27:19,910 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 20:27:19,910 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 20:27:19,910 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 20:27:19,910 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 20:27:19,911 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 20:27:19,911 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 20:27:19,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 20:27:19,911 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 20:27:19,911 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 20:27:19,912 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 20:27:19,912 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 20:27:19,912 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 20:27:19,914 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 20:27:19,914 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 20:27:19,914 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 20:27:19,915 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 20:27:19,915 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 -> d03d41497e0f5058a2c8524383adbc0c8d28214654016469a458919e0265b126 [2024-11-10 20:27:20,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 20:27:20,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 20:27:20,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 20:27:20,287 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 20:27:20,288 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 20:27:20,290 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_16_bad.i [2024-11-10 20:27:21,863 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 20:27:22,227 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 20:27:22,229 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_16_bad.i [2024-11-10 20:27:22,262 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c16104a21/e611724782ba4329bbfc7ab3562db3f7/FLAGd7963932d [2024-11-10 20:27:22,280 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c16104a21/e611724782ba4329bbfc7ab3562db3f7 [2024-11-10 20:27:22,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 20:27:22,286 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 20:27:22,287 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 20:27:22,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 20:27:22,294 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 20:27:22,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:27:22" (1/1) ... [2024-11-10 20:27:22,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61314d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:22, skipping insertion in model container [2024-11-10 20:27:22,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:27:22" (1/1) ... [2024-11-10 20:27:22,365 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 20:27:23,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 20:27:23,103 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 20:27:23,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 20:27:23,360 INFO L204 MainTranslator]: Completed translation [2024-11-10 20:27:23,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:23 WrapperNode [2024-11-10 20:27:23,361 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 20:27:23,362 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 20:27:23,362 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 20:27:23,362 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 20:27:23,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:23" (1/1) ... [2024-11-10 20:27:23,406 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:23" (1/1) ... [2024-11-10 20:27:23,426 INFO L138 Inliner]: procedures = 503, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 72 [2024-11-10 20:27:23,427 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 20:27:23,429 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 20:27:23,429 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 20:27:23,429 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 20:27:23,437 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:23" (1/1) ... [2024-11-10 20:27:23,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:23" (1/1) ... [2024-11-10 20:27:23,441 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:23" (1/1) ... [2024-11-10 20:27:23,460 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2024-11-10 20:27:23,460 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:23" (1/1) ... [2024-11-10 20:27:23,460 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:23" (1/1) ... [2024-11-10 20:27:23,467 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:23" (1/1) ... [2024-11-10 20:27:23,468 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:23" (1/1) ... [2024-11-10 20:27:23,470 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:23" (1/1) ... [2024-11-10 20:27:23,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:23" (1/1) ... [2024-11-10 20:27:23,475 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 20:27:23,476 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 20:27:23,476 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 20:27:23,476 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 20:27:23,477 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:23" (1/1) ... [2024-11-10 20:27:23,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 20:27:23,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 20:27:23,520 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 20:27:23,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 20:27:23,573 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-10 20:27:23,573 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-10 20:27:23,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 20:27:23,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 20:27:23,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 20:27:23,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 20:27:23,738 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 20:27:23,741 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 20:27:23,893 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-10 20:27:23,893 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 20:27:23,908 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 20:27:23,908 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 20:27:23,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:27:23 BoogieIcfgContainer [2024-11-10 20:27:23,909 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 20:27:23,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 20:27:23,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 20:27:23,915 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 20:27:23,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:27:22" (1/3) ... [2024-11-10 20:27:23,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5af672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:27:23, skipping insertion in model container [2024-11-10 20:27:23,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:27:23" (2/3) ... [2024-11-10 20:27:23,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5af672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:27:23, skipping insertion in model container [2024-11-10 20:27:23,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:27:23" (3/3) ... [2024-11-10 20:27:23,920 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_multiply_16_bad.i [2024-11-10 20:27:23,934 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 20:27:23,934 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 20:27:23,993 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 20:27:24,001 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;@76380ada, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 20:27:24,002 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 20:27:24,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 20:27:24,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 20:27:24,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 20:27:24,012 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 20:27:24,013 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 20:27:24,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 20:27:24,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1649752907, now seen corresponding path program 1 times [2024-11-10 20:27:24,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 20:27:24,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [996692427] [2024-11-10 20:27:24,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 20:27:24,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 20:27:24,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 20:27:24,037 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 20:27:24,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 20:27:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 20:27:24,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 20:27:24,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 20:27:24,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 20:27:24,194 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 20:27:24,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 20:27:24,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [996692427] [2024-11-10 20:27:24,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [996692427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 20:27:24,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 20:27:24,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 20:27:24,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067179683] [2024-11-10 20:27:24,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 20:27:24,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 20:27:24,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 20:27:24,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 20:27:24,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 20:27:24,229 INFO L87 Difference]: Start difference. First operand has 29 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 20:27:24,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 20:27:24,243 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2024-11-10 20:27:24,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 20:27:24,245 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-10 20:27:24,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 20:27:24,251 INFO L225 Difference]: With dead ends: 48 [2024-11-10 20:27:24,252 INFO L226 Difference]: Without dead ends: 21 [2024-11-10 20:27:24,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 20:27:24,258 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 20:27:24,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 20:27:24,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-10 20:27:24,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-10 20:27:24,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 20:27:24,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2024-11-10 20:27:24,290 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 13 [2024-11-10 20:27:24,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 20:27:24,291 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-11-10 20:27:24,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 20:27:24,291 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2024-11-10 20:27:24,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 20:27:24,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 20:27:24,293 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 20:27:24,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 20:27:24,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 20:27:24,494 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 20:27:24,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 20:27:24,495 INFO L85 PathProgramCache]: Analyzing trace with hash -859399346, now seen corresponding path program 1 times [2024-11-10 20:27:24,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 20:27:24,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595113473] [2024-11-10 20:27:24,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 20:27:24,496 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 20:27:24,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 20:27:24,498 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 20:27:24,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 20:27:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 20:27:24,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 20:27:24,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 20:27:24,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 20:27:24,730 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 20:27:24,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 20:27:24,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595113473] [2024-11-10 20:27:24,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [595113473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 20:27:24,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 20:27:24,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 20:27:24,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116381917] [2024-11-10 20:27:24,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 20:27:24,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 20:27:24,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 20:27:24,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 20:27:24,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 20:27:24,735 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 20:27:24,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 20:27:24,749 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2024-11-10 20:27:24,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 20:27:24,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 16 [2024-11-10 20:27:24,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 20:27:24,752 INFO L225 Difference]: With dead ends: 21 [2024-11-10 20:27:24,752 INFO L226 Difference]: Without dead ends: 20 [2024-11-10 20:27:24,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 20:27:24,753 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 20:27:24,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 37 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 20:27:24,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-10 20:27:24,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-10 20:27:24,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 20:27:24,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-11-10 20:27:24,758 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 16 [2024-11-10 20:27:24,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 20:27:24,758 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-10 20:27:24,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 20:27:24,759 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2024-11-10 20:27:24,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 20:27:24,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 20:27:24,760 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 20:27:24,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 20:27:24,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 20:27:24,968 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 20:27:24,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 20:27:24,968 INFO L85 PathProgramCache]: Analyzing trace with hash -871575969, now seen corresponding path program 1 times [2024-11-10 20:27:24,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 20:27:24,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [464839886] [2024-11-10 20:27:24,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 20:27:24,969 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 20:27:24,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 20:27:24,971 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 20:27:24,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 20:27:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 20:27:25,058 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 20:27:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 20:27:25,116 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-10 20:27:25,116 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 20:27:25,117 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-10 20:27:25,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-10 20:27:25,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-10 20:27:25,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 20:27:25,327 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 20:27:25,369 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 20:27:25,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:27:25 BoogieIcfgContainer [2024-11-10 20:27:25,373 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 20:27:25,377 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 20:27:25,377 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 20:27:25,377 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 20:27:25,377 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:27:23" (3/4) ... [2024-11-10 20:27:25,401 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 20:27:25,402 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 20:27:25,407 INFO L158 Benchmark]: Toolchain (without parser) took 3121.15ms. Allocated memory was 62.9MB in the beginning and 92.3MB in the end (delta: 29.4MB). Free memory was 35.5MB in the beginning and 61.8MB in the end (delta: -26.3MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. [2024-11-10 20:27:25,407 INFO L158 Benchmark]: CDTParser took 0.90ms. Allocated memory is still 44.0MB. Free memory is still 29.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 20:27:25,408 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1074.15ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 35.2MB in the beginning and 32.9MB in the end (delta: 2.3MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2024-11-10 20:27:25,408 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.82ms. Allocated memory is still 75.5MB. Free memory was 32.9MB in the beginning and 29.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 20:27:25,408 INFO L158 Benchmark]: Boogie Preprocessor took 46.34ms. Allocated memory is still 75.5MB. Free memory was 29.5MB in the beginning and 27.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 20:27:25,409 INFO L158 Benchmark]: IcfgBuilder took 433.14ms. Allocated memory is still 75.5MB. Free memory was 27.1MB in the beginning and 34.5MB in the end (delta: -7.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 20:27:25,409 INFO L158 Benchmark]: TraceAbstraction took 1464.17ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 34.0MB in the beginning and 61.9MB in the end (delta: -27.8MB). Peak memory consumption was 14.1kB. Max. memory is 16.1GB. [2024-11-10 20:27:25,409 INFO L158 Benchmark]: Witness Printer took 29.48ms. Allocated memory is still 92.3MB. Free memory was 61.9MB in the beginning and 61.8MB in the end (delta: 60.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 20:27:25,416 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.90ms. Allocated memory is still 44.0MB. Free memory is still 29.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1074.15ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 35.2MB in the beginning and 32.9MB in the end (delta: 2.3MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.82ms. Allocated memory is still 75.5MB. Free memory was 32.9MB in the beginning and 29.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.34ms. Allocated memory is still 75.5MB. Free memory was 29.5MB in the beginning and 27.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 433.14ms. Allocated memory is still 75.5MB. Free memory was 27.1MB in the beginning and 34.5MB in the end (delta: -7.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1464.17ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 34.0MB in the beginning and 61.9MB in the end (delta: -27.8MB). Peak memory consumption was 14.1kB. Max. memory is 16.1GB. * Witness Printer took 29.48ms. Allocated memory is still 92.3MB. Free memory was 61.9MB in the beginning and 61.8MB in the end (delta: 60.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1571]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1558, overapproximation of large string literal at line 1580, overapproximation of fgets at line 1556. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1580] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1580] 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] [L1581] CALL CWE190_Integer_Overflow__int_fgets_multiply_16_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE 1 [L1555] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1556] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1558] data = atoi(inputBuffer) [L1567] COND TRUE 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1569] COND TRUE data > 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1571] data * 2 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1571]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 70 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 53 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred 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, 46 NumberOfCodeBlocks, 46 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 29 SizeOfPredicates, 0 NumberOfNonLiveVariables, 106 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-11-10 20:27:25,446 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