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/loop-lit/jm2006_variant_true-unreach-call_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:12:34,605 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:12:34,608 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:12:34,623 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:12:34,624 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:12:34,625 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:12:34,626 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:12:34,629 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:12:34,631 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:12:34,633 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:12:34,634 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:12:34,634 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:12:34,636 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:12:34,637 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:12:34,638 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:12:34,639 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:12:34,642 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:12:34,645 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:12:34,655 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:12:34,656 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:12:34,657 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:12:34,660 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:12:34,662 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:12:34,662 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:12:34,662 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:12:34,666 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:12:34,667 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:12:34,667 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:12:34,669 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:12:34,670 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:12:34,670 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:12:34,672 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:12:34,672 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:12:34,673 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:12:34,673 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:12:34,676 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:12:34,676 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:12:34,697 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:12:34,697 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:12:34,698 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:12:34,698 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:12:34,699 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:12:34,699 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:12:34,699 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:12:34,700 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:12:34,700 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:12:34,700 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:12:34,700 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:12:34,700 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:12:34,700 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:12:34,701 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:12:34,701 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:12:34,701 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:12:34,701 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:12:34,701 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:12:34,701 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:12:34,702 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:12:34,702 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:12:34,702 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:12:34,702 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:12:34,702 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:12:34,703 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:12:34,703 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:12:34,703 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:12:34,703 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:12:34,703 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:12:34,704 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:12:34,704 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:12:34,748 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:12:34,760 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:12:34,764 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:12:34,765 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:12:34,766 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:12:34,766 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/jm2006_variant_true-unreach-call_true-termination.c.i [2018-11-23 13:12:34,821 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/831ee32aa/e5cc2a8bf2fb42098bae8e73d73e61bc/FLAG62ab6dd8b [2018-11-23 13:12:35,237 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:12:35,238 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006_variant_true-unreach-call_true-termination.c.i [2018-11-23 13:12:35,243 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/831ee32aa/e5cc2a8bf2fb42098bae8e73d73e61bc/FLAG62ab6dd8b [2018-11-23 13:12:35,629 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/831ee32aa/e5cc2a8bf2fb42098bae8e73d73e61bc [2018-11-23 13:12:35,639 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:12:35,643 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:12:35,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:12:35,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:12:35,648 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:12:35,650 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:12:35" (1/1) ... [2018-11-23 13:12:35,653 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@124f30ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:35, skipping insertion in model container [2018-11-23 13:12:35,653 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:12:35" (1/1) ... [2018-11-23 13:12:35,663 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:12:35,684 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:12:35,905 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:12:35,910 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:12:35,931 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:12:35,948 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:12:35,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:35 WrapperNode [2018-11-23 13:12:35,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:12:35,950 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:12:35,950 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:12:35,950 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:12:35,960 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:12:35" (1/1) ... [2018-11-23 13:12:35,968 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:12:35" (1/1) ... [2018-11-23 13:12:35,976 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:12:35,976 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:12:35,976 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:12:35,976 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:12:35,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:35" (1/1) ... [2018-11-23 13:12:35,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:35" (1/1) ... [2018-11-23 13:12:35,988 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:35" (1/1) ... [2018-11-23 13:12:35,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:35" (1/1) ... [2018-11-23 13:12:35,994 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:35" (1/1) ... [2018-11-23 13:12:36,003 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:35" (1/1) ... [2018-11-23 13:12:36,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:35" (1/1) ... [2018-11-23 13:12:36,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:12:36,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:12:36,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:12:36,012 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:12:36,013 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:35" (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:12:36,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:12:36,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:12:36,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:12:36,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:12:36,183 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:12:36,183 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:12:36,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:12:36,184 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:12:36,659 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:12:36,659 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:12:36,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:36 BoogieIcfgContainer [2018-11-23 13:12:36,660 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:12:36,661 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:12:36,661 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:12:36,665 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:12:36,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:12:35" (1/3) ... [2018-11-23 13:12:36,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb5a1b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:12:36, skipping insertion in model container [2018-11-23 13:12:36,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:35" (2/3) ... [2018-11-23 13:12:36,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb5a1b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:12:36, skipping insertion in model container [2018-11-23 13:12:36,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:36" (3/3) ... [2018-11-23 13:12:36,669 INFO L112 eAbstractionObserver]: Analyzing ICFG jm2006_variant_true-unreach-call_true-termination.c.i [2018-11-23 13:12:36,679 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:12:36,686 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:12:36,702 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:12:36,732 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:12:36,733 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:12:36,733 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:12:36,733 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:12:36,733 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:12:36,733 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:12:36,734 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:12:36,734 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:12:36,734 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:12:36,752 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-23 13:12:36,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:12:36,759 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:36,760 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:36,762 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:36,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:36,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1772153714, now seen corresponding path program 1 times [2018-11-23 13:12:36,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:36,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:36,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:36,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:36,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:37,625 WARN L180 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2018-11-23 13:12:37,857 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 14 [2018-11-23 13:12:38,072 INFO L256 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2018-11-23 13:12:38,076 INFO L273 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2018-11-23 13:12:38,076 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #46#return; {24#true} is VALID [2018-11-23 13:12:38,077 INFO L256 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret5 := main(); {24#true} is VALID [2018-11-23 13:12:38,077 INFO L273 TraceCheckUtils]: 4: Hoare triple {24#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {24#true} is VALID [2018-11-23 13:12:38,077 INFO L273 TraceCheckUtils]: 5: Hoare triple {24#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {24#true} is VALID [2018-11-23 13:12:38,079 INFO L273 TraceCheckUtils]: 6: Hoare triple {24#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {26#(and (or (= main_~i~0 main_~x~0) (= main_~i~0 0)) (or (not (= main_~i~0 0)) (and (or (<= (+ main_~y~0 main_~z~0) main_~j~0) (<= (+ main_~y~0 main_~z~0) 0)) (or (and (= main_~i~0 main_~x~0) (< 0 (+ main_~y~0 main_~z~0 1))) (< 0 (+ main_~y~0 main_~z~0))))))} is VALID [2018-11-23 13:12:38,080 INFO L273 TraceCheckUtils]: 7: Hoare triple {26#(and (or (= main_~i~0 main_~x~0) (= main_~i~0 0)) (or (not (= main_~i~0 0)) (and (or (<= (+ main_~y~0 main_~z~0) main_~j~0) (<= (+ main_~y~0 main_~z~0) 0)) (or (and (= main_~i~0 main_~x~0) (< 0 (+ main_~y~0 main_~z~0 1))) (< 0 (+ main_~y~0 main_~z~0))))))} assume !(0 != ~x~0); {27#(and (or (<= (+ main_~y~0 main_~z~0) main_~j~0) (<= (+ main_~y~0 main_~z~0) 0)) (< 0 (+ main_~y~0 main_~z~0 1)) (= main_~i~0 0))} is VALID [2018-11-23 13:12:38,082 INFO L273 TraceCheckUtils]: 8: Hoare triple {27#(and (or (<= (+ main_~y~0 main_~z~0) main_~j~0) (<= (+ main_~y~0 main_~z~0) 0)) (< 0 (+ main_~y~0 main_~z~0 1)) (= main_~i~0 0))} assume ~i~0 == ~j~0; {28#(and (<= (+ main_~y~0 main_~z~0) 0) (<= 0 (+ main_~y~0 main_~z~0)))} is VALID [2018-11-23 13:12:38,083 INFO L256 TraceCheckUtils]: 9: Hoare triple {28#(and (<= (+ main_~y~0 main_~z~0) 0) (<= 0 (+ main_~y~0 main_~z~0)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {29#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:12:38,084 INFO L273 TraceCheckUtils]: 10: Hoare triple {29#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {30#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:12:38,085 INFO L273 TraceCheckUtils]: 11: Hoare triple {30#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {25#false} is VALID [2018-11-23 13:12:38,085 INFO L273 TraceCheckUtils]: 12: Hoare triple {25#false} assume !false; {25#false} is VALID [2018-11-23 13:12:38,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:38,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:38,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 13:12:38,098 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-23 13:12:38,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:38,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:12:38,141 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:38,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:12:38,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:12:38,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:12:38,152 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 7 states. [2018-11-23 13:12:39,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:39,249 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2018-11-23 13:12:39,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:12:39,250 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-23 13:12:39,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:39,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:12:39,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2018-11-23 13:12:39,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:12:39,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2018-11-23 13:12:39,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 59 transitions. [2018-11-23 13:12:39,423 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:39,432 INFO L225 Difference]: With dead ends: 47 [2018-11-23 13:12:39,433 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 13:12:39,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:12:39,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 13:12:39,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 13:12:39,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:39,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-23 13:12:39,647 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 13:12:39,648 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 13:12:39,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:39,651 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 13:12:39,651 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 13:12:39,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:39,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:39,652 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 13:12:39,653 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 13:12:39,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:39,656 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 13:12:39,656 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 13:12:39,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:39,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:39,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:39,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:39,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:12:39,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 13:12:39,661 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-11-23 13:12:39,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:39,662 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-23 13:12:39,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:12:39,662 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 13:12:39,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:12:39,663 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:39,663 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:39,664 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:39,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:39,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1871056931, now seen corresponding path program 1 times [2018-11-23 13:12:39,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:39,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:39,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:39,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:39,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:40,012 INFO L256 TraceCheckUtils]: 0: Hoare triple {151#true} call ULTIMATE.init(); {151#true} is VALID [2018-11-23 13:12:40,013 INFO L273 TraceCheckUtils]: 1: Hoare triple {151#true} assume true; {151#true} is VALID [2018-11-23 13:12:40,013 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {151#true} {151#true} #46#return; {151#true} is VALID [2018-11-23 13:12:40,014 INFO L256 TraceCheckUtils]: 3: Hoare triple {151#true} call #t~ret5 := main(); {151#true} is VALID [2018-11-23 13:12:40,014 INFO L273 TraceCheckUtils]: 4: Hoare triple {151#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {151#true} is VALID [2018-11-23 13:12:40,014 INFO L273 TraceCheckUtils]: 5: Hoare triple {151#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {151#true} is VALID [2018-11-23 13:12:40,015 INFO L273 TraceCheckUtils]: 6: Hoare triple {151#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {153#(and (<= (+ main_~y~0 main_~z~0) main_~j~0) (= main_~i~0 main_~x~0) (<= main_~j~0 (+ main_~y~0 main_~z~0)))} is VALID [2018-11-23 13:12:40,016 INFO L273 TraceCheckUtils]: 7: Hoare triple {153#(and (<= (+ main_~y~0 main_~z~0) main_~j~0) (= main_~i~0 main_~x~0) (<= main_~j~0 (+ main_~y~0 main_~z~0)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {154#(and (or (< 0 (+ main_~y~0 main_~z~0 1)) (<= main_~j~0 (+ main_~y~0 main_~z~0 1))) (= main_~i~0 (+ main_~x~0 1)) (or (<= (+ main_~y~0 main_~z~0) 0) (<= (+ main_~y~0 main_~z~0 1) main_~j~0)))} is VALID [2018-11-23 13:12:40,017 INFO L273 TraceCheckUtils]: 8: Hoare triple {154#(and (or (< 0 (+ main_~y~0 main_~z~0 1)) (<= main_~j~0 (+ main_~y~0 main_~z~0 1))) (= main_~i~0 (+ main_~x~0 1)) (or (<= (+ main_~y~0 main_~z~0) 0) (<= (+ main_~y~0 main_~z~0 1) main_~j~0)))} assume !(0 != ~x~0); {155#(and (or (<= (+ main_~y~0 main_~z~0) 0) (<= (+ main_~i~0 main_~y~0 main_~z~0) main_~j~0)) (or (< 0 (+ main_~y~0 main_~z~0 1)) (<= main_~j~0 (+ main_~i~0 main_~y~0 main_~z~0))))} is VALID [2018-11-23 13:12:40,018 INFO L273 TraceCheckUtils]: 9: Hoare triple {155#(and (or (<= (+ main_~y~0 main_~z~0) 0) (<= (+ main_~i~0 main_~y~0 main_~z~0) main_~j~0)) (or (< 0 (+ main_~y~0 main_~z~0 1)) (<= main_~j~0 (+ main_~i~0 main_~y~0 main_~z~0))))} assume ~i~0 == ~j~0; {156#(and (<= (+ main_~y~0 main_~z~0) 0) (<= 0 (+ main_~y~0 main_~z~0)))} is VALID [2018-11-23 13:12:40,019 INFO L256 TraceCheckUtils]: 10: Hoare triple {156#(and (<= (+ main_~y~0 main_~z~0) 0) (<= 0 (+ main_~y~0 main_~z~0)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {157#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:40,020 INFO L273 TraceCheckUtils]: 11: Hoare triple {157#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {158#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:12:40,024 INFO L273 TraceCheckUtils]: 12: Hoare triple {158#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {152#false} is VALID [2018-11-23 13:12:40,024 INFO L273 TraceCheckUtils]: 13: Hoare triple {152#false} assume !false; {152#false} is VALID [2018-11-23 13:12:40,026 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:12:40,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:40,026 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:12:40,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:40,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:40,262 INFO L256 TraceCheckUtils]: 0: Hoare triple {151#true} call ULTIMATE.init(); {151#true} is VALID [2018-11-23 13:12:40,263 INFO L273 TraceCheckUtils]: 1: Hoare triple {151#true} assume true; {151#true} is VALID [2018-11-23 13:12:40,263 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {151#true} {151#true} #46#return; {151#true} is VALID [2018-11-23 13:12:40,263 INFO L256 TraceCheckUtils]: 3: Hoare triple {151#true} call #t~ret5 := main(); {151#true} is VALID [2018-11-23 13:12:40,264 INFO L273 TraceCheckUtils]: 4: Hoare triple {151#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {151#true} is VALID [2018-11-23 13:12:40,264 INFO L273 TraceCheckUtils]: 5: Hoare triple {151#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {151#true} is VALID [2018-11-23 13:12:40,267 INFO L273 TraceCheckUtils]: 6: Hoare triple {151#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {180#(and (= main_~j~0 main_~y~0) (= main_~i~0 main_~x~0) (= main_~z~0 0))} is VALID [2018-11-23 13:12:40,268 INFO L273 TraceCheckUtils]: 7: Hoare triple {180#(and (= main_~j~0 main_~y~0) (= main_~i~0 main_~x~0) (= main_~z~0 0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {184#(and (= main_~j~0 (+ main_~y~0 2)) (= main_~z~0 1) (= (+ main_~x~0 1) main_~i~0))} is VALID [2018-11-23 13:12:40,268 INFO L273 TraceCheckUtils]: 8: Hoare triple {184#(and (= main_~j~0 (+ main_~y~0 2)) (= main_~z~0 1) (= (+ main_~x~0 1) main_~i~0))} assume !(0 != ~x~0); {188#(and (= main_~j~0 (+ main_~y~0 2)) (= main_~i~0 1) (= main_~z~0 1))} is VALID [2018-11-23 13:12:40,270 INFO L273 TraceCheckUtils]: 9: Hoare triple {188#(and (= main_~j~0 (+ main_~y~0 2)) (= main_~i~0 1) (= main_~z~0 1))} assume ~i~0 == ~j~0; {192#(and (= 0 (+ main_~y~0 1)) (= main_~z~0 1))} is VALID [2018-11-23 13:12:40,271 INFO L256 TraceCheckUtils]: 10: Hoare triple {192#(and (= 0 (+ main_~y~0 1)) (= main_~z~0 1))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {157#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:40,272 INFO L273 TraceCheckUtils]: 11: Hoare triple {157#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {158#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:12:40,273 INFO L273 TraceCheckUtils]: 12: Hoare triple {158#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {152#false} is VALID [2018-11-23 13:12:40,273 INFO L273 TraceCheckUtils]: 13: Hoare triple {152#false} assume !false; {152#false} is VALID [2018-11-23 13:12:40,275 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:12:40,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:40,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-11-23 13:12:40,298 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-11-23 13:12:40,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:40,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 13:12:40,332 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:12:40,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:12:40,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:12:40,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:12:40,334 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 12 states. [2018-11-23 13:12:40,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:40,750 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 13:12:40,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:12:40,750 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-11-23 13:12:40,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:40,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:12:40,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2018-11-23 13:12:40,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:12:40,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2018-11-23 13:12:40,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2018-11-23 13:12:40,816 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:12:40,817 INFO L225 Difference]: With dead ends: 22 [2018-11-23 13:12:40,818 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 13:12:40,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:12:40,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 13:12:40,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 13:12:40,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:40,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-23 13:12:40,851 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:12:40,851 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:12:40,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:40,852 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:12:40,853 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:12:40,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:40,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:40,853 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:12:40,853 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:12:40,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:40,855 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:12:40,855 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:12:40,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:40,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:40,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:40,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:40,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:12:40,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-23 13:12:40,858 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-11-23 13:12:40,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:40,858 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-23 13:12:40,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:12:40,859 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:12:40,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:12:40,859 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:40,860 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:40,860 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:40,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:40,860 INFO L82 PathProgramCache]: Analyzing trace with hash -642089362, now seen corresponding path program 2 times [2018-11-23 13:12:40,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:40,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:40,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:40,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:40,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:41,184 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2018-11-23 13:12:41,366 INFO L256 TraceCheckUtils]: 0: Hoare triple {300#true} call ULTIMATE.init(); {300#true} is VALID [2018-11-23 13:12:41,366 INFO L273 TraceCheckUtils]: 1: Hoare triple {300#true} assume true; {300#true} is VALID [2018-11-23 13:12:41,367 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {300#true} {300#true} #46#return; {300#true} is VALID [2018-11-23 13:12:41,367 INFO L256 TraceCheckUtils]: 3: Hoare triple {300#true} call #t~ret5 := main(); {300#true} is VALID [2018-11-23 13:12:41,368 INFO L273 TraceCheckUtils]: 4: Hoare triple {300#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {300#true} is VALID [2018-11-23 13:12:41,368 INFO L273 TraceCheckUtils]: 5: Hoare triple {300#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {300#true} is VALID [2018-11-23 13:12:41,370 INFO L273 TraceCheckUtils]: 6: Hoare triple {300#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {302#(and (<= (+ main_~y~0 main_~z~0) main_~j~0) (= main_~i~0 main_~x~0) (<= main_~j~0 (+ main_~y~0 main_~z~0)))} is VALID [2018-11-23 13:12:41,371 INFO L273 TraceCheckUtils]: 7: Hoare triple {302#(and (<= (+ main_~y~0 main_~z~0) main_~j~0) (= main_~i~0 main_~x~0) (<= main_~j~0 (+ main_~y~0 main_~z~0)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {303#(and (= main_~i~0 (+ main_~x~0 1)) (<= main_~j~0 (+ main_~y~0 main_~z~0 1)) (<= (+ main_~y~0 main_~z~0 1) main_~j~0))} is VALID [2018-11-23 13:12:41,373 INFO L273 TraceCheckUtils]: 8: Hoare triple {303#(and (= main_~i~0 (+ main_~x~0 1)) (<= main_~j~0 (+ main_~y~0 main_~z~0 1)) (<= (+ main_~y~0 main_~z~0 1) main_~j~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {304#(and (or (< 0 (+ main_~y~0 main_~z~0 1)) (<= (+ main_~x~0 main_~j~0) (+ main_~y~0 main_~i~0 main_~z~0))) (or (<= (+ main_~y~0 main_~i~0 main_~z~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~y~0 main_~z~0) 0)))} is VALID [2018-11-23 13:12:41,374 INFO L273 TraceCheckUtils]: 9: Hoare triple {304#(and (or (< 0 (+ main_~y~0 main_~z~0 1)) (<= (+ main_~x~0 main_~j~0) (+ main_~y~0 main_~i~0 main_~z~0))) (or (<= (+ main_~y~0 main_~i~0 main_~z~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~y~0 main_~z~0) 0)))} assume !(0 != ~x~0); {305#(and (or (<= (+ main_~y~0 main_~i~0 main_~z~0) main_~j~0) (<= (+ main_~y~0 main_~z~0) 0)) (or (<= main_~j~0 (+ main_~y~0 main_~i~0 main_~z~0)) (< 0 (+ main_~y~0 main_~z~0 1))))} is VALID [2018-11-23 13:12:41,381 INFO L273 TraceCheckUtils]: 10: Hoare triple {305#(and (or (<= (+ main_~y~0 main_~i~0 main_~z~0) main_~j~0) (<= (+ main_~y~0 main_~z~0) 0)) (or (<= main_~j~0 (+ main_~y~0 main_~i~0 main_~z~0)) (< 0 (+ main_~y~0 main_~z~0 1))))} assume ~i~0 == ~j~0; {306#(and (<= (+ main_~y~0 main_~z~0) 0) (<= 0 (+ main_~y~0 main_~z~0)))} is VALID [2018-11-23 13:12:41,382 INFO L256 TraceCheckUtils]: 11: Hoare triple {306#(and (<= (+ main_~y~0 main_~z~0) 0) (<= 0 (+ main_~y~0 main_~z~0)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {307#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:41,384 INFO L273 TraceCheckUtils]: 12: Hoare triple {307#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {308#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:12:41,384 INFO L273 TraceCheckUtils]: 13: Hoare triple {308#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {301#false} is VALID [2018-11-23 13:12:41,384 INFO L273 TraceCheckUtils]: 14: Hoare triple {301#false} assume !false; {301#false} is VALID [2018-11-23 13:12:41,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:41,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:41,386 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:12:41,396 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:12:41,426 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:12:41,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:12:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:41,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:41,780 INFO L256 TraceCheckUtils]: 0: Hoare triple {300#true} call ULTIMATE.init(); {300#true} is VALID [2018-11-23 13:12:41,781 INFO L273 TraceCheckUtils]: 1: Hoare triple {300#true} assume true; {300#true} is VALID [2018-11-23 13:12:41,781 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {300#true} {300#true} #46#return; {300#true} is VALID [2018-11-23 13:12:41,782 INFO L256 TraceCheckUtils]: 3: Hoare triple {300#true} call #t~ret5 := main(); {300#true} is VALID [2018-11-23 13:12:41,782 INFO L273 TraceCheckUtils]: 4: Hoare triple {300#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {300#true} is VALID [2018-11-23 13:12:41,782 INFO L273 TraceCheckUtils]: 5: Hoare triple {300#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {300#true} is VALID [2018-11-23 13:12:41,784 INFO L273 TraceCheckUtils]: 6: Hoare triple {300#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {330#(and (= main_~j~0 main_~y~0) (= main_~i~0 main_~x~0) (= main_~z~0 0))} is VALID [2018-11-23 13:12:41,785 INFO L273 TraceCheckUtils]: 7: Hoare triple {330#(and (= main_~j~0 main_~y~0) (= main_~i~0 main_~x~0) (= main_~z~0 0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {334#(and (= main_~j~0 (+ main_~y~0 2)) (= main_~z~0 1) (= (+ main_~x~0 1) main_~i~0))} is VALID [2018-11-23 13:12:41,787 INFO L273 TraceCheckUtils]: 8: Hoare triple {334#(and (= main_~j~0 (+ main_~y~0 2)) (= main_~z~0 1) (= (+ main_~x~0 1) main_~i~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {338#(and (= (+ main_~y~0 4) main_~j~0) (= main_~z~0 2) (= (+ main_~x~0 2) main_~i~0))} is VALID [2018-11-23 13:12:41,787 INFO L273 TraceCheckUtils]: 9: Hoare triple {338#(and (= (+ main_~y~0 4) main_~j~0) (= main_~z~0 2) (= (+ main_~x~0 2) main_~i~0))} assume !(0 != ~x~0); {342#(and (= main_~i~0 2) (= (+ main_~y~0 4) main_~j~0) (= main_~z~0 2))} is VALID [2018-11-23 13:12:41,788 INFO L273 TraceCheckUtils]: 10: Hoare triple {342#(and (= main_~i~0 2) (= (+ main_~y~0 4) main_~j~0) (= main_~z~0 2))} assume ~i~0 == ~j~0; {346#(and (= main_~z~0 2) (= (+ main_~y~0 2) 0))} is VALID [2018-11-23 13:12:41,797 INFO L256 TraceCheckUtils]: 11: Hoare triple {346#(and (= main_~z~0 2) (= (+ main_~y~0 2) 0))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {307#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:41,797 INFO L273 TraceCheckUtils]: 12: Hoare triple {307#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {308#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:12:41,798 INFO L273 TraceCheckUtils]: 13: Hoare triple {308#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {301#false} is VALID [2018-11-23 13:12:41,798 INFO L273 TraceCheckUtils]: 14: Hoare triple {301#false} assume !false; {301#false} is VALID [2018-11-23 13:12:41,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:41,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:41,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-11-23 13:12:41,819 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2018-11-23 13:12:41,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:41,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 13:12:41,891 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:12:41,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 13:12:41,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:12:41,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:12:41,892 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 14 states. [2018-11-23 13:12:42,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:42,288 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 13:12:42,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:12:42,288 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2018-11-23 13:12:42,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:42,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:12:42,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 27 transitions. [2018-11-23 13:12:42,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:12:42,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 27 transitions. [2018-11-23 13:12:42,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 27 transitions. [2018-11-23 13:12:42,332 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:12:42,334 INFO L225 Difference]: With dead ends: 26 [2018-11-23 13:12:42,334 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 13:12:42,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:12:42,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 13:12:42,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 13:12:42,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:42,365 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 13:12:42,365 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 13:12:42,365 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 13:12:42,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:42,368 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:12:42,369 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:12:42,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:42,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:42,370 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 13:12:42,370 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 13:12:42,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:42,371 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:12:42,372 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:12:42,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:42,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:42,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:42,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:42,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:12:42,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-23 13:12:42,373 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-11-23 13:12:42,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:42,374 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-23 13:12:42,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 13:12:42,374 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:12:42,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:12:42,375 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:42,375 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:42,375 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:42,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:42,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1276972978, now seen corresponding path program 3 times [2018-11-23 13:12:42,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:42,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:42,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:42,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:42,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:42,863 INFO L256 TraceCheckUtils]: 0: Hoare triple {471#true} call ULTIMATE.init(); {471#true} is VALID [2018-11-23 13:12:42,863 INFO L273 TraceCheckUtils]: 1: Hoare triple {471#true} assume true; {471#true} is VALID [2018-11-23 13:12:42,864 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {471#true} {471#true} #46#return; {471#true} is VALID [2018-11-23 13:12:42,864 INFO L256 TraceCheckUtils]: 3: Hoare triple {471#true} call #t~ret5 := main(); {471#true} is VALID [2018-11-23 13:12:42,864 INFO L273 TraceCheckUtils]: 4: Hoare triple {471#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {471#true} is VALID [2018-11-23 13:12:42,865 INFO L273 TraceCheckUtils]: 5: Hoare triple {471#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {471#true} is VALID [2018-11-23 13:12:42,867 INFO L273 TraceCheckUtils]: 6: Hoare triple {471#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {473#(and (<= (+ main_~y~0 main_~z~0) main_~j~0) (= main_~i~0 main_~x~0) (<= main_~j~0 (+ main_~y~0 main_~z~0)))} is VALID [2018-11-23 13:12:42,868 INFO L273 TraceCheckUtils]: 7: Hoare triple {473#(and (<= (+ main_~y~0 main_~z~0) main_~j~0) (= main_~i~0 main_~x~0) (<= main_~j~0 (+ main_~y~0 main_~z~0)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {474#(and (= main_~i~0 (+ main_~x~0 1)) (<= main_~j~0 (+ main_~y~0 main_~z~0 1)) (<= (+ main_~y~0 main_~z~0 1) main_~j~0))} is VALID [2018-11-23 13:12:42,869 INFO L273 TraceCheckUtils]: 8: Hoare triple {474#(and (= main_~i~0 (+ main_~x~0 1)) (<= main_~j~0 (+ main_~y~0 main_~z~0 1)) (<= (+ main_~y~0 main_~z~0 1) main_~j~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {475#(and (<= (+ main_~y~0 main_~i~0 main_~z~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~x~0 main_~j~0) (+ main_~y~0 main_~i~0 main_~z~0)))} is VALID [2018-11-23 13:12:42,870 INFO L273 TraceCheckUtils]: 9: Hoare triple {475#(and (<= (+ main_~y~0 main_~i~0 main_~z~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~x~0 main_~j~0) (+ main_~y~0 main_~i~0 main_~z~0)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {475#(and (<= (+ main_~y~0 main_~i~0 main_~z~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~x~0 main_~j~0) (+ main_~y~0 main_~i~0 main_~z~0)))} is VALID [2018-11-23 13:12:42,870 INFO L273 TraceCheckUtils]: 10: Hoare triple {475#(and (<= (+ main_~y~0 main_~i~0 main_~z~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~x~0 main_~j~0) (+ main_~y~0 main_~i~0 main_~z~0)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {476#(and (or (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0 main_~z~0)) (< 0 (+ main_~y~0 main_~z~0 1))) (or (<= (+ main_~i~0 main_~y~0 main_~z~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~y~0 main_~z~0) 0)))} is VALID [2018-11-23 13:12:42,872 INFO L273 TraceCheckUtils]: 11: Hoare triple {476#(and (or (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0 main_~z~0)) (< 0 (+ main_~y~0 main_~z~0 1))) (or (<= (+ main_~i~0 main_~y~0 main_~z~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~y~0 main_~z~0) 0)))} assume !(0 != ~x~0); {477#(and (or (<= (+ main_~y~0 main_~z~0) 0) (<= (+ main_~i~0 main_~y~0 main_~z~0) main_~j~0)) (or (< 0 (+ main_~y~0 main_~z~0 1)) (<= main_~j~0 (+ main_~i~0 main_~y~0 main_~z~0))))} is VALID [2018-11-23 13:12:42,873 INFO L273 TraceCheckUtils]: 12: Hoare triple {477#(and (or (<= (+ main_~y~0 main_~z~0) 0) (<= (+ main_~i~0 main_~y~0 main_~z~0) main_~j~0)) (or (< 0 (+ main_~y~0 main_~z~0 1)) (<= main_~j~0 (+ main_~i~0 main_~y~0 main_~z~0))))} assume ~i~0 == ~j~0; {478#(and (<= (+ main_~y~0 main_~z~0) 0) (<= 0 (+ main_~y~0 main_~z~0)))} is VALID [2018-11-23 13:12:42,874 INFO L256 TraceCheckUtils]: 13: Hoare triple {478#(and (<= (+ main_~y~0 main_~z~0) 0) (<= 0 (+ main_~y~0 main_~z~0)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {479#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:42,882 INFO L273 TraceCheckUtils]: 14: Hoare triple {479#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {480#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:12:42,883 INFO L273 TraceCheckUtils]: 15: Hoare triple {480#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {472#false} is VALID [2018-11-23 13:12:42,883 INFO L273 TraceCheckUtils]: 16: Hoare triple {472#false} assume !false; {472#false} is VALID [2018-11-23 13:12:42,885 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:12:42,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:42,885 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:12:42,907 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:12:42,929 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 13:12:42,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:12:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:42,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:43,355 INFO L256 TraceCheckUtils]: 0: Hoare triple {471#true} call ULTIMATE.init(); {471#true} is VALID [2018-11-23 13:12:43,355 INFO L273 TraceCheckUtils]: 1: Hoare triple {471#true} assume true; {471#true} is VALID [2018-11-23 13:12:43,356 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {471#true} {471#true} #46#return; {471#true} is VALID [2018-11-23 13:12:43,356 INFO L256 TraceCheckUtils]: 3: Hoare triple {471#true} call #t~ret5 := main(); {471#true} is VALID [2018-11-23 13:12:43,356 INFO L273 TraceCheckUtils]: 4: Hoare triple {471#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {471#true} is VALID [2018-11-23 13:12:43,356 INFO L273 TraceCheckUtils]: 5: Hoare triple {471#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {471#true} is VALID [2018-11-23 13:12:43,358 INFO L273 TraceCheckUtils]: 6: Hoare triple {471#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {502#(and (= main_~j~0 main_~y~0) (= main_~i~0 main_~x~0) (= main_~z~0 0))} is VALID [2018-11-23 13:12:43,358 INFO L273 TraceCheckUtils]: 7: Hoare triple {502#(and (= main_~j~0 main_~y~0) (= main_~i~0 main_~x~0) (= main_~z~0 0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {506#(and (= main_~j~0 (+ main_~y~0 2)) (= main_~z~0 1) (= (+ main_~x~0 1) main_~i~0))} is VALID [2018-11-23 13:12:43,359 INFO L273 TraceCheckUtils]: 8: Hoare triple {506#(and (= main_~j~0 (+ main_~y~0 2)) (= main_~z~0 1) (= (+ main_~x~0 1) main_~i~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {510#(and (= (+ main_~y~0 4) main_~j~0) (= main_~z~0 2) (= (+ main_~x~0 2) main_~i~0))} is VALID [2018-11-23 13:12:43,361 INFO L273 TraceCheckUtils]: 9: Hoare triple {510#(and (= (+ main_~y~0 4) main_~j~0) (= main_~z~0 2) (= (+ main_~x~0 2) main_~i~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {514#(and (= main_~z~0 3) (= (+ main_~y~0 6) main_~j~0) (= (+ main_~x~0 3) main_~i~0))} is VALID [2018-11-23 13:12:43,362 INFO L273 TraceCheckUtils]: 10: Hoare triple {514#(and (= main_~z~0 3) (= (+ main_~y~0 6) main_~j~0) (= (+ main_~x~0 3) main_~i~0))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;~y~0 := ~y~0 - 2;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {518#(and (= main_~i~0 (+ main_~x~0 4)) (= main_~z~0 4) (= main_~j~0 (+ main_~y~0 8)))} is VALID [2018-11-23 13:12:43,364 INFO L273 TraceCheckUtils]: 11: Hoare triple {518#(and (= main_~i~0 (+ main_~x~0 4)) (= main_~z~0 4) (= main_~j~0 (+ main_~y~0 8)))} assume !(0 != ~x~0); {522#(and (= main_~z~0 4) (= main_~j~0 (+ main_~y~0 8)) (= main_~i~0 4))} is VALID [2018-11-23 13:12:43,364 INFO L273 TraceCheckUtils]: 12: Hoare triple {522#(and (= main_~z~0 4) (= main_~j~0 (+ main_~y~0 8)) (= main_~i~0 4))} assume ~i~0 == ~j~0; {526#(and (= 0 (+ main_~y~0 4)) (= main_~z~0 4))} is VALID [2018-11-23 13:12:43,366 INFO L256 TraceCheckUtils]: 13: Hoare triple {526#(and (= 0 (+ main_~y~0 4)) (= main_~z~0 4))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {479#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:43,367 INFO L273 TraceCheckUtils]: 14: Hoare triple {479#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {480#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:12:43,368 INFO L273 TraceCheckUtils]: 15: Hoare triple {480#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {472#false} is VALID [2018-11-23 13:12:43,368 INFO L273 TraceCheckUtils]: 16: Hoare triple {472#false} assume !false; {472#false} is VALID [2018-11-23 13:12:43,370 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:43,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:43,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2018-11-23 13:12:43,391 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-11-23 13:12:43,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:43,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 13:12:43,419 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:12:43,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 13:12:43,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:12:43,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:12:43,420 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-11-23 13:12:44,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:44,131 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-23 13:12:44,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 13:12:44,131 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-11-23 13:12:44,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:44,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:12:44,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 22 transitions. [2018-11-23 13:12:44,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:12:44,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 22 transitions. [2018-11-23 13:12:44,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 22 transitions. [2018-11-23 13:12:44,167 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:12:44,167 INFO L225 Difference]: With dead ends: 21 [2018-11-23 13:12:44,167 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:12:44,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:12:44,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:12:44,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:12:44,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:44,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:44,170 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:44,170 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:44,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:44,171 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:12:44,171 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:44,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:44,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:44,172 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:44,172 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:44,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:44,173 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:12:44,173 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:44,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:44,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:44,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:44,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:44,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:12:44,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:12:44,174 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-11-23 13:12:44,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:44,174 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:12:44,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 13:12:44,174 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:44,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:44,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:12:44,354 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 13:12:44,354 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:12:44,354 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:12:44,354 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:12:44,355 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:12:44,355 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:12:44,355 INFO L444 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (let ((.cse0 (+ main_~y~0 main_~z~0))) (and (<= .cse0 0) (<= 0 .cse0))) [2018-11-23 13:12:44,355 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 28) no Hoare annotation was computed. [2018-11-23 13:12:44,355 INFO L444 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: (let ((.cse1 (+ main_~x~0 main_~j~0)) (.cse0 (+ main_~y~0 main_~i~0 main_~z~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) [2018-11-23 13:12:44,355 INFO L448 ceAbstractionStarter]: For program point L19-3(lines 10 28) no Hoare annotation was computed. [2018-11-23 13:12:44,356 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-11-23 13:12:44,356 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 28) no Hoare annotation was computed. [2018-11-23 13:12:44,356 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 28) the Hoare annotation is: true [2018-11-23 13:12:44,356 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-11-23 13:12:44,356 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-11-23 13:12:44,356 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 13:12:44,356 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:12:44,356 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 13:12:44,357 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 13:12:44,357 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 13:12:44,357 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:12:44,358 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:12:44,358 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 13:12:44,358 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:12:44,359 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:12:44,359 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:12:44,359 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 13:12:44,359 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 13:12:44,359 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:12:44,359 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:12:44,359 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:12:44,359 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:12:44,359 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 13:12:44,359 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 13:12:44,360 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:12:44,360 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:12:44,360 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 13:12:44,360 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:12:44,360 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2018-11-23 13:12:44,360 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2018-11-23 13:12:44,362 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:12:44,362 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2018-11-23 13:12:44,362 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2018-11-23 13:12:44,362 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 13:12:44,363 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 13:12:44,363 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:12:44,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:12:44 BoogieIcfgContainer [2018-11-23 13:12:44,373 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:12:44,373 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:12:44,374 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:12:44,374 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:12:44,375 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:36" (3/4) ... [2018-11-23 13:12:44,378 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:12:44,383 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:12:44,384 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:12:44,384 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:12:44,388 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-23 13:12:44,389 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 13:12:44,389 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:12:44,435 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-lit/jm2006_variant_true-unreach-call_true-termination.c.i-witness.graphml [2018-11-23 13:12:44,436 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:12:44,437 INFO L168 Benchmark]: Toolchain (without parser) took 8797.69 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.6 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -201.2 MB). Peak memory consumption was 556.4 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:44,438 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:12:44,439 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.93 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:12:44,439 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.27 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:12:44,440 INFO L168 Benchmark]: Boogie Preprocessor took 34.81 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:12:44,440 INFO L168 Benchmark]: RCFGBuilder took 648.84 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -806.8 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:44,441 INFO L168 Benchmark]: TraceAbstraction took 7711.70 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 581.6 MB). Peak memory consumption was 581.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:44,442 INFO L168 Benchmark]: Witness Printer took 62.49 ms. Allocated memory is still 2.3 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:44,446 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.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 304.93 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 26.27 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 34.81 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 648.84 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -806.8 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7711.70 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 581.6 MB). Peak memory consumption was 581.6 MB. Max. memory is 7.1 GB. * Witness Printer took 62.49 ms. Allocated memory is still 2.3 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: y + i + z <= x + j && x + j <= y + i + z - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. SAFE Result, 7.6s OverallTime, 4 OverallIterations, 4 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 51 SDtfs, 39 SDslu, 260 SDs, 0 SdLazy, 283 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, 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.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 13 PreInvPairs, 24 NumberOfFragments, 33 HoareAnnotationTreeSize, 13 FomulaSimplifications, 55 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 192 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 105 NumberOfCodeBlocks, 105 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 9557 SizeOfPredicates, 15 NumberOfNonLiveVariables, 169 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 1/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...