./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_17_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3289d67d 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/CWE191_Integer_Underflow__int_fgets_postdec_17_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 bbc64fd25d0eb5fa31633a8c76dba801bfa80f4d9146ca588047e7c404032713 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 06:50:08,579 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 06:50:08,629 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-17 06:50:08,632 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 06:50:08,633 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 06:50:08,654 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 06:50:08,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 06:50:08,655 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 06:50:08,656 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 06:50:08,656 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 06:50:08,656 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 06:50:08,656 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 06:50:08,657 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 06:50:08,657 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 06:50:08,657 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 06:50:08,658 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 06:50:08,658 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 06:50:08,658 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 06:50:08,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 06:50:08,659 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 06:50:08,659 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 06:50:08,659 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 06:50:08,659 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 06:50:08,660 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 06:50:08,660 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 06:50:08,660 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 06:50:08,660 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 06:50:08,661 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 06:50:08,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 06:50:08,661 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 06:50:08,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 06:50:08,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 06:50:08,662 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 06:50:08,662 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 06:50:08,663 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 06:50:08,663 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 06:50:08,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 06:50:08,663 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 06:50:08,664 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 06:50:08,664 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 06:50:08,664 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 06:50:08,664 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 -> bbc64fd25d0eb5fa31633a8c76dba801bfa80f4d9146ca588047e7c404032713 [2024-11-17 06:50:08,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 06:50:08,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 06:50:08,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 06:50:08,887 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 06:50:08,887 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 06:50:08,889 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_17_bad.i [2024-11-17 06:50:10,366 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 06:50:10,700 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 06:50:10,700 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_17_bad.i [2024-11-17 06:50:10,728 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/304328368/3a912443f3144d7f981b565e1c0cb119/FLAG899316d6d [2024-11-17 06:50:10,739 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/304328368/3a912443f3144d7f981b565e1c0cb119 [2024-11-17 06:50:10,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 06:50:10,742 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 06:50:10,743 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 06:50:10,743 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 06:50:10,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 06:50:10,752 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:50:10" (1/1) ... [2024-11-17 06:50:10,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bd20720 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:50:10, skipping insertion in model container [2024-11-17 06:50:10,753 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:50:10" (1/1) ... [2024-11-17 06:50:10,822 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 06:50:11,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 06:50:11,478 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 06:50:11,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 06:50:11,629 INFO L204 MainTranslator]: Completed translation [2024-11-17 06:50:11,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:50:11 WrapperNode [2024-11-17 06:50:11,630 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 06:50:11,630 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 06:50:11,631 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 06:50:11,631 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 06:50:11,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:50:11" (1/1) ... [2024-11-17 06:50:11,666 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:50:11" (1/1) ... [2024-11-17 06:50:11,692 INFO L138 Inliner]: procedures = 498, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 87 [2024-11-17 06:50:11,695 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 06:50:11,696 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 06:50:11,696 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 06:50:11,696 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 06:50:11,705 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:50:11" (1/1) ... [2024-11-17 06:50:11,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:50:11" (1/1) ... [2024-11-17 06:50:11,709 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:50:11" (1/1) ... [2024-11-17 06:50:11,722 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-17 06:50:11,722 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:50:11" (1/1) ... [2024-11-17 06:50:11,726 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:50:11" (1/1) ... [2024-11-17 06:50:11,733 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:50:11" (1/1) ... [2024-11-17 06:50:11,733 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:50:11" (1/1) ... [2024-11-17 06:50:11,735 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:50:11" (1/1) ... [2024-11-17 06:50:11,736 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:50:11" (1/1) ... [2024-11-17 06:50:11,737 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 06:50:11,738 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 06:50:11,738 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 06:50:11,738 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 06:50:11,739 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:50:11" (1/1) ... [2024-11-17 06:50:11,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 06:50:11,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 06:50:11,771 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-17 06:50:11,777 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-17 06:50:11,816 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-17 06:50:11,817 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-17 06:50:11,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 06:50:11,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 06:50:11,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 06:50:11,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 06:50:11,950 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 06:50:11,952 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 06:50:12,073 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-17 06:50:12,073 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 06:50:12,087 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 06:50:12,087 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 06:50:12,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 06:50:12 BoogieIcfgContainer [2024-11-17 06:50:12,088 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 06:50:12,090 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 06:50:12,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 06:50:12,093 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 06:50:12,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 06:50:10" (1/3) ... [2024-11-17 06:50:12,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@453a2034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:50:12, skipping insertion in model container [2024-11-17 06:50:12,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:50:11" (2/3) ... [2024-11-17 06:50:12,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@453a2034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:50:12, skipping insertion in model container [2024-11-17 06:50:12,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 06:50:12" (3/3) ... [2024-11-17 06:50:12,095 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fgets_postdec_17_bad.i [2024-11-17 06:50:12,109 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 06:50:12,109 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-17 06:50:12,150 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 06:50:12,156 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;@105ef940, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 06:50:12,156 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-17 06:50:12,163 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 34 states have internal predecessors, (40), 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-17 06:50:12,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 06:50:12,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 06:50:12,168 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 06:50:12,169 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 06:50:12,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 06:50:12,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1246963686, now seen corresponding path program 1 times [2024-11-17 06:50:12,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 06:50:12,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118011996] [2024-11-17 06:50:12,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:50:12,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 06:50:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:50:12,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 06:50:12,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:50:12,536 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-17 06:50:12,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 06:50:12,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118011996] [2024-11-17 06:50:12,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118011996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 06:50:12,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 06:50:12,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 06:50:12,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015668932] [2024-11-17 06:50:12,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 06:50:12,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 06:50:12,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 06:50:12,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 06:50:12,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 06:50:12,559 INFO L87 Difference]: Start difference. First operand has 39 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 34 states have internal predecessors, (40), 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 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 06:50:12,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 06:50:12,599 INFO L93 Difference]: Finished difference Result 74 states and 87 transitions. [2024-11-17 06:50:12,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 06:50:12,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-17 06:50:12,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 06:50:12,607 INFO L225 Difference]: With dead ends: 74 [2024-11-17 06:50:12,607 INFO L226 Difference]: Without dead ends: 42 [2024-11-17 06:50:12,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 06:50:12,611 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 06:50:12,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 110 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 06:50:12,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-17 06:50:12,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2024-11-17 06:50:12,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 36 states have internal predecessors, (41), 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-17 06:50:12,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-11-17 06:50:12,641 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 13 [2024-11-17 06:50:12,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 06:50:12,642 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-17 06:50:12,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 06:50:12,643 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-11-17 06:50:12,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 06:50:12,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 06:50:12,644 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 06:50:12,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 06:50:12,644 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 06:50:12,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 06:50:12,645 INFO L85 PathProgramCache]: Analyzing trace with hash -314355703, now seen corresponding path program 1 times [2024-11-17 06:50:12,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 06:50:12,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577904488] [2024-11-17 06:50:12,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:50:12,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 06:50:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:50:12,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 06:50:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:50:12,772 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 06:50:12,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 06:50:12,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577904488] [2024-11-17 06:50:12,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577904488] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 06:50:12,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907606013] [2024-11-17 06:50:12,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:50:12,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 06:50:12,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 06:50:12,776 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 06:50:12,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-17 06:50:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:50:12,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 06:50:12,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 06:50:12,923 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 06:50:12,924 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 06:50:12,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907606013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 06:50:12,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 06:50:12,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-17 06:50:12,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403782442] [2024-11-17 06:50:12,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 06:50:12,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 06:50:12,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 06:50:12,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 06:50:12,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-17 06:50:12,926 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-17 06:50:12,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 06:50:12,947 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2024-11-17 06:50:12,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 06:50:12,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 20 [2024-11-17 06:50:12,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 06:50:12,949 INFO L225 Difference]: With dead ends: 62 [2024-11-17 06:50:12,949 INFO L226 Difference]: Without dead ends: 33 [2024-11-17 06:50:12,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-17 06:50:12,950 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 06:50:12,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 86 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 06:50:12,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-17 06:50:12,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-17 06:50:12,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 29 states have internal predecessors, (32), 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-17 06:50:12,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2024-11-17 06:50:12,954 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 20 [2024-11-17 06:50:12,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 06:50:12,955 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-11-17 06:50:12,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-17 06:50:12,955 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-11-17 06:50:12,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 06:50:12,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 06:50:12,956 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 06:50:12,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-17 06:50:13,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 06:50:13,160 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 06:50:13,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 06:50:13,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1157155697, now seen corresponding path program 1 times [2024-11-17 06:50:13,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 06:50:13,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950888769] [2024-11-17 06:50:13,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:50:13,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 06:50:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 06:50:13,196 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 06:50:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 06:50:13,230 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 06:50:13,230 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 06:50:13,232 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-17 06:50:13,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-17 06:50:13,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-17 06:50:13,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-17 06:50:13,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-17 06:50:13,235 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-17 06:50:13,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 06:50:13,237 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-17 06:50:13,265 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 06:50:13,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 06:50:13 BoogieIcfgContainer [2024-11-17 06:50:13,268 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 06:50:13,271 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 06:50:13,271 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 06:50:13,271 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 06:50:13,272 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 06:50:12" (3/4) ... [2024-11-17 06:50:13,274 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 06:50:13,275 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 06:50:13,275 INFO L158 Benchmark]: Toolchain (without parser) took 2533.11ms. Allocated memory is still 186.6MB. Free memory was 155.2MB in the beginning and 85.9MB in the end (delta: 69.3MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB. [2024-11-17 06:50:13,276 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 138.4MB. Free memory was 101.7MB in the beginning and 101.6MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 06:50:13,276 INFO L158 Benchmark]: CACSL2BoogieTranslator took 886.78ms. Allocated memory is still 186.6MB. Free memory was 155.2MB in the beginning and 90.6MB in the end (delta: 64.6MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2024-11-17 06:50:13,276 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.12ms. Allocated memory is still 186.6MB. Free memory was 90.6MB in the beginning and 150.5MB in the end (delta: -59.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-17 06:50:13,277 INFO L158 Benchmark]: Boogie Preprocessor took 41.32ms. Allocated memory is still 186.6MB. Free memory was 150.5MB in the beginning and 148.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 06:50:13,277 INFO L158 Benchmark]: IcfgBuilder took 350.59ms. Allocated memory is still 186.6MB. Free memory was 147.3MB in the beginning and 132.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-17 06:50:13,277 INFO L158 Benchmark]: TraceAbstraction took 1180.79ms. Allocated memory is still 186.6MB. Free memory was 132.7MB in the beginning and 85.9MB in the end (delta: 46.8MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. [2024-11-17 06:50:13,277 INFO L158 Benchmark]: Witness Printer took 3.98ms. Allocated memory is still 186.6MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 06:50:13,283 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.14ms. Allocated memory is still 138.4MB. Free memory was 101.7MB in the beginning and 101.6MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 886.78ms. Allocated memory is still 186.6MB. Free memory was 155.2MB in the beginning and 90.6MB in the end (delta: 64.6MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.12ms. Allocated memory is still 186.6MB. Free memory was 90.6MB in the beginning and 150.5MB in the end (delta: -59.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.32ms. Allocated memory is still 186.6MB. Free memory was 150.5MB in the beginning and 148.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 350.59ms. Allocated memory is still 186.6MB. Free memory was 147.3MB in the beginning and 132.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1180.79ms. Allocated memory is still 186.6MB. Free memory was 132.7MB in the beginning and 85.9MB in the end (delta: 46.8MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. * Witness Printer took 3.98ms. Allocated memory is still 186.6MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1559, overapproximation of large string literal at line 1579, overapproximation of fgets at line 1557. 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] [L1579] 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) [L1579] 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] [L1580] CALL CWE191_Integer_Underflow__int_fgets_postdec_17_bad() [L1550] int i,j; [L1551] int data; [L1552] data = 0 [L1553] i = 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, i=0] [L1553] COND TRUE i < 1 [L1556] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1557] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1559] data = atoi(inputBuffer) [L1553] i++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=1] [L1553] COND FALSE !(i < 1) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1567] j = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1567] COND TRUE j < 1 [L1570] data-- VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] - UnprovableResult [Line: 1567]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1567]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: 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, 39 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 196 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 127 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 38 IncrementalHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 69 mSDtfsCounter, 38 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=1, InterpolantAutomatonStates: 9, 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, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 50 ConstructedInterpolants, 0 QuantifiedInterpolants, 96 SizeOfPredicates, 0 NumberOfNonLiveVariables, 153 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 8/10 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-17 06:50:13,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_17_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 bbc64fd25d0eb5fa31633a8c76dba801bfa80f4d9146ca588047e7c404032713 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 06:50:15,645 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 06:50:15,713 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-17 06:50:15,718 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 06:50:15,718 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 06:50:15,719 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-17 06:50:15,741 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 06:50:15,742 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 06:50:15,743 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 06:50:15,744 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 06:50:15,744 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 06:50:15,744 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 06:50:15,745 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 06:50:15,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 06:50:15,747 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 06:50:15,747 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 06:50:15,747 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 06:50:15,747 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 06:50:15,748 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 06:50:15,748 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 06:50:15,749 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 06:50:15,749 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 06:50:15,750 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 06:50:15,750 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 06:50:15,750 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 06:50:15,750 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 06:50:15,751 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 06:50:15,751 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 06:50:15,751 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 06:50:15,751 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 06:50:15,751 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 06:50:15,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 06:50:15,752 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 06:50:15,752 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 06:50:15,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 06:50:15,753 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 06:50:15,753 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 06:50:15,753 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 06:50:15,753 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 06:50:15,753 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 06:50:15,754 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 06:50:15,754 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 06:50:15,754 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 06:50:15,754 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 06:50:15,755 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 -> bbc64fd25d0eb5fa31633a8c76dba801bfa80f4d9146ca588047e7c404032713 [2024-11-17 06:50:16,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 06:50:16,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 06:50:16,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 06:50:16,097 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 06:50:16,098 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 06:50:16,099 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_17_bad.i [2024-11-17 06:50:17,526 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 06:50:17,762 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 06:50:17,767 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_17_bad.i [2024-11-17 06:50:17,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0458ff1c4/dffc358b414340bc9491f0c95f1e417a/FLAG63287c37f [2024-11-17 06:50:18,073 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0458ff1c4/dffc358b414340bc9491f0c95f1e417a [2024-11-17 06:50:18,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 06:50:18,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 06:50:18,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 06:50:18,080 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 06:50:18,084 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 06:50:18,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:50:18" (1/1) ... [2024-11-17 06:50:18,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a45943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:50:18, skipping insertion in model container [2024-11-17 06:50:18,085 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:50:18" (1/1) ... [2024-11-17 06:50:18,133 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 06:50:18,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 06:50:18,771 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 06:50:18,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 06:50:18,957 INFO L204 MainTranslator]: Completed translation [2024-11-17 06:50:18,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:50:18 WrapperNode [2024-11-17 06:50:18,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 06:50:18,958 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 06:50:18,958 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 06:50:18,958 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 06:50:18,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:50:18" (1/1) ... [2024-11-17 06:50:18,991 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:50:18" (1/1) ... [2024-11-17 06:50:19,017 INFO L138 Inliner]: procedures = 503, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 86 [2024-11-17 06:50:19,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 06:50:19,019 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 06:50:19,019 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 06:50:19,019 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 06:50:19,041 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:50:18" (1/1) ... [2024-11-17 06:50:19,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:50:18" (1/1) ... [2024-11-17 06:50:19,046 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:50:18" (1/1) ... [2024-11-17 06:50:19,063 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-17 06:50:19,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:50:18" (1/1) ... [2024-11-17 06:50:19,063 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:50:18" (1/1) ... [2024-11-17 06:50:19,073 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:50:18" (1/1) ... [2024-11-17 06:50:19,076 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:50:18" (1/1) ... [2024-11-17 06:50:19,078 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:50:18" (1/1) ... [2024-11-17 06:50:19,079 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:50:18" (1/1) ... [2024-11-17 06:50:19,084 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 06:50:19,085 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 06:50:19,088 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 06:50:19,088 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 06:50:19,089 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:50:18" (1/1) ... [2024-11-17 06:50:19,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 06:50:19,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 06:50:19,119 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-17 06:50:19,124 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-17 06:50:19,165 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-17 06:50:19,165 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-17 06:50:19,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 06:50:19,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 06:50:19,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 06:50:19,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 06:50:19,313 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 06:50:19,315 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 06:50:19,452 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-17 06:50:19,453 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 06:50:19,465 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 06:50:19,466 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 06:50:19,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 06:50:19 BoogieIcfgContainer [2024-11-17 06:50:19,469 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 06:50:19,470 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 06:50:19,470 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 06:50:19,473 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 06:50:19,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 06:50:18" (1/3) ... [2024-11-17 06:50:19,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c622d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:50:19, skipping insertion in model container [2024-11-17 06:50:19,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:50:18" (2/3) ... [2024-11-17 06:50:19,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c622d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:50:19, skipping insertion in model container [2024-11-17 06:50:19,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 06:50:19" (3/3) ... [2024-11-17 06:50:19,475 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fgets_postdec_17_bad.i [2024-11-17 06:50:19,488 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 06:50:19,488 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-17 06:50:19,531 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 06:50:19,536 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;@3c7cd8aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 06:50:19,536 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-17 06:50:19,539 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 34 states have internal predecessors, (40), 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-17 06:50:19,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 06:50:19,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 06:50:19,545 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 06:50:19,546 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 06:50:19,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 06:50:19,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1246963686, now seen corresponding path program 1 times [2024-11-17 06:50:19,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 06:50:19,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050734655] [2024-11-17 06:50:19,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:50:19,570 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-17 06:50:19,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 06:50:19,572 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-17 06:50:19,573 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-17 06:50:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:50:19,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-17 06:50:19,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 06:50:19,683 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-17 06:50:19,683 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 06:50:19,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 06:50:19,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050734655] [2024-11-17 06:50:19,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1050734655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 06:50:19,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 06:50:19,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 06:50:19,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326102472] [2024-11-17 06:50:19,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 06:50:19,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 06:50:19,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 06:50:19,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 06:50:19,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 06:50:19,710 INFO L87 Difference]: Start difference. First operand has 39 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 34 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 1 states have (on average 11.0) 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-17 06:50:19,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 06:50:19,725 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2024-11-17 06:50:19,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 06:50:19,726 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 11.0) 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-17 06:50:19,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 06:50:19,730 INFO L225 Difference]: With dead ends: 61 [2024-11-17 06:50:19,731 INFO L226 Difference]: Without dead ends: 30 [2024-11-17 06:50:19,733 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-17 06:50:19,736 INFO L432 NwaCegarLoop]: 41 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, 41 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-17 06:50:19,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 06:50:19,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-17 06:50:19,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-17 06:50:19,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.25) internal successors, (30), 26 states have internal predecessors, (30), 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-17 06:50:19,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-11-17 06:50:19,764 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 13 [2024-11-17 06:50:19,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 06:50:19,765 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-11-17 06:50:19,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 11.0) 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-17 06:50:19,765 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-11-17 06:50:19,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-17 06:50:19,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 06:50:19,766 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 06:50:19,770 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-17 06:50:19,969 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-17 06:50:19,969 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 06:50:19,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 06:50:19,970 INFO L85 PathProgramCache]: Analyzing trace with hash -3232098, now seen corresponding path program 1 times [2024-11-17 06:50:19,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 06:50:19,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131963477] [2024-11-17 06:50:19,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:50:19,971 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-17 06:50:19,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 06:50:19,972 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-17 06:50:19,974 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-17 06:50:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:50:20,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 06:50:20,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 06:50:20,084 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-17 06:50:20,085 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 06:50:20,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 06:50:20,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131963477] [2024-11-17 06:50:20,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1131963477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 06:50:20,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 06:50:20,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 06:50:20,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168543702] [2024-11-17 06:50:20,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 06:50:20,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 06:50:20,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 06:50:20,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 06:50:20,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 06:50:20,087 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 06:50:20,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 06:50:20,122 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2024-11-17 06:50:20,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 06:50:20,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-17 06:50:20,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 06:50:20,126 INFO L225 Difference]: With dead ends: 48 [2024-11-17 06:50:20,126 INFO L226 Difference]: Without dead ends: 36 [2024-11-17 06:50:20,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 06:50:20,128 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 06:50:20,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 63 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 06:50:20,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-17 06:50:20,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2024-11-17 06:50:20,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 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-17 06:50:20,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-11-17 06:50:20,137 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 14 [2024-11-17 06:50:20,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 06:50:20,138 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-17 06:50:20,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 06:50:20,138 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-11-17 06:50:20,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-17 06:50:20,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 06:50:20,139 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 06:50:20,143 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-17 06:50:20,340 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-17 06:50:20,340 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 06:50:20,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 06:50:20,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1168604, now seen corresponding path program 1 times [2024-11-17 06:50:20,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 06:50:20,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1598565833] [2024-11-17 06:50:20,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:50:20,345 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-17 06:50:20,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 06:50:20,351 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-17 06:50:20,353 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-17 06:50:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:50:20,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 06:50:20,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 06:50:20,460 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-17 06:50:20,463 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 06:50:20,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 06:50:20,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1598565833] [2024-11-17 06:50:20,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1598565833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 06:50:20,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 06:50:20,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 06:50:20,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561614515] [2024-11-17 06:50:20,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 06:50:20,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 06:50:20,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 06:50:20,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 06:50:20,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 06:50:20,466 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 06:50:20,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 06:50:20,494 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2024-11-17 06:50:20,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 06:50:20,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-17 06:50:20,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 06:50:20,515 INFO L225 Difference]: With dead ends: 40 [2024-11-17 06:50:20,515 INFO L226 Difference]: Without dead ends: 39 [2024-11-17 06:50:20,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 06:50:20,516 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 3 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 06:50:20,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 87 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 06:50:20,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-17 06:50:20,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2024-11-17 06:50:20,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 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-17 06:50:20,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-11-17 06:50:20,522 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 14 [2024-11-17 06:50:20,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 06:50:20,523 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-11-17 06:50:20,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 06:50:20,523 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-11-17 06:50:20,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 06:50:20,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 06:50:20,526 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 06:50:20,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-17 06:50:20,729 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-17 06:50:20,729 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 06:50:20,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 06:50:20,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1157155697, now seen corresponding path program 1 times [2024-11-17 06:50:20,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 06:50:20,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [763730186] [2024-11-17 06:50:20,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:50:20,734 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-17 06:50:20,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 06:50:20,736 INFO L229 MonitoredProcess]: Starting monitored process 5 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-17 06:50:20,737 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 (5)] Waiting until timeout for monitored process [2024-11-17 06:50:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 06:50:20,818 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 06:50:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 06:50:20,881 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-17 06:50:20,884 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 06:50:20,885 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-17 06:50:20,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-17 06:50:20,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-17 06:50:20,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-17 06:50:20,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-17 06:50:20,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-17 06:50:20,895 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 (5)] Ended with exit code 0 [2024-11-17 06:50:21,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-17 06:50:21,092 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-17 06:50:21,112 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 06:50:21,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 06:50:21 BoogieIcfgContainer [2024-11-17 06:50:21,115 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 06:50:21,115 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 06:50:21,115 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 06:50:21,116 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 06:50:21,116 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 06:50:19" (3/4) ... [2024-11-17 06:50:21,118 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 06:50:21,119 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 06:50:21,119 INFO L158 Benchmark]: Toolchain (without parser) took 3041.02ms. Allocated memory was 58.7MB in the beginning and 104.9MB in the end (delta: 46.1MB). Free memory was 26.6MB in the beginning and 61.7MB in the end (delta: -35.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-17 06:50:21,119 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 44.0MB. Free memory is still 29.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 06:50:21,120 INFO L158 Benchmark]: CACSL2BoogieTranslator took 877.82ms. Allocated memory was 58.7MB in the beginning and 79.7MB in the end (delta: 21.0MB). Free memory was 26.4MB in the beginning and 32.2MB in the end (delta: -5.8MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2024-11-17 06:50:21,120 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.14ms. Allocated memory is still 79.7MB. Free memory was 32.2MB in the beginning and 28.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 06:50:21,120 INFO L158 Benchmark]: Boogie Preprocessor took 65.52ms. Allocated memory is still 79.7MB. Free memory was 28.9MB in the beginning and 50.9MB in the end (delta: -22.0MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2024-11-17 06:50:21,121 INFO L158 Benchmark]: IcfgBuilder took 384.09ms. Allocated memory is still 79.7MB. Free memory was 50.5MB in the beginning and 34.9MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-17 06:50:21,121 INFO L158 Benchmark]: TraceAbstraction took 1644.73ms. Allocated memory was 79.7MB in the beginning and 104.9MB in the end (delta: 25.2MB). Free memory was 34.1MB in the beginning and 61.7MB in the end (delta: -27.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 06:50:21,121 INFO L158 Benchmark]: Witness Printer took 3.39ms. Allocated memory is still 104.9MB. Free memory is still 61.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 06:50:21,122 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.12ms. Allocated memory is still 44.0MB. Free memory is still 29.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 877.82ms. Allocated memory was 58.7MB in the beginning and 79.7MB in the end (delta: 21.0MB). Free memory was 26.4MB in the beginning and 32.2MB in the end (delta: -5.8MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.14ms. Allocated memory is still 79.7MB. Free memory was 32.2MB in the beginning and 28.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.52ms. Allocated memory is still 79.7MB. Free memory was 28.9MB in the beginning and 50.9MB in the end (delta: -22.0MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. * IcfgBuilder took 384.09ms. Allocated memory is still 79.7MB. Free memory was 50.5MB in the beginning and 34.9MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1644.73ms. Allocated memory was 79.7MB in the beginning and 104.9MB in the end (delta: 25.2MB). Free memory was 34.1MB in the beginning and 61.7MB in the end (delta: -27.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.39ms. Allocated memory is still 104.9MB. Free memory is still 61.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1559, overapproximation of large string literal at line 1579, overapproximation of fgets at line 1557. 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] [L1579] 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) [L1579] 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] [L1580] CALL CWE191_Integer_Underflow__int_fgets_postdec_17_bad() [L1550] int i,j; [L1551] int data; [L1552] data = 0 [L1553] i = 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, i=0] [L1553] COND TRUE i < 1 [L1556] char inputBuffer[(3 * sizeof(data) + 2)] = ""; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1557] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1559] data = atoi(inputBuffer) [L1553] i++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=1] [L1553] COND FALSE !(i < 1) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1567] j = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1567] COND TRUE j < 1 [L1570] data-- VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] - UnprovableResult [Line: 1567]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1567]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: 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, 39 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7 mSDsluCounter, 191 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 85 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24 IncrementalHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 106 mSDtfsCounter, 24 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, InterpolantAutomatonStates: 9, 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, 3 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 54 SizeOfPredicates, 0 NumberOfNonLiveVariables, 170 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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-17 06:50:21,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample