java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array_true-unreach-call3_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 20:34:38,128 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 20:34:38,130 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 20:34:38,141 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 20:34:38,142 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 20:34:38,143 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 20:34:38,144 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 20:34:38,146 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 20:34:38,148 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 20:34:38,148 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 20:34:38,149 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 20:34:38,150 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 20:34:38,151 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 20:34:38,152 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 20:34:38,153 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 20:34:38,154 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 20:34:38,154 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 20:34:38,156 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 20:34:38,158 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 20:34:38,160 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 20:34:38,161 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 20:34:38,162 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 20:34:38,165 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 20:34:38,165 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 20:34:38,165 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 20:34:38,166 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 20:34:38,167 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 20:34:38,168 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 20:34:38,169 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 20:34:38,170 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 20:34:38,170 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 20:34:38,171 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 20:34:38,171 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 20:34:38,171 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 20:34:38,172 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 20:34:38,173 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 20:34:38,174 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 20:34:38,189 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 20:34:38,190 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 20:34:38,191 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 20:34:38,191 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 20:34:38,191 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 20:34:38,191 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 20:34:38,191 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 20:34:38,192 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 20:34:38,192 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 20:34:38,192 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 20:34:38,192 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 20:34:38,192 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 20:34:38,193 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 20:34:38,193 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 20:34:38,193 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 20:34:38,193 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 20:34:38,194 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 20:34:38,194 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 20:34:38,194 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 20:34:38,194 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 20:34:38,194 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 20:34:38,195 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 20:34:38,195 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 20:34:38,195 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 20:34:38,195 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 20:34:38,195 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:34:38,196 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 20:34:38,196 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 20:34:38,196 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 20:34:38,196 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 20:34:38,196 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 20:34:38,197 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 20:34:38,197 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 20:34:38,197 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 20:34:38,197 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 20:34:38,238 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 20:34:38,258 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 20:34:38,262 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 20:34:38,264 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 20:34:38,264 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 20:34:38,265 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_true-unreach-call3_true-termination.i [2018-11-12 20:34:38,332 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/394f14231/dffc468aaab24ba4ae3a4f062a523d95/FLAGdf118a35d [2018-11-12 20:34:38,795 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 20:34:38,796 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_true-unreach-call3_true-termination.i [2018-11-12 20:34:38,803 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/394f14231/dffc468aaab24ba4ae3a4f062a523d95/FLAGdf118a35d [2018-11-12 20:34:38,819 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/394f14231/dffc468aaab24ba4ae3a4f062a523d95 [2018-11-12 20:34:38,830 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 20:34:38,831 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 20:34:38,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 20:34:38,835 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 20:34:38,840 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 20:34:38,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:34:38" (1/1) ... [2018-11-12 20:34:38,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bc2efc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:34:38, skipping insertion in model container [2018-11-12 20:34:38,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:34:38" (1/1) ... [2018-11-12 20:34:38,854 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 20:34:38,875 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 20:34:39,080 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:34:39,084 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 20:34:39,113 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:34:39,139 INFO L193 MainTranslator]: Completed translation [2018-11-12 20:34:39,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:34:39 WrapperNode [2018-11-12 20:34:39,140 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 20:34:39,141 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 20:34:39,141 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 20:34:39,141 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 20:34:39,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:34:39" (1/1) ... [2018-11-12 20:34:39,161 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:34:39" (1/1) ... [2018-11-12 20:34:39,170 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 20:34:39,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 20:34:39,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 20:34:39,170 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 20:34:39,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:34:39" (1/1) ... [2018-11-12 20:34:39,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:34:39" (1/1) ... [2018-11-12 20:34:39,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:34:39" (1/1) ... [2018-11-12 20:34:39,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:34:39" (1/1) ... [2018-11-12 20:34:39,194 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:34:39" (1/1) ... [2018-11-12 20:34:39,199 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:34:39" (1/1) ... [2018-11-12 20:34:39,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:34:39" (1/1) ... [2018-11-12 20:34:39,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 20:34:39,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 20:34:39,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 20:34:39,203 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 20:34:39,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:34:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:34:39,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-12 20:34:39,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 20:34:39,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 20:34:39,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-12 20:34:39,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 20:34:39,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 20:34:39,359 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 20:34:39,359 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 20:34:39,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-12 20:34:39,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-12 20:34:39,360 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-12 20:34:39,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-12 20:34:39,835 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 20:34:39,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:34:39 BoogieIcfgContainer [2018-11-12 20:34:39,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 20:34:39,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 20:34:39,837 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 20:34:39,840 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 20:34:39,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:34:38" (1/3) ... [2018-11-12 20:34:39,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1843ddc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:34:39, skipping insertion in model container [2018-11-12 20:34:39,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:34:39" (2/3) ... [2018-11-12 20:34:39,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1843ddc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:34:39, skipping insertion in model container [2018-11-12 20:34:39,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:34:39" (3/3) ... [2018-11-12 20:34:39,845 INFO L112 eAbstractionObserver]: Analyzing ICFG array_true-unreach-call3_true-termination.i [2018-11-12 20:34:39,854 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 20:34:39,867 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 20:34:39,885 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 20:34:39,917 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 20:34:39,917 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 20:34:39,917 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 20:34:39,918 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 20:34:39,918 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 20:34:39,918 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 20:34:39,918 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 20:34:39,918 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 20:34:39,937 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-12 20:34:39,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-12 20:34:39,943 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:34:39,944 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:34:39,946 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:34:39,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:39,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1794184535, now seen corresponding path program 1 times [2018-11-12 20:34:39,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:34:40,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:40,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:34:40,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:40,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:34:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:40,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:40,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:34:40,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-12 20:34:40,092 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:34:40,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-12 20:34:40,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-12 20:34:40,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:34:40,111 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-11-12 20:34:40,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:34:40,133 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2018-11-12 20:34:40,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-12 20:34:40,134 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-12 20:34:40,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:34:40,141 INFO L225 Difference]: With dead ends: 43 [2018-11-12 20:34:40,141 INFO L226 Difference]: Without dead ends: 19 [2018-11-12 20:34:40,144 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:34:40,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-12 20:34:40,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-12 20:34:40,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-12 20:34:40,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-12 20:34:40,182 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 13 [2018-11-12 20:34:40,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:34:40,183 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-12 20:34:40,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-12 20:34:40,183 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-12 20:34:40,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-12 20:34:40,184 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:34:40,184 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:34:40,185 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:34:40,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:40,185 INFO L82 PathProgramCache]: Analyzing trace with hash 612144665, now seen corresponding path program 1 times [2018-11-12 20:34:40,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:34:40,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:40,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:34:40,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:40,187 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:34:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:40,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:40,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:34:40,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 20:34:40,285 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:34:40,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 20:34:40,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 20:34:40,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:34:40,288 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 3 states. [2018-11-12 20:34:40,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:34:40,374 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2018-11-12 20:34:40,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 20:34:40,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-12 20:34:40,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:34:40,378 INFO L225 Difference]: With dead ends: 37 [2018-11-12 20:34:40,378 INFO L226 Difference]: Without dead ends: 27 [2018-11-12 20:34:40,379 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:34:40,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-12 20:34:40,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2018-11-12 20:34:40,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-12 20:34:40,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-12 20:34:40,387 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2018-11-12 20:34:40,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:34:40,387 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-12 20:34:40,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 20:34:40,387 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-12 20:34:40,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-12 20:34:40,388 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:34:40,388 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:34:40,389 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:34:40,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:40,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1794172150, now seen corresponding path program 1 times [2018-11-12 20:34:40,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:34:40,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:40,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:34:40,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:40,391 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:34:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:40,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:40,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:40,457 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:34:40,459 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-11-12 20:34:40,461 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [27], [43], [46], [48], [54], [55], [56], [58] [2018-11-12 20:34:40,499 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:34:40,500 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:34:40,718 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:34:40,720 INFO L272 AbstractInterpreter]: Visited 17 different actions 37 times. Merged at 3 different actions 15 times. Widened at 1 different actions 1 times. Performed 176 root evaluator evaluations with a maximum evaluation depth of 3. Performed 176 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 16 variables. [2018-11-12 20:34:40,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:40,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:34:40,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:40,738 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:34:40,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:34:40,753 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:34:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:40,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:34:40,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:40,873 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:34:40,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:40,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:34:40,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-12 20:34:40,951 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:34:40,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 20:34:40,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 20:34:40,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:34:40,953 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 5 states. [2018-11-12 20:34:41,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:34:41,240 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2018-11-12 20:34:41,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 20:34:41,241 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-12 20:34:41,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:34:41,242 INFO L225 Difference]: With dead ends: 48 [2018-11-12 20:34:41,242 INFO L226 Difference]: Without dead ends: 35 [2018-11-12 20:34:41,243 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:34:41,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-12 20:34:41,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2018-11-12 20:34:41,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-12 20:34:41,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-12 20:34:41,250 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 18 [2018-11-12 20:34:41,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:34:41,250 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-12 20:34:41,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 20:34:41,250 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-12 20:34:41,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-12 20:34:41,251 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:34:41,251 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:34:41,251 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:34:41,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:41,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1079270279, now seen corresponding path program 2 times [2018-11-12 20:34:41,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:34:41,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:41,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:34:41,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:41,253 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:34:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:41,417 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:41,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:41,418 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:34:41,418 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:34:41,419 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:34:41,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:41,419 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:34:41,434 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:34:41,434 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:34:41,471 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-12 20:34:41,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:34:41,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:34:41,593 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 20:34:41,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:34:41,659 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 20:34:41,679 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 20:34:41,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5] total 11 [2018-11-12 20:34:41,680 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:34:41,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 20:34:41,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 20:34:41,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:34:41,681 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 5 states. [2018-11-12 20:34:41,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:34:41,858 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-11-12 20:34:41,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-12 20:34:41,858 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-12 20:34:41,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:34:41,859 INFO L225 Difference]: With dead ends: 36 [2018-11-12 20:34:41,859 INFO L226 Difference]: Without dead ends: 31 [2018-11-12 20:34:41,860 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-12 20:34:41,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-12 20:34:41,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-12 20:34:41,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-12 20:34:41,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-11-12 20:34:41,866 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 21 [2018-11-12 20:34:41,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:34:41,866 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-12 20:34:41,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 20:34:41,866 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-12 20:34:41,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-12 20:34:41,867 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:34:41,868 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:34:41,868 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:34:41,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:41,868 INFO L82 PathProgramCache]: Analyzing trace with hash -764656704, now seen corresponding path program 1 times [2018-11-12 20:34:41,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:34:41,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:41,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:34:41,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:41,870 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:34:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:41,965 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:34:41,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:41,966 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:34:41,966 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-11-12 20:34:41,966 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [27], [29], [34], [36], [43], [46], [48], [54], [55], [56], [58] [2018-11-12 20:34:41,968 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:34:41,968 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:34:42,149 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:34:42,149 INFO L272 AbstractInterpreter]: Visited 20 different actions 88 times. Merged at 8 different actions 42 times. Widened at 2 different actions 3 times. Performed 410 root evaluator evaluations with a maximum evaluation depth of 3. Performed 410 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 17 variables. [2018-11-12 20:34:42,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:42,166 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:34:42,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:42,166 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:34:42,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:34:42,177 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:34:42,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:42,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:34:42,239 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:34:42,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:34:42,329 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:34:42,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:34:42,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-12 20:34:42,349 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:34:42,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:34:42,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:34:42,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-12 20:34:42,351 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 6 states. [2018-11-12 20:34:42,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:34:42,515 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2018-11-12 20:34:42,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-12 20:34:42,516 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-12 20:34:42,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:34:42,517 INFO L225 Difference]: With dead ends: 59 [2018-11-12 20:34:42,517 INFO L226 Difference]: Without dead ends: 42 [2018-11-12 20:34:42,522 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-12 20:34:42,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-12 20:34:42,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2018-11-12 20:34:42,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-12 20:34:42,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-12 20:34:42,533 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 25 [2018-11-12 20:34:42,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:34:42,533 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-12 20:34:42,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:34:42,533 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-12 20:34:42,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-12 20:34:42,539 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:34:42,540 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:34:42,540 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:34:42,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:42,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1274417009, now seen corresponding path program 2 times [2018-11-12 20:34:42,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:34:42,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:42,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:34:42,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:42,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:34:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:42,829 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:34:42,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:42,830 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:34:42,830 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:34:42,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:34:42,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:42,831 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:34:42,848 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:34:42,848 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:34:42,864 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-12 20:34:42,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:34:42,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:34:42,927 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-12 20:34:42,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:34:43,037 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-12 20:34:43,066 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 20:34:43,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [6] total 13 [2018-11-12 20:34:43,067 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:34:43,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:34:43,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:34:43,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-12 20:34:43,069 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 6 states. [2018-11-12 20:34:43,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:34:43,141 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-12 20:34:43,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 20:34:43,142 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-12 20:34:43,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:34:43,143 INFO L225 Difference]: With dead ends: 38 [2018-11-12 20:34:43,143 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 20:34:43,144 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-12 20:34:43,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 20:34:43,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 20:34:43,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 20:34:43,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 20:34:43,145 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-11-12 20:34:43,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:34:43,146 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 20:34:43,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:34:43,146 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 20:34:43,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 20:34:43,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 20:34:43,224 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 20:34:43,224 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-12 20:34:43,224 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 20:34:43,224 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 20:34:43,224 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-12 20:34:43,225 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 20:34:43,225 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 20:34:43,225 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 9 23) no Hoare annotation was computed. [2018-11-12 20:34:43,225 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 17 21) no Hoare annotation was computed. [2018-11-12 20:34:43,225 INFO L425 ceAbstractionStarter]: For program point L17-3(lines 17 21) no Hoare annotation was computed. [2018-11-12 20:34:43,225 INFO L421 ceAbstractionStarter]: At program point L17-4(lines 17 21) the Hoare annotation is: (<= main_~i~0 1023) [2018-11-12 20:34:43,225 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 9 23) no Hoare annotation was computed. [2018-11-12 20:34:43,226 INFO L425 ceAbstractionStarter]: For program point L13-1(lines 13 15) no Hoare annotation was computed. [2018-11-12 20:34:43,226 INFO L421 ceAbstractionStarter]: At program point L17-5(lines 17 21) the Hoare annotation is: (<= main_~i~0 1023) [2018-11-12 20:34:43,226 INFO L425 ceAbstractionStarter]: For program point L13-3(lines 13 15) no Hoare annotation was computed. [2018-11-12 20:34:43,226 INFO L428 ceAbstractionStarter]: At program point L13-4(lines 13 15) the Hoare annotation is: true [2018-11-12 20:34:43,226 INFO L425 ceAbstractionStarter]: For program point L13-5(lines 13 15) no Hoare annotation was computed. [2018-11-12 20:34:43,226 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 9 23) the Hoare annotation is: true [2018-11-12 20:34:43,226 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-12 20:34:43,226 INFO L425 ceAbstractionStarter]: For program point L18(lines 18 20) no Hoare annotation was computed. [2018-11-12 20:34:43,226 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-12 20:34:43,227 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-12 20:34:43,227 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-12 20:34:43,227 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-12 20:34:43,227 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-12 20:34:43,227 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-12 20:34:43,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 08:34:43 BoogieIcfgContainer [2018-11-12 20:34:43,237 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 20:34:43,238 INFO L168 Benchmark]: Toolchain (without parser) took 4408.08 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.5 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -553.6 MB). Peak memory consumption was 180.9 MB. Max. memory is 7.1 GB. [2018-11-12 20:34:43,240 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:34:43,241 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.01 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-12 20:34:43,242 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.80 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:34:43,242 INFO L168 Benchmark]: Boogie Preprocessor took 32.40 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:34:43,243 INFO L168 Benchmark]: RCFGBuilder took 633.42 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -765.2 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-12 20:34:43,244 INFO L168 Benchmark]: TraceAbstraction took 3400.56 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 201.0 MB). Peak memory consumption was 201.0 MB. Max. memory is 7.1 GB. [2018-11-12 20:34:43,249 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 307.01 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 28.80 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.40 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 633.42 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -765.2 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3400.56 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 201.0 MB). Peak memory consumption was 201.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: i <= 1023 - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. SAFE Result, 3.3s OverallTime, 6 OverallIterations, 4 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 103 SDtfs, 51 SDslu, 147 SDs, 0 SdLazy, 117 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 207 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 13 PreInvPairs, 22 NumberOfFragments, 12 HoareAnnotationTreeSize, 13 FomulaSimplifications, 14 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 15 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 212 NumberOfCodeBlocks, 200 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 290 ConstructedInterpolants, 0 QuantifiedInterpolants, 10096 SizeOfPredicates, 7 NumberOfNonLiveVariables, 252 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 56/105 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...