java -ea -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_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/sum04_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:04:31,591 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:04:31,593 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:04:31,604 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:04:31,605 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:04:31,606 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:04:31,607 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:04:31,609 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:04:31,611 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:04:31,612 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:04:31,613 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:04:31,613 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:04:31,614 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:04:31,615 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:04:31,617 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:04:31,617 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:04:31,618 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:04:31,620 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:04:31,622 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:04:31,624 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:04:31,625 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:04:31,626 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:04:31,629 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:04:31,629 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:04:31,629 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:04:31,630 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:04:31,631 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:04:31,632 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:04:31,633 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:04:31,634 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:04:31,634 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:04:31,635 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:04:31,635 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:04:31,635 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:04:31,636 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:04:31,637 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:04:31,638 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:04:31,654 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:04:31,654 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:04:31,655 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:04:31,655 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:04:31,655 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:04:31,656 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:04:31,656 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:04:31,656 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:04:31,656 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:04:31,656 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:04:31,659 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:04:31,659 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:04:31,659 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:04:31,659 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:04:31,659 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:04:31,660 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:04:31,660 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:04:31,660 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:04:31,660 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:04:31,660 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:04:31,661 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:04:31,661 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:04:31,661 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:04:31,661 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:04:31,661 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:04:31,661 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:04:31,663 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:04:31,663 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:04:31,663 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:04:31,663 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:04:31,664 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:04:31,706 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:04:31,721 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:04:31,725 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:04:31,726 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:04:31,727 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:04:31,727 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum04_true-unreach-call_true-termination.i [2018-11-23 13:04:31,789 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef7899ae1/6a22d48c5e44496bb024d8968dab3a74/FLAGd32a179b9 [2018-11-23 13:04:32,219 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:04:32,220 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04_true-unreach-call_true-termination.i [2018-11-23 13:04:32,229 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef7899ae1/6a22d48c5e44496bb024d8968dab3a74/FLAGd32a179b9 [2018-11-23 13:04:32,592 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef7899ae1/6a22d48c5e44496bb024d8968dab3a74 [2018-11-23 13:04:32,602 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:04:32,603 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:04:32,605 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:04:32,605 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:04:32,609 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:04:32,613 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:04:32" (1/1) ... [2018-11-23 13:04:32,616 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50669a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:32, skipping insertion in model container [2018-11-23 13:04:32,616 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:04:32" (1/1) ... [2018-11-23 13:04:32,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:04:32,657 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:04:32,862 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:04:32,866 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:04:32,884 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:04:32,899 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:04:32,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:32 WrapperNode [2018-11-23 13:04:32,900 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:04:32,901 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:04:32,902 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:04:32,902 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:04:32,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:32" (1/1) ... [2018-11-23 13:04:32,916 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:32" (1/1) ... [2018-11-23 13:04:32,924 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:04:32,924 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:04:32,924 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:04:32,925 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:04:32,936 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:32" (1/1) ... [2018-11-23 13:04:32,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:32" (1/1) ... [2018-11-23 13:04:32,937 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:32" (1/1) ... [2018-11-23 13:04:32,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:32" (1/1) ... [2018-11-23 13:04:32,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:32" (1/1) ... [2018-11-23 13:04:32,948 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:32" (1/1) ... [2018-11-23 13:04:32,949 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:32" (1/1) ... [2018-11-23 13:04:32,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:04:32,951 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:04:32,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:04:32,951 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:04:32,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:32" (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-23 13:04:33,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:04:33,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:04:33,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:04:33,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:04:33,127 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:04:33,128 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:04:33,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:04:33,129 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:04:33,555 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:04:33,556 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:04:33,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:33 BoogieIcfgContainer [2018-11-23 13:04:33,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:04:33,557 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:04:33,557 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:04:33,561 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:04:33,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:04:32" (1/3) ... [2018-11-23 13:04:33,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708bcf7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:04:33, skipping insertion in model container [2018-11-23 13:04:33,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:32" (2/3) ... [2018-11-23 13:04:33,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708bcf7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:04:33, skipping insertion in model container [2018-11-23 13:04:33,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:33" (3/3) ... [2018-11-23 13:04:33,565 INFO L112 eAbstractionObserver]: Analyzing ICFG sum04_true-unreach-call_true-termination.i [2018-11-23 13:04:33,573 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:04:33,580 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:04:33,599 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:04:33,633 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:04:33,634 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:04:33,635 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:04:33,635 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:04:33,635 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:04:33,635 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:04:33,635 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:04:33,636 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:04:33,636 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:04:33,654 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-23 13:04:33,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:04:33,660 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:33,661 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:33,664 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:33,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:33,670 INFO L82 PathProgramCache]: Analyzing trace with hash -10373566, now seen corresponding path program 1 times [2018-11-23 13:04:33,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:33,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:33,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:33,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:33,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:33,795 INFO L256 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {21#true} is VALID [2018-11-23 13:04:33,800 INFO L273 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2018-11-23 13:04:33,801 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #32#return; {21#true} is VALID [2018-11-23 13:04:33,801 INFO L256 TraceCheckUtils]: 3: Hoare triple {21#true} call #t~ret1 := main(); {21#true} is VALID [2018-11-23 13:04:33,801 INFO L273 TraceCheckUtils]: 4: Hoare triple {21#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {21#true} is VALID [2018-11-23 13:04:33,812 INFO L273 TraceCheckUtils]: 5: Hoare triple {21#true} assume !true; {22#false} is VALID [2018-11-23 13:04:33,813 INFO L256 TraceCheckUtils]: 6: Hoare triple {22#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {22#false} is VALID [2018-11-23 13:04:33,813 INFO L273 TraceCheckUtils]: 7: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2018-11-23 13:04:33,814 INFO L273 TraceCheckUtils]: 8: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2018-11-23 13:04:33,814 INFO L273 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2018-11-23 13:04:33,817 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-23 13:04:33,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:33,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:04:33,826 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:04:33,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:33,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:04:33,899 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:33,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:04:33,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:04:33,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:04:33,913 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-23 13:04:34,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:34,005 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-23 13:04:34,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:04:34,005 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:04:34,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:34,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:04:34,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2018-11-23 13:04:34,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:04:34,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2018-11-23 13:04:34,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 32 transitions. [2018-11-23 13:04:34,180 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:34,190 INFO L225 Difference]: With dead ends: 29 [2018-11-23 13:04:34,191 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 13:04:34,194 INFO L631 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-23 13:04:34,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 13:04:34,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 13:04:34,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:34,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 13:04:34,310 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:04:34,310 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:04:34,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:34,314 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 13:04:34,315 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:04:34,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:34,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:34,316 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:04:34,316 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:04:34,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:34,320 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 13:04:34,322 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:04:34,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:34,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:34,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:34,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:34,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:04:34,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 13:04:34,327 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 13:04:34,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:34,328 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 13:04:34,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:04:34,328 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:04:34,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:04:34,329 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:34,329 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:34,329 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:34,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:34,330 INFO L82 PathProgramCache]: Analyzing trace with hash -15914692, now seen corresponding path program 1 times [2018-11-23 13:04:34,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:34,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:34,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:34,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:34,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:34,542 INFO L256 TraceCheckUtils]: 0: Hoare triple {106#true} call ULTIMATE.init(); {106#true} is VALID [2018-11-23 13:04:34,543 INFO L273 TraceCheckUtils]: 1: Hoare triple {106#true} assume true; {106#true} is VALID [2018-11-23 13:04:34,543 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {106#true} {106#true} #32#return; {106#true} is VALID [2018-11-23 13:04:34,543 INFO L256 TraceCheckUtils]: 3: Hoare triple {106#true} call #t~ret1 := main(); {106#true} is VALID [2018-11-23 13:04:34,545 INFO L273 TraceCheckUtils]: 4: Hoare triple {106#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {108#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:34,545 INFO L273 TraceCheckUtils]: 5: Hoare triple {108#(<= main_~i~0 1)} assume !(~i~0 <= 8); {107#false} is VALID [2018-11-23 13:04:34,546 INFO L256 TraceCheckUtils]: 6: Hoare triple {107#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {107#false} is VALID [2018-11-23 13:04:34,546 INFO L273 TraceCheckUtils]: 7: Hoare triple {107#false} ~cond := #in~cond; {107#false} is VALID [2018-11-23 13:04:34,546 INFO L273 TraceCheckUtils]: 8: Hoare triple {107#false} assume 0 == ~cond; {107#false} is VALID [2018-11-23 13:04:34,546 INFO L273 TraceCheckUtils]: 9: Hoare triple {107#false} assume !false; {107#false} is VALID [2018-11-23 13:04:34,547 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-23 13:04:34,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:34,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:04:34,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:04:34,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:34,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:04:34,603 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:34,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:04:34,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:04:34,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:04:34,604 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2018-11-23 13:04:34,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:34,846 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-23 13:04:34,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:04:34,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:04:34,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:34,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:04:34,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-11-23 13:04:34,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:04:34,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-11-23 13:04:34,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 19 transitions. [2018-11-23 13:04:34,904 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:34,906 INFO L225 Difference]: With dead ends: 19 [2018-11-23 13:04:34,906 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 13:04:34,907 INFO L631 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-23 13:04:34,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 13:04:34,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-11-23 13:04:34,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:34,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 13 states. [2018-11-23 13:04:34,922 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 13 states. [2018-11-23 13:04:34,922 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 13 states. [2018-11-23 13:04:34,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:34,924 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:04:34,924 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:04:34,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:34,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:34,925 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 14 states. [2018-11-23 13:04:34,925 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 14 states. [2018-11-23 13:04:34,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:34,927 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:04:34,927 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:04:34,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:34,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:34,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:34,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:34,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:04:34,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-23 13:04:34,930 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-11-23 13:04:34,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:34,930 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-23 13:04:34,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:04:34,931 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:04:34,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:04:34,931 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:34,931 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:34,932 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:34,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:34,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1244203718, now seen corresponding path program 1 times [2018-11-23 13:04:34,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:34,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:34,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:34,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:34,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:35,131 INFO L256 TraceCheckUtils]: 0: Hoare triple {189#true} call ULTIMATE.init(); {189#true} is VALID [2018-11-23 13:04:35,131 INFO L273 TraceCheckUtils]: 1: Hoare triple {189#true} assume true; {189#true} is VALID [2018-11-23 13:04:35,132 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {189#true} {189#true} #32#return; {189#true} is VALID [2018-11-23 13:04:35,132 INFO L256 TraceCheckUtils]: 3: Hoare triple {189#true} call #t~ret1 := main(); {189#true} is VALID [2018-11-23 13:04:35,133 INFO L273 TraceCheckUtils]: 4: Hoare triple {189#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {191#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:35,133 INFO L273 TraceCheckUtils]: 5: Hoare triple {191#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {191#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:35,134 INFO L273 TraceCheckUtils]: 6: Hoare triple {191#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {192#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:35,135 INFO L273 TraceCheckUtils]: 7: Hoare triple {192#(<= main_~i~0 2)} assume !(~i~0 <= 8); {190#false} is VALID [2018-11-23 13:04:35,136 INFO L256 TraceCheckUtils]: 8: Hoare triple {190#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {190#false} is VALID [2018-11-23 13:04:35,136 INFO L273 TraceCheckUtils]: 9: Hoare triple {190#false} ~cond := #in~cond; {190#false} is VALID [2018-11-23 13:04:35,137 INFO L273 TraceCheckUtils]: 10: Hoare triple {190#false} assume 0 == ~cond; {190#false} is VALID [2018-11-23 13:04:35,137 INFO L273 TraceCheckUtils]: 11: Hoare triple {190#false} assume !false; {190#false} is VALID [2018-11-23 13:04:35,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:35,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:35,142 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-23 13:04:35,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:35,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:35,255 INFO L256 TraceCheckUtils]: 0: Hoare triple {189#true} call ULTIMATE.init(); {189#true} is VALID [2018-11-23 13:04:35,255 INFO L273 TraceCheckUtils]: 1: Hoare triple {189#true} assume true; {189#true} is VALID [2018-11-23 13:04:35,256 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {189#true} {189#true} #32#return; {189#true} is VALID [2018-11-23 13:04:35,256 INFO L256 TraceCheckUtils]: 3: Hoare triple {189#true} call #t~ret1 := main(); {189#true} is VALID [2018-11-23 13:04:35,258 INFO L273 TraceCheckUtils]: 4: Hoare triple {189#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {191#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:35,258 INFO L273 TraceCheckUtils]: 5: Hoare triple {191#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {191#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:35,260 INFO L273 TraceCheckUtils]: 6: Hoare triple {191#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {192#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:35,261 INFO L273 TraceCheckUtils]: 7: Hoare triple {192#(<= main_~i~0 2)} assume !(~i~0 <= 8); {190#false} is VALID [2018-11-23 13:04:35,261 INFO L256 TraceCheckUtils]: 8: Hoare triple {190#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {190#false} is VALID [2018-11-23 13:04:35,262 INFO L273 TraceCheckUtils]: 9: Hoare triple {190#false} ~cond := #in~cond; {190#false} is VALID [2018-11-23 13:04:35,262 INFO L273 TraceCheckUtils]: 10: Hoare triple {190#false} assume 0 == ~cond; {190#false} is VALID [2018-11-23 13:04:35,262 INFO L273 TraceCheckUtils]: 11: Hoare triple {190#false} assume !false; {190#false} is VALID [2018-11-23 13:04:35,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:35,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:35,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-23 13:04:35,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-23 13:04:35,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:35,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 13:04:35,326 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:35,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:04:35,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:04:35,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:04:35,328 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 4 states. [2018-11-23 13:04:35,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:35,390 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 13:04:35,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:04:35,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-23 13:04:35,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:35,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:04:35,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-23 13:04:35,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:04:35,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-23 13:04:35,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 21 transitions. [2018-11-23 13:04:35,467 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:35,468 INFO L225 Difference]: With dead ends: 21 [2018-11-23 13:04:35,469 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 13:04:35,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:04:35,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 13:04:35,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-23 13:04:35,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:35,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 15 states. [2018-11-23 13:04:35,606 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 15 states. [2018-11-23 13:04:35,606 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 15 states. [2018-11-23 13:04:35,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:35,608 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:04:35,608 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:04:35,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:35,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:35,609 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 16 states. [2018-11-23 13:04:35,609 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 16 states. [2018-11-23 13:04:35,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:35,611 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:04:35,612 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:04:35,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:35,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:35,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:35,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:35,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:04:35,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 13:04:35,614 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-11-23 13:04:35,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:35,615 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-23 13:04:35,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:04:35,615 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 13:04:35,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:04:35,616 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:35,616 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:35,616 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:35,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:35,617 INFO L82 PathProgramCache]: Analyzing trace with hash -513951304, now seen corresponding path program 2 times [2018-11-23 13:04:35,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:35,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:35,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:35,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:35,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:35,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:35,956 INFO L256 TraceCheckUtils]: 0: Hoare triple {316#true} call ULTIMATE.init(); {316#true} is VALID [2018-11-23 13:04:35,957 INFO L273 TraceCheckUtils]: 1: Hoare triple {316#true} assume true; {316#true} is VALID [2018-11-23 13:04:35,957 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {316#true} {316#true} #32#return; {316#true} is VALID [2018-11-23 13:04:35,958 INFO L256 TraceCheckUtils]: 3: Hoare triple {316#true} call #t~ret1 := main(); {316#true} is VALID [2018-11-23 13:04:35,961 INFO L273 TraceCheckUtils]: 4: Hoare triple {316#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {318#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:35,962 INFO L273 TraceCheckUtils]: 5: Hoare triple {318#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {318#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:35,963 INFO L273 TraceCheckUtils]: 6: Hoare triple {318#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {319#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:35,968 INFO L273 TraceCheckUtils]: 7: Hoare triple {319#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {319#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:35,969 INFO L273 TraceCheckUtils]: 8: Hoare triple {319#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {320#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:35,973 INFO L273 TraceCheckUtils]: 9: Hoare triple {320#(<= main_~i~0 3)} assume !(~i~0 <= 8); {317#false} is VALID [2018-11-23 13:04:35,973 INFO L256 TraceCheckUtils]: 10: Hoare triple {317#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {317#false} is VALID [2018-11-23 13:04:35,973 INFO L273 TraceCheckUtils]: 11: Hoare triple {317#false} ~cond := #in~cond; {317#false} is VALID [2018-11-23 13:04:35,974 INFO L273 TraceCheckUtils]: 12: Hoare triple {317#false} assume 0 == ~cond; {317#false} is VALID [2018-11-23 13:04:35,974 INFO L273 TraceCheckUtils]: 13: Hoare triple {317#false} assume !false; {317#false} is VALID [2018-11-23 13:04:35,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:35,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:35,975 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-23 13:04:35,985 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:04:35,995 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:04:35,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:36,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:36,074 INFO L256 TraceCheckUtils]: 0: Hoare triple {316#true} call ULTIMATE.init(); {316#true} is VALID [2018-11-23 13:04:36,075 INFO L273 TraceCheckUtils]: 1: Hoare triple {316#true} assume true; {316#true} is VALID [2018-11-23 13:04:36,076 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {316#true} {316#true} #32#return; {316#true} is VALID [2018-11-23 13:04:36,076 INFO L256 TraceCheckUtils]: 3: Hoare triple {316#true} call #t~ret1 := main(); {316#true} is VALID [2018-11-23 13:04:36,078 INFO L273 TraceCheckUtils]: 4: Hoare triple {316#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {318#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:36,079 INFO L273 TraceCheckUtils]: 5: Hoare triple {318#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {318#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:36,080 INFO L273 TraceCheckUtils]: 6: Hoare triple {318#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {319#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:36,080 INFO L273 TraceCheckUtils]: 7: Hoare triple {319#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {319#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:36,081 INFO L273 TraceCheckUtils]: 8: Hoare triple {319#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {320#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:36,082 INFO L273 TraceCheckUtils]: 9: Hoare triple {320#(<= main_~i~0 3)} assume !(~i~0 <= 8); {317#false} is VALID [2018-11-23 13:04:36,082 INFO L256 TraceCheckUtils]: 10: Hoare triple {317#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {317#false} is VALID [2018-11-23 13:04:36,083 INFO L273 TraceCheckUtils]: 11: Hoare triple {317#false} ~cond := #in~cond; {317#false} is VALID [2018-11-23 13:04:36,083 INFO L273 TraceCheckUtils]: 12: Hoare triple {317#false} assume 0 == ~cond; {317#false} is VALID [2018-11-23 13:04:36,084 INFO L273 TraceCheckUtils]: 13: Hoare triple {317#false} assume !false; {317#false} is VALID [2018-11-23 13:04:36,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:36,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:36,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-23 13:04:36,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 13:04:36,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:36,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:04:36,132 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:36,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:04:36,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:04:36,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:04:36,133 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2018-11-23 13:04:36,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:36,211 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-23 13:04:36,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:04:36,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 13:04:36,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:36,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:04:36,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-23 13:04:36,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:04:36,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-23 13:04:36,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 23 transitions. [2018-11-23 13:04:36,343 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:36,344 INFO L225 Difference]: With dead ends: 23 [2018-11-23 13:04:36,345 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 13:04:36,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:04:36,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 13:04:36,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-23 13:04:36,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:36,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 17 states. [2018-11-23 13:04:36,364 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 17 states. [2018-11-23 13:04:36,364 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 17 states. [2018-11-23 13:04:36,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:36,366 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:04:36,367 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:04:36,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:36,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:36,367 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states. [2018-11-23 13:04:36,368 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states. [2018-11-23 13:04:36,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:36,370 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:04:36,370 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:04:36,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:36,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:36,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:36,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:36,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:04:36,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-23 13:04:36,373 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-11-23 13:04:36,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:36,373 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-23 13:04:36,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:04:36,373 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 13:04:36,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:04:36,374 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:36,374 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:36,374 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:36,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:36,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1178949302, now seen corresponding path program 3 times [2018-11-23 13:04:36,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:36,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:36,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:36,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:04:36,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:36,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:36,555 INFO L256 TraceCheckUtils]: 0: Hoare triple {460#true} call ULTIMATE.init(); {460#true} is VALID [2018-11-23 13:04:36,556 INFO L273 TraceCheckUtils]: 1: Hoare triple {460#true} assume true; {460#true} is VALID [2018-11-23 13:04:36,556 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {460#true} {460#true} #32#return; {460#true} is VALID [2018-11-23 13:04:36,556 INFO L256 TraceCheckUtils]: 3: Hoare triple {460#true} call #t~ret1 := main(); {460#true} is VALID [2018-11-23 13:04:36,560 INFO L273 TraceCheckUtils]: 4: Hoare triple {460#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {462#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:36,570 INFO L273 TraceCheckUtils]: 5: Hoare triple {462#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {462#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:36,573 INFO L273 TraceCheckUtils]: 6: Hoare triple {462#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {463#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:36,573 INFO L273 TraceCheckUtils]: 7: Hoare triple {463#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {463#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:36,581 INFO L273 TraceCheckUtils]: 8: Hoare triple {463#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {464#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:36,584 INFO L273 TraceCheckUtils]: 9: Hoare triple {464#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {464#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:36,584 INFO L273 TraceCheckUtils]: 10: Hoare triple {464#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {465#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:36,586 INFO L273 TraceCheckUtils]: 11: Hoare triple {465#(<= main_~i~0 4)} assume !(~i~0 <= 8); {461#false} is VALID [2018-11-23 13:04:36,586 INFO L256 TraceCheckUtils]: 12: Hoare triple {461#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {461#false} is VALID [2018-11-23 13:04:36,586 INFO L273 TraceCheckUtils]: 13: Hoare triple {461#false} ~cond := #in~cond; {461#false} is VALID [2018-11-23 13:04:36,586 INFO L273 TraceCheckUtils]: 14: Hoare triple {461#false} assume 0 == ~cond; {461#false} is VALID [2018-11-23 13:04:36,587 INFO L273 TraceCheckUtils]: 15: Hoare triple {461#false} assume !false; {461#false} is VALID [2018-11-23 13:04:36,588 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:36,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:36,589 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-23 13:04:36,606 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:04:36,618 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 13:04:36,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:36,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:36,763 INFO L256 TraceCheckUtils]: 0: Hoare triple {460#true} call ULTIMATE.init(); {460#true} is VALID [2018-11-23 13:04:36,764 INFO L273 TraceCheckUtils]: 1: Hoare triple {460#true} assume true; {460#true} is VALID [2018-11-23 13:04:36,764 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {460#true} {460#true} #32#return; {460#true} is VALID [2018-11-23 13:04:36,765 INFO L256 TraceCheckUtils]: 3: Hoare triple {460#true} call #t~ret1 := main(); {460#true} is VALID [2018-11-23 13:04:36,765 INFO L273 TraceCheckUtils]: 4: Hoare triple {460#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {462#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:36,767 INFO L273 TraceCheckUtils]: 5: Hoare triple {462#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {462#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:36,769 INFO L273 TraceCheckUtils]: 6: Hoare triple {462#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {463#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:36,769 INFO L273 TraceCheckUtils]: 7: Hoare triple {463#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {463#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:36,771 INFO L273 TraceCheckUtils]: 8: Hoare triple {463#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {464#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:36,772 INFO L273 TraceCheckUtils]: 9: Hoare triple {464#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {464#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:36,773 INFO L273 TraceCheckUtils]: 10: Hoare triple {464#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {465#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:36,775 INFO L273 TraceCheckUtils]: 11: Hoare triple {465#(<= main_~i~0 4)} assume !(~i~0 <= 8); {461#false} is VALID [2018-11-23 13:04:36,775 INFO L256 TraceCheckUtils]: 12: Hoare triple {461#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {461#false} is VALID [2018-11-23 13:04:36,776 INFO L273 TraceCheckUtils]: 13: Hoare triple {461#false} ~cond := #in~cond; {461#false} is VALID [2018-11-23 13:04:36,776 INFO L273 TraceCheckUtils]: 14: Hoare triple {461#false} assume 0 == ~cond; {461#false} is VALID [2018-11-23 13:04:36,776 INFO L273 TraceCheckUtils]: 15: Hoare triple {461#false} assume !false; {461#false} is VALID [2018-11-23 13:04:36,777 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:36,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:36,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 13:04:36,796 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 13:04:36,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:36,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:04:36,830 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:36,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:04:36,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:04:36,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:04:36,831 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2018-11-23 13:04:36,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:36,944 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-23 13:04:36,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:04:36,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 13:04:36,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:36,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:04:36,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2018-11-23 13:04:36,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:04:36,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2018-11-23 13:04:36,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 25 transitions. [2018-11-23 13:04:36,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:36,994 INFO L225 Difference]: With dead ends: 25 [2018-11-23 13:04:36,994 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 13:04:36,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:04:36,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 13:04:37,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-11-23 13:04:37,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:37,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 19 states. [2018-11-23 13:04:37,011 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 19 states. [2018-11-23 13:04:37,011 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 19 states. [2018-11-23 13:04:37,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:37,014 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 13:04:37,014 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 13:04:37,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:37,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:37,015 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 20 states. [2018-11-23 13:04:37,015 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 20 states. [2018-11-23 13:04:37,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:37,017 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 13:04:37,017 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 13:04:37,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:37,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:37,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:37,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:37,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:04:37,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-23 13:04:37,021 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-11-23 13:04:37,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:37,021 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-23 13:04:37,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:04:37,021 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-23 13:04:37,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:04:37,022 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:37,022 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:37,023 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:37,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:37,023 INFO L82 PathProgramCache]: Analyzing trace with hash 263826484, now seen corresponding path program 4 times [2018-11-23 13:04:37,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:37,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:37,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:37,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:04:37,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:37,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:37,124 INFO L256 TraceCheckUtils]: 0: Hoare triple {621#true} call ULTIMATE.init(); {621#true} is VALID [2018-11-23 13:04:37,124 INFO L273 TraceCheckUtils]: 1: Hoare triple {621#true} assume true; {621#true} is VALID [2018-11-23 13:04:37,125 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {621#true} {621#true} #32#return; {621#true} is VALID [2018-11-23 13:04:37,125 INFO L256 TraceCheckUtils]: 3: Hoare triple {621#true} call #t~ret1 := main(); {621#true} is VALID [2018-11-23 13:04:37,130 INFO L273 TraceCheckUtils]: 4: Hoare triple {621#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {623#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:37,135 INFO L273 TraceCheckUtils]: 5: Hoare triple {623#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {623#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:37,136 INFO L273 TraceCheckUtils]: 6: Hoare triple {623#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {624#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:37,137 INFO L273 TraceCheckUtils]: 7: Hoare triple {624#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {624#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:37,137 INFO L273 TraceCheckUtils]: 8: Hoare triple {624#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {625#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:37,138 INFO L273 TraceCheckUtils]: 9: Hoare triple {625#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {625#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:37,139 INFO L273 TraceCheckUtils]: 10: Hoare triple {625#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {626#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:37,140 INFO L273 TraceCheckUtils]: 11: Hoare triple {626#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {626#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:37,152 INFO L273 TraceCheckUtils]: 12: Hoare triple {626#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {627#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:37,153 INFO L273 TraceCheckUtils]: 13: Hoare triple {627#(<= main_~i~0 5)} assume !(~i~0 <= 8); {622#false} is VALID [2018-11-23 13:04:37,153 INFO L256 TraceCheckUtils]: 14: Hoare triple {622#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {622#false} is VALID [2018-11-23 13:04:37,153 INFO L273 TraceCheckUtils]: 15: Hoare triple {622#false} ~cond := #in~cond; {622#false} is VALID [2018-11-23 13:04:37,153 INFO L273 TraceCheckUtils]: 16: Hoare triple {622#false} assume 0 == ~cond; {622#false} is VALID [2018-11-23 13:04:37,154 INFO L273 TraceCheckUtils]: 17: Hoare triple {622#false} assume !false; {622#false} is VALID [2018-11-23 13:04:37,154 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:37,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:37,155 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-23 13:04:37,173 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:04:37,183 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:04:37,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:37,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:37,427 INFO L256 TraceCheckUtils]: 0: Hoare triple {621#true} call ULTIMATE.init(); {621#true} is VALID [2018-11-23 13:04:37,428 INFO L273 TraceCheckUtils]: 1: Hoare triple {621#true} assume true; {621#true} is VALID [2018-11-23 13:04:37,428 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {621#true} {621#true} #32#return; {621#true} is VALID [2018-11-23 13:04:37,428 INFO L256 TraceCheckUtils]: 3: Hoare triple {621#true} call #t~ret1 := main(); {621#true} is VALID [2018-11-23 13:04:37,429 INFO L273 TraceCheckUtils]: 4: Hoare triple {621#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {623#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:37,430 INFO L273 TraceCheckUtils]: 5: Hoare triple {623#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {623#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:37,432 INFO L273 TraceCheckUtils]: 6: Hoare triple {623#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {624#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:37,433 INFO L273 TraceCheckUtils]: 7: Hoare triple {624#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {624#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:37,434 INFO L273 TraceCheckUtils]: 8: Hoare triple {624#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {625#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:37,434 INFO L273 TraceCheckUtils]: 9: Hoare triple {625#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {625#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:37,435 INFO L273 TraceCheckUtils]: 10: Hoare triple {625#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {626#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:37,435 INFO L273 TraceCheckUtils]: 11: Hoare triple {626#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {626#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:37,436 INFO L273 TraceCheckUtils]: 12: Hoare triple {626#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {627#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:37,437 INFO L273 TraceCheckUtils]: 13: Hoare triple {627#(<= main_~i~0 5)} assume !(~i~0 <= 8); {622#false} is VALID [2018-11-23 13:04:37,438 INFO L256 TraceCheckUtils]: 14: Hoare triple {622#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {622#false} is VALID [2018-11-23 13:04:37,438 INFO L273 TraceCheckUtils]: 15: Hoare triple {622#false} ~cond := #in~cond; {622#false} is VALID [2018-11-23 13:04:37,438 INFO L273 TraceCheckUtils]: 16: Hoare triple {622#false} assume 0 == ~cond; {622#false} is VALID [2018-11-23 13:04:37,439 INFO L273 TraceCheckUtils]: 17: Hoare triple {622#false} assume !false; {622#false} is VALID [2018-11-23 13:04:37,440 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:37,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:37,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-23 13:04:37,461 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-23 13:04:37,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:37,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:04:37,499 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:37,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:04:37,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:04:37,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:04:37,500 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 7 states. [2018-11-23 13:04:37,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:37,596 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-23 13:04:37,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:04:37,597 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-23 13:04:37,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:37,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:04:37,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2018-11-23 13:04:37,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:04:37,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2018-11-23 13:04:37,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 27 transitions. [2018-11-23 13:04:37,654 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:37,655 INFO L225 Difference]: With dead ends: 27 [2018-11-23 13:04:37,655 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 13:04:37,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:04:37,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 13:04:37,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-23 13:04:37,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:37,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2018-11-23 13:04:37,684 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2018-11-23 13:04:37,684 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2018-11-23 13:04:37,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:37,685 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 13:04:37,685 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-23 13:04:37,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:37,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:37,686 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2018-11-23 13:04:37,687 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2018-11-23 13:04:37,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:37,688 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 13:04:37,688 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-23 13:04:37,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:37,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:37,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:37,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:37,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:04:37,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-23 13:04:37,691 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-11-23 13:04:37,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:37,692 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-23 13:04:37,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:04:37,692 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 13:04:37,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:04:37,693 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:37,693 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:37,693 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:37,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:37,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1299094066, now seen corresponding path program 5 times [2018-11-23 13:04:37,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:37,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:37,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:37,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:04:37,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:37,829 INFO L256 TraceCheckUtils]: 0: Hoare triple {799#true} call ULTIMATE.init(); {799#true} is VALID [2018-11-23 13:04:37,829 INFO L273 TraceCheckUtils]: 1: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 13:04:37,830 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {799#true} {799#true} #32#return; {799#true} is VALID [2018-11-23 13:04:37,830 INFO L256 TraceCheckUtils]: 3: Hoare triple {799#true} call #t~ret1 := main(); {799#true} is VALID [2018-11-23 13:04:37,849 INFO L273 TraceCheckUtils]: 4: Hoare triple {799#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {801#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:37,864 INFO L273 TraceCheckUtils]: 5: Hoare triple {801#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {801#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:37,871 INFO L273 TraceCheckUtils]: 6: Hoare triple {801#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {802#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:37,872 INFO L273 TraceCheckUtils]: 7: Hoare triple {802#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {802#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:37,876 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {803#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:37,876 INFO L273 TraceCheckUtils]: 9: Hoare triple {803#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {803#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:37,880 INFO L273 TraceCheckUtils]: 10: Hoare triple {803#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {804#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:37,880 INFO L273 TraceCheckUtils]: 11: Hoare triple {804#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {804#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:37,881 INFO L273 TraceCheckUtils]: 12: Hoare triple {804#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {805#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:37,882 INFO L273 TraceCheckUtils]: 13: Hoare triple {805#(<= main_~i~0 5)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {805#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:37,882 INFO L273 TraceCheckUtils]: 14: Hoare triple {805#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {806#(<= main_~i~0 6)} is VALID [2018-11-23 13:04:37,883 INFO L273 TraceCheckUtils]: 15: Hoare triple {806#(<= main_~i~0 6)} assume !(~i~0 <= 8); {800#false} is VALID [2018-11-23 13:04:37,883 INFO L256 TraceCheckUtils]: 16: Hoare triple {800#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {800#false} is VALID [2018-11-23 13:04:37,883 INFO L273 TraceCheckUtils]: 17: Hoare triple {800#false} ~cond := #in~cond; {800#false} is VALID [2018-11-23 13:04:37,883 INFO L273 TraceCheckUtils]: 18: Hoare triple {800#false} assume 0 == ~cond; {800#false} is VALID [2018-11-23 13:04:37,884 INFO L273 TraceCheckUtils]: 19: Hoare triple {800#false} assume !false; {800#false} is VALID [2018-11-23 13:04:37,885 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:37,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:37,886 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:04:37,895 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:04:37,912 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 13:04:37,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:37,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:37,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:38,006 INFO L256 TraceCheckUtils]: 0: Hoare triple {799#true} call ULTIMATE.init(); {799#true} is VALID [2018-11-23 13:04:38,007 INFO L273 TraceCheckUtils]: 1: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 13:04:38,007 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {799#true} {799#true} #32#return; {799#true} is VALID [2018-11-23 13:04:38,008 INFO L256 TraceCheckUtils]: 3: Hoare triple {799#true} call #t~ret1 := main(); {799#true} is VALID [2018-11-23 13:04:38,008 INFO L273 TraceCheckUtils]: 4: Hoare triple {799#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {801#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:38,009 INFO L273 TraceCheckUtils]: 5: Hoare triple {801#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {801#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:38,010 INFO L273 TraceCheckUtils]: 6: Hoare triple {801#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {802#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:38,010 INFO L273 TraceCheckUtils]: 7: Hoare triple {802#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {802#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:38,012 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {803#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:38,012 INFO L273 TraceCheckUtils]: 9: Hoare triple {803#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {803#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:38,013 INFO L273 TraceCheckUtils]: 10: Hoare triple {803#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {804#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:38,014 INFO L273 TraceCheckUtils]: 11: Hoare triple {804#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {804#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:38,015 INFO L273 TraceCheckUtils]: 12: Hoare triple {804#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {805#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:38,015 INFO L273 TraceCheckUtils]: 13: Hoare triple {805#(<= main_~i~0 5)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {805#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:38,016 INFO L273 TraceCheckUtils]: 14: Hoare triple {805#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {806#(<= main_~i~0 6)} is VALID [2018-11-23 13:04:38,016 INFO L273 TraceCheckUtils]: 15: Hoare triple {806#(<= main_~i~0 6)} assume !(~i~0 <= 8); {800#false} is VALID [2018-11-23 13:04:38,017 INFO L256 TraceCheckUtils]: 16: Hoare triple {800#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {800#false} is VALID [2018-11-23 13:04:38,017 INFO L273 TraceCheckUtils]: 17: Hoare triple {800#false} ~cond := #in~cond; {800#false} is VALID [2018-11-23 13:04:38,017 INFO L273 TraceCheckUtils]: 18: Hoare triple {800#false} assume 0 == ~cond; {800#false} is VALID [2018-11-23 13:04:38,018 INFO L273 TraceCheckUtils]: 19: Hoare triple {800#false} assume !false; {800#false} is VALID [2018-11-23 13:04:38,019 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:38,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:38,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-23 13:04:38,040 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-23 13:04:38,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:38,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:04:38,063 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:38,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:04:38,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:04:38,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:04:38,064 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 8 states. [2018-11-23 13:04:38,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:38,229 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-23 13:04:38,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:04:38,230 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-23 13:04:38,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:38,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:04:38,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2018-11-23 13:04:38,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:04:38,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2018-11-23 13:04:38,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2018-11-23 13:04:38,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:38,272 INFO L225 Difference]: With dead ends: 29 [2018-11-23 13:04:38,273 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 13:04:38,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:04:38,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 13:04:38,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-23 13:04:38,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:38,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2018-11-23 13:04:38,290 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2018-11-23 13:04:38,290 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2018-11-23 13:04:38,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:38,292 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-23 13:04:38,293 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 13:04:38,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:38,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:38,294 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2018-11-23 13:04:38,294 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2018-11-23 13:04:38,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:38,296 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-23 13:04:38,296 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 13:04:38,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:38,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:38,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:38,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:38,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:04:38,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-23 13:04:38,299 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-11-23 13:04:38,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:38,299 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-11-23 13:04:38,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:04:38,299 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-23 13:04:38,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:04:38,300 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:38,300 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:38,300 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:38,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:38,301 INFO L82 PathProgramCache]: Analyzing trace with hash -241172304, now seen corresponding path program 6 times [2018-11-23 13:04:38,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:38,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:38,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:38,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:04:38,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:38,495 INFO L256 TraceCheckUtils]: 0: Hoare triple {994#true} call ULTIMATE.init(); {994#true} is VALID [2018-11-23 13:04:38,495 INFO L273 TraceCheckUtils]: 1: Hoare triple {994#true} assume true; {994#true} is VALID [2018-11-23 13:04:38,496 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {994#true} {994#true} #32#return; {994#true} is VALID [2018-11-23 13:04:38,496 INFO L256 TraceCheckUtils]: 3: Hoare triple {994#true} call #t~ret1 := main(); {994#true} is VALID [2018-11-23 13:04:38,497 INFO L273 TraceCheckUtils]: 4: Hoare triple {994#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {996#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:38,498 INFO L273 TraceCheckUtils]: 5: Hoare triple {996#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {996#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:38,498 INFO L273 TraceCheckUtils]: 6: Hoare triple {996#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {997#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:38,499 INFO L273 TraceCheckUtils]: 7: Hoare triple {997#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {997#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:38,499 INFO L273 TraceCheckUtils]: 8: Hoare triple {997#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {998#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:38,500 INFO L273 TraceCheckUtils]: 9: Hoare triple {998#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {998#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:38,501 INFO L273 TraceCheckUtils]: 10: Hoare triple {998#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {999#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:38,502 INFO L273 TraceCheckUtils]: 11: Hoare triple {999#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {999#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:38,506 INFO L273 TraceCheckUtils]: 12: Hoare triple {999#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1000#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:38,507 INFO L273 TraceCheckUtils]: 13: Hoare triple {1000#(<= main_~i~0 5)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1000#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:38,508 INFO L273 TraceCheckUtils]: 14: Hoare triple {1000#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1001#(<= main_~i~0 6)} is VALID [2018-11-23 13:04:38,508 INFO L273 TraceCheckUtils]: 15: Hoare triple {1001#(<= main_~i~0 6)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1001#(<= main_~i~0 6)} is VALID [2018-11-23 13:04:38,509 INFO L273 TraceCheckUtils]: 16: Hoare triple {1001#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1002#(<= main_~i~0 7)} is VALID [2018-11-23 13:04:38,510 INFO L273 TraceCheckUtils]: 17: Hoare triple {1002#(<= main_~i~0 7)} assume !(~i~0 <= 8); {995#false} is VALID [2018-11-23 13:04:38,510 INFO L256 TraceCheckUtils]: 18: Hoare triple {995#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {995#false} is VALID [2018-11-23 13:04:38,511 INFO L273 TraceCheckUtils]: 19: Hoare triple {995#false} ~cond := #in~cond; {995#false} is VALID [2018-11-23 13:04:38,511 INFO L273 TraceCheckUtils]: 20: Hoare triple {995#false} assume 0 == ~cond; {995#false} is VALID [2018-11-23 13:04:38,511 INFO L273 TraceCheckUtils]: 21: Hoare triple {995#false} assume !false; {995#false} is VALID [2018-11-23 13:04:38,513 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:38,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:38,514 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:04:38,531 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:04:38,545 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 13:04:38,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:38,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:38,656 INFO L256 TraceCheckUtils]: 0: Hoare triple {994#true} call ULTIMATE.init(); {994#true} is VALID [2018-11-23 13:04:38,657 INFO L273 TraceCheckUtils]: 1: Hoare triple {994#true} assume true; {994#true} is VALID [2018-11-23 13:04:38,657 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {994#true} {994#true} #32#return; {994#true} is VALID [2018-11-23 13:04:38,658 INFO L256 TraceCheckUtils]: 3: Hoare triple {994#true} call #t~ret1 := main(); {994#true} is VALID [2018-11-23 13:04:38,663 INFO L273 TraceCheckUtils]: 4: Hoare triple {994#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {996#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:38,668 INFO L273 TraceCheckUtils]: 5: Hoare triple {996#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {996#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:38,668 INFO L273 TraceCheckUtils]: 6: Hoare triple {996#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {997#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:38,674 INFO L273 TraceCheckUtils]: 7: Hoare triple {997#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {997#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:38,674 INFO L273 TraceCheckUtils]: 8: Hoare triple {997#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {998#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:38,676 INFO L273 TraceCheckUtils]: 9: Hoare triple {998#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {998#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:38,678 INFO L273 TraceCheckUtils]: 10: Hoare triple {998#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {999#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:38,679 INFO L273 TraceCheckUtils]: 11: Hoare triple {999#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {999#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:38,680 INFO L273 TraceCheckUtils]: 12: Hoare triple {999#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1000#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:38,680 INFO L273 TraceCheckUtils]: 13: Hoare triple {1000#(<= main_~i~0 5)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1000#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:38,681 INFO L273 TraceCheckUtils]: 14: Hoare triple {1000#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1001#(<= main_~i~0 6)} is VALID [2018-11-23 13:04:38,681 INFO L273 TraceCheckUtils]: 15: Hoare triple {1001#(<= main_~i~0 6)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1001#(<= main_~i~0 6)} is VALID [2018-11-23 13:04:38,682 INFO L273 TraceCheckUtils]: 16: Hoare triple {1001#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1002#(<= main_~i~0 7)} is VALID [2018-11-23 13:04:38,683 INFO L273 TraceCheckUtils]: 17: Hoare triple {1002#(<= main_~i~0 7)} assume !(~i~0 <= 8); {995#false} is VALID [2018-11-23 13:04:38,683 INFO L256 TraceCheckUtils]: 18: Hoare triple {995#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {995#false} is VALID [2018-11-23 13:04:38,684 INFO L273 TraceCheckUtils]: 19: Hoare triple {995#false} ~cond := #in~cond; {995#false} is VALID [2018-11-23 13:04:38,684 INFO L273 TraceCheckUtils]: 20: Hoare triple {995#false} assume 0 == ~cond; {995#false} is VALID [2018-11-23 13:04:38,685 INFO L273 TraceCheckUtils]: 21: Hoare triple {995#false} assume !false; {995#false} is VALID [2018-11-23 13:04:38,686 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:38,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:38,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-23 13:04:38,708 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-23 13:04:38,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:38,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:04:38,735 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:38,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:04:38,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:04:38,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:04:38,736 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2018-11-23 13:04:38,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:38,907 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-23 13:04:38,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:04:38,907 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-23 13:04:38,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:38,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:04:38,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 31 transitions. [2018-11-23 13:04:38,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:04:38,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 31 transitions. [2018-11-23 13:04:38,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 31 transitions. [2018-11-23 13:04:38,954 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:38,955 INFO L225 Difference]: With dead ends: 31 [2018-11-23 13:04:38,956 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 13:04:38,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:04:38,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 13:04:38,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-23 13:04:38,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:38,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 25 states. [2018-11-23 13:04:38,974 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 25 states. [2018-11-23 13:04:38,975 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 25 states. [2018-11-23 13:04:38,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:38,977 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 13:04:38,977 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 13:04:38,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:38,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:38,978 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states. [2018-11-23 13:04:38,978 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states. [2018-11-23 13:04:38,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:38,980 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 13:04:38,980 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 13:04:38,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:38,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:38,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:38,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:38,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:04:38,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-11-23 13:04:38,982 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-11-23 13:04:38,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:38,983 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-11-23 13:04:38,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:04:38,983 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-23 13:04:38,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:04:38,984 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:38,984 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:38,984 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:38,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:38,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1326563246, now seen corresponding path program 7 times [2018-11-23 13:04:38,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:38,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:38,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:38,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:04:38,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:39,169 INFO L256 TraceCheckUtils]: 0: Hoare triple {1206#true} call ULTIMATE.init(); {1206#true} is VALID [2018-11-23 13:04:39,170 INFO L273 TraceCheckUtils]: 1: Hoare triple {1206#true} assume true; {1206#true} is VALID [2018-11-23 13:04:39,170 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1206#true} {1206#true} #32#return; {1206#true} is VALID [2018-11-23 13:04:39,170 INFO L256 TraceCheckUtils]: 3: Hoare triple {1206#true} call #t~ret1 := main(); {1206#true} is VALID [2018-11-23 13:04:39,171 INFO L273 TraceCheckUtils]: 4: Hoare triple {1206#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1208#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:39,171 INFO L273 TraceCheckUtils]: 5: Hoare triple {1208#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1208#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:39,172 INFO L273 TraceCheckUtils]: 6: Hoare triple {1208#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1209#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:39,173 INFO L273 TraceCheckUtils]: 7: Hoare triple {1209#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1209#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:39,174 INFO L273 TraceCheckUtils]: 8: Hoare triple {1209#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1210#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:39,174 INFO L273 TraceCheckUtils]: 9: Hoare triple {1210#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1210#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:39,175 INFO L273 TraceCheckUtils]: 10: Hoare triple {1210#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1211#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:39,176 INFO L273 TraceCheckUtils]: 11: Hoare triple {1211#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1211#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:39,177 INFO L273 TraceCheckUtils]: 12: Hoare triple {1211#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1212#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:39,178 INFO L273 TraceCheckUtils]: 13: Hoare triple {1212#(<= main_~i~0 5)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1212#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:39,179 INFO L273 TraceCheckUtils]: 14: Hoare triple {1212#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1213#(<= main_~i~0 6)} is VALID [2018-11-23 13:04:39,180 INFO L273 TraceCheckUtils]: 15: Hoare triple {1213#(<= main_~i~0 6)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1213#(<= main_~i~0 6)} is VALID [2018-11-23 13:04:39,181 INFO L273 TraceCheckUtils]: 16: Hoare triple {1213#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1214#(<= main_~i~0 7)} is VALID [2018-11-23 13:04:39,182 INFO L273 TraceCheckUtils]: 17: Hoare triple {1214#(<= main_~i~0 7)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1214#(<= main_~i~0 7)} is VALID [2018-11-23 13:04:39,183 INFO L273 TraceCheckUtils]: 18: Hoare triple {1214#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1215#(<= main_~i~0 8)} is VALID [2018-11-23 13:04:39,183 INFO L273 TraceCheckUtils]: 19: Hoare triple {1215#(<= main_~i~0 8)} assume !(~i~0 <= 8); {1207#false} is VALID [2018-11-23 13:04:39,184 INFO L256 TraceCheckUtils]: 20: Hoare triple {1207#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1207#false} is VALID [2018-11-23 13:04:39,184 INFO L273 TraceCheckUtils]: 21: Hoare triple {1207#false} ~cond := #in~cond; {1207#false} is VALID [2018-11-23 13:04:39,184 INFO L273 TraceCheckUtils]: 22: Hoare triple {1207#false} assume 0 == ~cond; {1207#false} is VALID [2018-11-23 13:04:39,185 INFO L273 TraceCheckUtils]: 23: Hoare triple {1207#false} assume !false; {1207#false} is VALID [2018-11-23 13:04:39,187 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:39,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:39,187 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:04:39,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:39,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:39,337 INFO L256 TraceCheckUtils]: 0: Hoare triple {1206#true} call ULTIMATE.init(); {1206#true} is VALID [2018-11-23 13:04:39,337 INFO L273 TraceCheckUtils]: 1: Hoare triple {1206#true} assume true; {1206#true} is VALID [2018-11-23 13:04:39,338 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1206#true} {1206#true} #32#return; {1206#true} is VALID [2018-11-23 13:04:39,338 INFO L256 TraceCheckUtils]: 3: Hoare triple {1206#true} call #t~ret1 := main(); {1206#true} is VALID [2018-11-23 13:04:39,342 INFO L273 TraceCheckUtils]: 4: Hoare triple {1206#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1208#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:39,343 INFO L273 TraceCheckUtils]: 5: Hoare triple {1208#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1208#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:39,346 INFO L273 TraceCheckUtils]: 6: Hoare triple {1208#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1209#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:39,350 INFO L273 TraceCheckUtils]: 7: Hoare triple {1209#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1209#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:39,352 INFO L273 TraceCheckUtils]: 8: Hoare triple {1209#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1210#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:39,352 INFO L273 TraceCheckUtils]: 9: Hoare triple {1210#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1210#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:39,354 INFO L273 TraceCheckUtils]: 10: Hoare triple {1210#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1211#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:39,354 INFO L273 TraceCheckUtils]: 11: Hoare triple {1211#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1211#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:39,355 INFO L273 TraceCheckUtils]: 12: Hoare triple {1211#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1212#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:39,355 INFO L273 TraceCheckUtils]: 13: Hoare triple {1212#(<= main_~i~0 5)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1212#(<= main_~i~0 5)} is VALID [2018-11-23 13:04:39,356 INFO L273 TraceCheckUtils]: 14: Hoare triple {1212#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1213#(<= main_~i~0 6)} is VALID [2018-11-23 13:04:39,357 INFO L273 TraceCheckUtils]: 15: Hoare triple {1213#(<= main_~i~0 6)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1213#(<= main_~i~0 6)} is VALID [2018-11-23 13:04:39,357 INFO L273 TraceCheckUtils]: 16: Hoare triple {1213#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1214#(<= main_~i~0 7)} is VALID [2018-11-23 13:04:39,358 INFO L273 TraceCheckUtils]: 17: Hoare triple {1214#(<= main_~i~0 7)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1214#(<= main_~i~0 7)} is VALID [2018-11-23 13:04:39,359 INFO L273 TraceCheckUtils]: 18: Hoare triple {1214#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1215#(<= main_~i~0 8)} is VALID [2018-11-23 13:04:39,360 INFO L273 TraceCheckUtils]: 19: Hoare triple {1215#(<= main_~i~0 8)} assume !(~i~0 <= 8); {1207#false} is VALID [2018-11-23 13:04:39,360 INFO L256 TraceCheckUtils]: 20: Hoare triple {1207#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1207#false} is VALID [2018-11-23 13:04:39,361 INFO L273 TraceCheckUtils]: 21: Hoare triple {1207#false} ~cond := #in~cond; {1207#false} is VALID [2018-11-23 13:04:39,361 INFO L273 TraceCheckUtils]: 22: Hoare triple {1207#false} assume 0 == ~cond; {1207#false} is VALID [2018-11-23 13:04:39,361 INFO L273 TraceCheckUtils]: 23: Hoare triple {1207#false} assume !false; {1207#false} is VALID [2018-11-23 13:04:39,363 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:39,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:39,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-23 13:04:39,383 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-23 13:04:39,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:39,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:04:39,413 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:39,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:04:39,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:04:39,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:04:39,415 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 10 states. [2018-11-23 13:04:39,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:39,555 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 13:04:39,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:04:39,555 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-23 13:04:39,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:39,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:04:39,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2018-11-23 13:04:39,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:04:39,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2018-11-23 13:04:39,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 32 transitions. [2018-11-23 13:04:39,668 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:39,669 INFO L225 Difference]: With dead ends: 32 [2018-11-23 13:04:39,669 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 13:04:39,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:04:39,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 13:04:39,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 13:04:39,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:39,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-23 13:04:39,695 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 13:04:39,696 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 13:04:39,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:39,697 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-23 13:04:39,698 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 13:04:39,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:39,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:39,698 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 13:04:39,698 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 13:04:39,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:39,700 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-23 13:04:39,700 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 13:04:39,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:39,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:39,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:39,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:39,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:04:39,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-23 13:04:39,703 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-11-23 13:04:39,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:39,703 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-23 13:04:39,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:04:39,704 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 13:04:39,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 13:04:39,704 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:39,705 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:39,705 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:39,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:39,705 INFO L82 PathProgramCache]: Analyzing trace with hash 386905900, now seen corresponding path program 8 times [2018-11-23 13:04:39,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:39,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:39,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:39,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:39,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:40,519 INFO L256 TraceCheckUtils]: 0: Hoare triple {1432#true} call ULTIMATE.init(); {1432#true} is VALID [2018-11-23 13:04:40,519 INFO L273 TraceCheckUtils]: 1: Hoare triple {1432#true} assume true; {1432#true} is VALID [2018-11-23 13:04:40,520 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1432#true} {1432#true} #32#return; {1432#true} is VALID [2018-11-23 13:04:40,520 INFO L256 TraceCheckUtils]: 3: Hoare triple {1432#true} call #t~ret1 := main(); {1432#true} is VALID [2018-11-23 13:04:40,521 INFO L273 TraceCheckUtils]: 4: Hoare triple {1432#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1434#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2018-11-23 13:04:40,522 INFO L273 TraceCheckUtils]: 5: Hoare triple {1434#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1435#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2018-11-23 13:04:40,523 INFO L273 TraceCheckUtils]: 6: Hoare triple {1435#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1435#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2018-11-23 13:04:40,523 INFO L273 TraceCheckUtils]: 7: Hoare triple {1435#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1436#(and (<= main_~sn~0 4) (<= 4 main_~sn~0))} is VALID [2018-11-23 13:04:40,524 INFO L273 TraceCheckUtils]: 8: Hoare triple {1436#(and (<= main_~sn~0 4) (<= 4 main_~sn~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1436#(and (<= main_~sn~0 4) (<= 4 main_~sn~0))} is VALID [2018-11-23 13:04:40,525 INFO L273 TraceCheckUtils]: 9: Hoare triple {1436#(and (<= main_~sn~0 4) (<= 4 main_~sn~0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1437#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} is VALID [2018-11-23 13:04:40,525 INFO L273 TraceCheckUtils]: 10: Hoare triple {1437#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1437#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} is VALID [2018-11-23 13:04:40,527 INFO L273 TraceCheckUtils]: 11: Hoare triple {1437#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1438#(and (<= main_~sn~0 8) (<= 8 main_~sn~0))} is VALID [2018-11-23 13:04:40,528 INFO L273 TraceCheckUtils]: 12: Hoare triple {1438#(and (<= main_~sn~0 8) (<= 8 main_~sn~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1438#(and (<= main_~sn~0 8) (<= 8 main_~sn~0))} is VALID [2018-11-23 13:04:40,529 INFO L273 TraceCheckUtils]: 13: Hoare triple {1438#(and (<= main_~sn~0 8) (<= 8 main_~sn~0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1439#(and (<= 10 main_~sn~0) (<= main_~sn~0 10))} is VALID [2018-11-23 13:04:40,530 INFO L273 TraceCheckUtils]: 14: Hoare triple {1439#(and (<= 10 main_~sn~0) (<= main_~sn~0 10))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1439#(and (<= 10 main_~sn~0) (<= main_~sn~0 10))} is VALID [2018-11-23 13:04:40,531 INFO L273 TraceCheckUtils]: 15: Hoare triple {1439#(and (<= 10 main_~sn~0) (<= main_~sn~0 10))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1440#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} is VALID [2018-11-23 13:04:40,532 INFO L273 TraceCheckUtils]: 16: Hoare triple {1440#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1440#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} is VALID [2018-11-23 13:04:40,533 INFO L273 TraceCheckUtils]: 17: Hoare triple {1440#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1441#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} is VALID [2018-11-23 13:04:40,552 INFO L273 TraceCheckUtils]: 18: Hoare triple {1441#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1441#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} is VALID [2018-11-23 13:04:40,566 INFO L273 TraceCheckUtils]: 19: Hoare triple {1441#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1442#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} is VALID [2018-11-23 13:04:40,580 INFO L273 TraceCheckUtils]: 20: Hoare triple {1442#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1442#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} is VALID [2018-11-23 13:04:40,594 INFO L273 TraceCheckUtils]: 21: Hoare triple {1442#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} assume !(~i~0 <= 8); {1442#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} is VALID [2018-11-23 13:04:40,603 INFO L256 TraceCheckUtils]: 22: Hoare triple {1442#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1443#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:04:40,613 INFO L273 TraceCheckUtils]: 23: Hoare triple {1443#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1444#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:04:40,613 INFO L273 TraceCheckUtils]: 24: Hoare triple {1444#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {1433#false} is VALID [2018-11-23 13:04:40,614 INFO L273 TraceCheckUtils]: 25: Hoare triple {1433#false} assume !false; {1433#false} is VALID [2018-11-23 13:04:40,617 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:40,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:40,617 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:04:40,628 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:04:40,648 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:04:40,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:40,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:40,951 INFO L256 TraceCheckUtils]: 0: Hoare triple {1432#true} call ULTIMATE.init(); {1432#true} is VALID [2018-11-23 13:04:40,952 INFO L273 TraceCheckUtils]: 1: Hoare triple {1432#true} assume true; {1432#true} is VALID [2018-11-23 13:04:40,952 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1432#true} {1432#true} #32#return; {1432#true} is VALID [2018-11-23 13:04:40,952 INFO L256 TraceCheckUtils]: 3: Hoare triple {1432#true} call #t~ret1 := main(); {1432#true} is VALID [2018-11-23 13:04:40,952 INFO L273 TraceCheckUtils]: 4: Hoare triple {1432#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1434#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2018-11-23 13:04:40,953 INFO L273 TraceCheckUtils]: 5: Hoare triple {1434#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1435#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2018-11-23 13:04:40,954 INFO L273 TraceCheckUtils]: 6: Hoare triple {1435#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1435#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2018-11-23 13:04:40,954 INFO L273 TraceCheckUtils]: 7: Hoare triple {1435#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1436#(and (<= main_~sn~0 4) (<= 4 main_~sn~0))} is VALID [2018-11-23 13:04:40,955 INFO L273 TraceCheckUtils]: 8: Hoare triple {1436#(and (<= main_~sn~0 4) (<= 4 main_~sn~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1436#(and (<= main_~sn~0 4) (<= 4 main_~sn~0))} is VALID [2018-11-23 13:04:40,959 INFO L273 TraceCheckUtils]: 9: Hoare triple {1436#(and (<= main_~sn~0 4) (<= 4 main_~sn~0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1437#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} is VALID [2018-11-23 13:04:40,959 INFO L273 TraceCheckUtils]: 10: Hoare triple {1437#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1437#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} is VALID [2018-11-23 13:04:40,966 INFO L273 TraceCheckUtils]: 11: Hoare triple {1437#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1438#(and (<= main_~sn~0 8) (<= 8 main_~sn~0))} is VALID [2018-11-23 13:04:40,967 INFO L273 TraceCheckUtils]: 12: Hoare triple {1438#(and (<= main_~sn~0 8) (<= 8 main_~sn~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1438#(and (<= main_~sn~0 8) (<= 8 main_~sn~0))} is VALID [2018-11-23 13:04:40,967 INFO L273 TraceCheckUtils]: 13: Hoare triple {1438#(and (<= main_~sn~0 8) (<= 8 main_~sn~0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1439#(and (<= 10 main_~sn~0) (<= main_~sn~0 10))} is VALID [2018-11-23 13:04:40,968 INFO L273 TraceCheckUtils]: 14: Hoare triple {1439#(and (<= 10 main_~sn~0) (<= main_~sn~0 10))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1439#(and (<= 10 main_~sn~0) (<= main_~sn~0 10))} is VALID [2018-11-23 13:04:40,969 INFO L273 TraceCheckUtils]: 15: Hoare triple {1439#(and (<= 10 main_~sn~0) (<= main_~sn~0 10))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1440#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} is VALID [2018-11-23 13:04:40,969 INFO L273 TraceCheckUtils]: 16: Hoare triple {1440#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1440#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} is VALID [2018-11-23 13:04:40,970 INFO L273 TraceCheckUtils]: 17: Hoare triple {1440#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1441#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} is VALID [2018-11-23 13:04:40,971 INFO L273 TraceCheckUtils]: 18: Hoare triple {1441#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1441#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} is VALID [2018-11-23 13:04:40,972 INFO L273 TraceCheckUtils]: 19: Hoare triple {1441#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1442#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} is VALID [2018-11-23 13:04:40,973 INFO L273 TraceCheckUtils]: 20: Hoare triple {1442#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1442#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} is VALID [2018-11-23 13:04:40,974 INFO L273 TraceCheckUtils]: 21: Hoare triple {1442#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} assume !(~i~0 <= 8); {1442#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} is VALID [2018-11-23 13:04:40,975 INFO L256 TraceCheckUtils]: 22: Hoare triple {1442#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1443#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:04:40,976 INFO L273 TraceCheckUtils]: 23: Hoare triple {1443#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1444#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:04:40,977 INFO L273 TraceCheckUtils]: 24: Hoare triple {1444#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {1433#false} is VALID [2018-11-23 13:04:40,978 INFO L273 TraceCheckUtils]: 25: Hoare triple {1433#false} assume !false; {1433#false} is VALID [2018-11-23 13:04:40,980 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:41,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:41,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-11-23 13:04:41,003 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-11-23 13:04:41,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:41,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 13:04:41,044 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:41,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:04:41,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:04:41,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:04:41,046 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 13 states. [2018-11-23 13:04:41,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:41,654 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-23 13:04:41,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 13:04:41,654 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-11-23 13:04:41,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:41,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:04:41,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 34 transitions. [2018-11-23 13:04:41,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:04:41,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 34 transitions. [2018-11-23 13:04:41,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 34 transitions. [2018-11-23 13:04:41,769 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:41,770 INFO L225 Difference]: With dead ends: 34 [2018-11-23 13:04:41,770 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 13:04:41,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:04:41,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 13:04:41,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-23 13:04:41,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:41,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-23 13:04:41,805 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 13:04:41,806 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 13:04:41,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:41,808 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-23 13:04:41,809 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-23 13:04:41,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:41,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:41,809 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 13:04:41,810 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 13:04:41,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:41,811 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-23 13:04:41,811 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-23 13:04:41,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:41,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:41,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:41,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:41,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:04:41,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-23 13:04:41,814 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-11-23 13:04:41,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:41,814 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-11-23 13:04:41,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:04:41,814 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-23 13:04:41,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:04:41,815 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:41,815 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:41,816 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:41,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:41,816 INFO L82 PathProgramCache]: Analyzing trace with hash -680671446, now seen corresponding path program 9 times [2018-11-23 13:04:41,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:41,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:41,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:41,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:04:41,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:42,068 INFO L256 TraceCheckUtils]: 0: Hoare triple {1679#true} call ULTIMATE.init(); {1679#true} is VALID [2018-11-23 13:04:42,068 INFO L273 TraceCheckUtils]: 1: Hoare triple {1679#true} assume true; {1679#true} is VALID [2018-11-23 13:04:42,069 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1679#true} {1679#true} #32#return; {1679#true} is VALID [2018-11-23 13:04:42,069 INFO L256 TraceCheckUtils]: 3: Hoare triple {1679#true} call #t~ret1 := main(); {1679#true} is VALID [2018-11-23 13:04:42,076 INFO L273 TraceCheckUtils]: 4: Hoare triple {1679#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1681#(<= 1 main_~i~0)} is VALID [2018-11-23 13:04:42,077 INFO L273 TraceCheckUtils]: 5: Hoare triple {1681#(<= 1 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1681#(<= 1 main_~i~0)} is VALID [2018-11-23 13:04:42,077 INFO L273 TraceCheckUtils]: 6: Hoare triple {1681#(<= 1 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1682#(<= 2 main_~i~0)} is VALID [2018-11-23 13:04:42,079 INFO L273 TraceCheckUtils]: 7: Hoare triple {1682#(<= 2 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1682#(<= 2 main_~i~0)} is VALID [2018-11-23 13:04:42,080 INFO L273 TraceCheckUtils]: 8: Hoare triple {1682#(<= 2 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1683#(<= 3 main_~i~0)} is VALID [2018-11-23 13:04:42,081 INFO L273 TraceCheckUtils]: 9: Hoare triple {1683#(<= 3 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1683#(<= 3 main_~i~0)} is VALID [2018-11-23 13:04:42,081 INFO L273 TraceCheckUtils]: 10: Hoare triple {1683#(<= 3 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1684#(<= 4 main_~i~0)} is VALID [2018-11-23 13:04:42,081 INFO L273 TraceCheckUtils]: 11: Hoare triple {1684#(<= 4 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1684#(<= 4 main_~i~0)} is VALID [2018-11-23 13:04:42,082 INFO L273 TraceCheckUtils]: 12: Hoare triple {1684#(<= 4 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1685#(<= 5 main_~i~0)} is VALID [2018-11-23 13:04:42,082 INFO L273 TraceCheckUtils]: 13: Hoare triple {1685#(<= 5 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1685#(<= 5 main_~i~0)} is VALID [2018-11-23 13:04:42,083 INFO L273 TraceCheckUtils]: 14: Hoare triple {1685#(<= 5 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1686#(<= 6 main_~i~0)} is VALID [2018-11-23 13:04:42,091 INFO L273 TraceCheckUtils]: 15: Hoare triple {1686#(<= 6 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1686#(<= 6 main_~i~0)} is VALID [2018-11-23 13:04:42,094 INFO L273 TraceCheckUtils]: 16: Hoare triple {1686#(<= 6 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1687#(<= 7 main_~i~0)} is VALID [2018-11-23 13:04:42,095 INFO L273 TraceCheckUtils]: 17: Hoare triple {1687#(<= 7 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1687#(<= 7 main_~i~0)} is VALID [2018-11-23 13:04:42,095 INFO L273 TraceCheckUtils]: 18: Hoare triple {1687#(<= 7 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1688#(<= 8 main_~i~0)} is VALID [2018-11-23 13:04:42,096 INFO L273 TraceCheckUtils]: 19: Hoare triple {1688#(<= 8 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1688#(<= 8 main_~i~0)} is VALID [2018-11-23 13:04:42,096 INFO L273 TraceCheckUtils]: 20: Hoare triple {1688#(<= 8 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1689#(<= 9 main_~i~0)} is VALID [2018-11-23 13:04:42,116 INFO L273 TraceCheckUtils]: 21: Hoare triple {1689#(<= 9 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1680#false} is VALID [2018-11-23 13:04:42,116 INFO L273 TraceCheckUtils]: 22: Hoare triple {1680#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1680#false} is VALID [2018-11-23 13:04:42,116 INFO L273 TraceCheckUtils]: 23: Hoare triple {1680#false} assume !(~i~0 <= 8); {1680#false} is VALID [2018-11-23 13:04:42,117 INFO L256 TraceCheckUtils]: 24: Hoare triple {1680#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1680#false} is VALID [2018-11-23 13:04:42,117 INFO L273 TraceCheckUtils]: 25: Hoare triple {1680#false} ~cond := #in~cond; {1680#false} is VALID [2018-11-23 13:04:42,117 INFO L273 TraceCheckUtils]: 26: Hoare triple {1680#false} assume 0 == ~cond; {1680#false} is VALID [2018-11-23 13:04:42,117 INFO L273 TraceCheckUtils]: 27: Hoare triple {1680#false} assume !false; {1680#false} is VALID [2018-11-23 13:04:42,119 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:42,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:42,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 13:04:42,120 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-11-23 13:04:42,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:42,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:04:42,211 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:42,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:04:42,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:04:42,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:04:42,213 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 11 states. [2018-11-23 13:04:42,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:42,448 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-23 13:04:42,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:04:42,448 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-11-23 13:04:42,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:42,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:04:42,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 29 transitions. [2018-11-23 13:04:42,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:04:42,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 29 transitions. [2018-11-23 13:04:42,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 29 transitions. [2018-11-23 13:04:42,572 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:42,572 INFO L225 Difference]: With dead ends: 29 [2018-11-23 13:04:42,572 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:04:42,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:04:42,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:04:42,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:04:42,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:42,574 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:42,574 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:42,574 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:42,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:42,574 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:04:42,574 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:04:42,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:42,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:42,575 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:42,575 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:42,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:42,575 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:04:42,576 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:04:42,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:42,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:42,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:42,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:42,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:04:42,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:04:42,577 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-11-23 13:04:42,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:42,577 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:04:42,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:04:42,577 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:04:42,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:42,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:04:42,830 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 13:04:42,830 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:04:42,830 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:04:42,830 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:04:42,830 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:04:42,830 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:04:42,831 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 11 17) the Hoare annotation is: true [2018-11-23 13:04:42,831 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 11 17) no Hoare annotation was computed. [2018-11-23 13:04:42,831 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 11 17) no Hoare annotation was computed. [2018-11-23 13:04:42,831 INFO L448 ceAbstractionStarter]: For program point L13-2(lines 13 15) no Hoare annotation was computed. [2018-11-23 13:04:42,831 INFO L444 ceAbstractionStarter]: At program point L13-3(lines 13 15) the Hoare annotation is: (or (and (<= 10 main_~sn~0) (<= 6 main_~i~0) (<= main_~i~0 6) (<= main_~sn~0 10)) (and (<= 1 main_~i~0) (<= main_~i~0 1) (<= main_~sn~0 0) (<= 0 main_~sn~0)) (and (<= 2 main_~i~0) (<= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0)) (and (<= 7 main_~i~0) (<= 12 main_~sn~0) (<= main_~sn~0 12) (<= main_~i~0 7)) (and (<= 6 main_~sn~0) (<= main_~sn~0 6) (<= 4 main_~i~0) (<= main_~i~0 4)) (and (<= 9 main_~i~0) (<= main_~sn~0 16) (< 15 main_~sn~0)) (and (<= main_~i~0 3) (<= main_~sn~0 4) (<= 3 main_~i~0) (<= 4 main_~sn~0)) (and (<= main_~sn~0 8) (<= 5 main_~i~0) (<= main_~i~0 5) (<= 8 main_~sn~0)) (and (<= 14 main_~sn~0) (<= 8 main_~i~0) (<= main_~i~0 8) (<= main_~sn~0 14))) [2018-11-23 13:04:42,831 INFO L444 ceAbstractionStarter]: At program point L13-4(lines 13 15) the Hoare annotation is: (and (<= main_~sn~0 16) (< 15 main_~sn~0)) [2018-11-23 13:04:42,831 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 13:04:42,831 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 13:04:42,831 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:04:42,832 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 13:04:42,832 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 13:04:42,832 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:04:42,833 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:04:42,834 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:04:42,834 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:04:42,834 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:04:42,836 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2018-11-23 13:04:42,836 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:04:42,836 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:04:42,836 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:04:42,836 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:04:42,836 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2018-11-23 13:04:42,836 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:04:42,836 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:04:42,836 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 13:04:42,837 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:04:42,837 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:04:42,837 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:04:42,837 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:04:42,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:04:42 BoogieIcfgContainer [2018-11-23 13:04:42,851 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:04:42,851 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:04:42,852 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:04:42,852 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:04:42,852 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:33" (3/4) ... [2018-11-23 13:04:42,856 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:04:42,862 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:04:42,862 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:04:42,862 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:04:42,866 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 13:04:42,866 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-23 13:04:42,866 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:04:42,905 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops/sum04_true-unreach-call_true-termination.i-witness.graphml [2018-11-23 13:04:42,906 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:04:42,907 INFO L168 Benchmark]: Toolchain (without parser) took 10304.44 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 871.9 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -868.8 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:42,909 INFO L168 Benchmark]: CDTParser took 0.24 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-23 13:04:42,909 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.07 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-23 13:04:42,910 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.49 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-23 13:04:42,910 INFO L168 Benchmark]: Boogie Preprocessor took 26.29 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-23 13:04:42,911 INFO L168 Benchmark]: RCFGBuilder took 605.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -796.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:42,912 INFO L168 Benchmark]: TraceAbstraction took 9293.81 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 124.8 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -83.3 MB). Peak memory consumption was 41.4 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:42,914 INFO L168 Benchmark]: Witness Printer took 54.21 ms. Allocated memory is still 2.4 GB. Free memory is still 2.3 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:04:42,920 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 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. * CACSL2BoogieTranslator took 296.07 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 22.49 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 26.29 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 605.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -796.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9293.81 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 124.8 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -83.3 MB). Peak memory consumption was 41.4 MB. Max. memory is 7.1 GB. * Witness Printer took 54.21 ms. Allocated memory is still 2.4 GB. Free memory is still 2.3 GB. There was no memory consumed. 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: 13]: Loop Invariant Derived loop invariant: ((((((((((10 <= sn && 6 <= i) && i <= 6) && sn <= 10) || (((1 <= i && i <= 1) && sn <= 0) && 0 <= sn)) || (((2 <= i && i <= 2) && sn <= 2) && 2 <= sn)) || (((7 <= i && 12 <= sn) && sn <= 12) && i <= 7)) || (((6 <= sn && sn <= 6) && 4 <= i) && i <= 4)) || ((9 <= i && sn <= 16) && 15 < sn)) || (((i <= 3 && sn <= 4) && 3 <= i) && 4 <= sn)) || (((sn <= 8 && 5 <= i) && i <= 5) && 8 <= sn)) || (((14 <= sn && 8 <= i) && i <= 8) && sn <= 14) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. SAFE Result, 9.2s OverallTime, 11 OverallIterations, 9 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 120 SDtfs, 37 SDslu, 412 SDs, 0 SdLazy, 271 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 163 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 7 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 17 PreInvPairs, 27 NumberOfFragments, 127 HoareAnnotationTreeSize, 17 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 352 NumberOfCodeBlocks, 351 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 333 ConstructedInterpolants, 0 QuantifiedInterpolants, 17679 SizeOfPredicates, 8 NumberOfNonLiveVariables, 368 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 19 InterpolantComputations, 3 PerfectInterpolantSequences, 81/489 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...