java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label14_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:49:09,751 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:49:09,753 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:49:09,766 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:49:09,766 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:49:09,767 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:49:09,768 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:49:09,770 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:49:09,772 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:49:09,773 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:49:09,774 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:49:09,774 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:49:09,775 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:49:09,776 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:49:09,777 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:49:09,778 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:49:09,779 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:49:09,781 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:49:09,783 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:49:09,785 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:49:09,786 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:49:09,788 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:49:09,790 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:49:09,791 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:49:09,791 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:49:09,792 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:49:09,793 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:49:09,794 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:49:09,795 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:49:09,797 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:49:09,797 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:49:09,798 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:49:09,798 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:49:09,798 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:49:09,799 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:49:09,800 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:49:09,801 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:49:09,816 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:49:09,817 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:49:09,818 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:49:09,818 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:49:09,819 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:49:09,819 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:49:09,819 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:49:09,819 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:49:09,819 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:49:09,820 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:49:09,820 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:49:09,820 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:49:09,820 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:49:09,820 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:49:09,821 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:49:09,821 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:49:09,821 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:49:09,821 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:49:09,822 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:49:09,822 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:49:09,822 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:49:09,822 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:49:09,822 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:49:09,823 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:49:09,823 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:49:09,823 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:49:09,823 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:49:09,823 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:49:09,873 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:49:09,886 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:49:09,890 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:49:09,892 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:49:09,892 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:49:09,893 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label14_true-unreach-call_false-termination.c [2018-11-06 19:49:09,965 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80e1b83f7/7223fe0cfda847f79fc8d0dd5295eeba/FLAG9d0e4f46f [2018-11-06 19:49:10,575 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:49:10,576 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label14_true-unreach-call_false-termination.c [2018-11-06 19:49:10,601 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80e1b83f7/7223fe0cfda847f79fc8d0dd5295eeba/FLAG9d0e4f46f [2018-11-06 19:49:10,624 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80e1b83f7/7223fe0cfda847f79fc8d0dd5295eeba [2018-11-06 19:49:10,638 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:49:10,639 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:49:10,641 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:49:10,641 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:49:10,647 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:49:10,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:49:10" (1/1) ... [2018-11-06 19:49:10,651 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cedeeed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:10, skipping insertion in model container [2018-11-06 19:49:10,652 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:49:10" (1/1) ... [2018-11-06 19:49:10,661 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:49:10,726 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:49:11,269 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:49:11,281 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:49:11,399 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:49:11,418 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:49:11,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:11 WrapperNode [2018-11-06 19:49:11,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:49:11,419 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:49:11,420 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:49:11,420 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:49:11,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:11" (1/1) ... [2018-11-06 19:49:11,552 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:11" (1/1) ... [2018-11-06 19:49:11,613 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:49:11,614 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:49:11,614 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:49:11,614 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:49:11,626 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:11" (1/1) ... [2018-11-06 19:49:11,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:11" (1/1) ... [2018-11-06 19:49:11,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:11" (1/1) ... [2018-11-06 19:49:11,632 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:11" (1/1) ... [2018-11-06 19:49:11,652 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:11" (1/1) ... [2018-11-06 19:49:11,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:11" (1/1) ... [2018-11-06 19:49:11,670 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:11" (1/1) ... [2018-11-06 19:49:11,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:49:11,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:49:11,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:49:11,679 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:49:11,685 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:11" (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-06 19:49:11,767 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:49:11,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:49:11,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:49:14,814 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:49:14,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:49:14 BoogieIcfgContainer [2018-11-06 19:49:14,816 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:49:14,817 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:49:14,817 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:49:14,820 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:49:14,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:49:10" (1/3) ... [2018-11-06 19:49:14,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b0e1244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:49:14, skipping insertion in model container [2018-11-06 19:49:14,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:11" (2/3) ... [2018-11-06 19:49:14,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b0e1244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:49:14, skipping insertion in model container [2018-11-06 19:49:14,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:49:14" (3/3) ... [2018-11-06 19:49:14,824 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label14_true-unreach-call_false-termination.c [2018-11-06 19:49:14,833 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:49:14,841 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:49:14,858 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:49:14,896 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:49:14,897 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:49:14,897 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:49:14,897 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:49:14,897 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:49:14,898 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:49:14,898 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:49:14,898 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:49:14,898 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:49:14,926 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-11-06 19:49:14,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-06 19:49:14,944 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:14,945 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:49:14,947 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:14,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:14,954 INFO L82 PathProgramCache]: Analyzing trace with hash 782686367, now seen corresponding path program 1 times [2018-11-06 19:49:14,956 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:14,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:15,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:15,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:15,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:15,760 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-06 19:49:16,232 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2018-11-06 19:49:16,403 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2018-11-06 19:49:16,717 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2018-11-06 19:49:16,955 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-06 19:49:16,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:16,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-06 19:49:16,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 19:49:16,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 19:49:16,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-11-06 19:49:16,980 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 10 states. [2018-11-06 19:49:17,248 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-06 19:49:19,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:19,424 INFO L93 Difference]: Finished difference Result 636 states and 1117 transitions. [2018-11-06 19:49:19,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-06 19:49:19,426 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 132 [2018-11-06 19:49:19,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:19,444 INFO L225 Difference]: With dead ends: 636 [2018-11-06 19:49:19,444 INFO L226 Difference]: Without dead ends: 254 [2018-11-06 19:49:19,453 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-11-06 19:49:19,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-11-06 19:49:19,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2018-11-06 19:49:19,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-11-06 19:49:19,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2018-11-06 19:49:19,513 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 132 [2018-11-06 19:49:19,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:19,513 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2018-11-06 19:49:19,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-06 19:49:19,514 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2018-11-06 19:49:19,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-06 19:49:19,518 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:19,518 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:49:19,518 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:19,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:19,519 INFO L82 PathProgramCache]: Analyzing trace with hash -2122611721, now seen corresponding path program 1 times [2018-11-06 19:49:19,519 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:19,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:19,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:19,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:19,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:19,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-06 19:49:19,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:19,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:49:19,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:49:19,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:49:19,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:49:19,787 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand 3 states. [2018-11-06 19:49:21,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:21,044 INFO L93 Difference]: Finished difference Result 579 states and 960 transitions. [2018-11-06 19:49:21,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:49:21,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2018-11-06 19:49:21,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:21,052 INFO L225 Difference]: With dead ends: 579 [2018-11-06 19:49:21,052 INFO L226 Difference]: Without dead ends: 386 [2018-11-06 19:49:21,054 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-06 19:49:21,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-11-06 19:49:21,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2018-11-06 19:49:21,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-11-06 19:49:21,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 594 transitions. [2018-11-06 19:49:21,086 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 594 transitions. Word has length 137 [2018-11-06 19:49:21,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:21,092 INFO L480 AbstractCegarLoop]: Abstraction has 386 states and 594 transitions. [2018-11-06 19:49:21,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:49:21,093 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 594 transitions. [2018-11-06 19:49:21,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-06 19:49:21,101 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:21,102 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:49:21,102 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:21,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:21,102 INFO L82 PathProgramCache]: Analyzing trace with hash 146041456, now seen corresponding path program 1 times [2018-11-06 19:49:21,102 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:21,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:21,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:21,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:21,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:21,236 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-06 19:49:21,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:21,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:49:21,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:49:21,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:49:21,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:21,238 INFO L87 Difference]: Start difference. First operand 386 states and 594 transitions. Second operand 4 states. [2018-11-06 19:49:22,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:22,698 INFO L93 Difference]: Finished difference Result 975 states and 1590 transitions. [2018-11-06 19:49:22,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:49:22,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2018-11-06 19:49:22,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:22,704 INFO L225 Difference]: With dead ends: 975 [2018-11-06 19:49:22,704 INFO L226 Difference]: Without dead ends: 650 [2018-11-06 19:49:22,706 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:22,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-11-06 19:49:22,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2018-11-06 19:49:22,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2018-11-06 19:49:22,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 954 transitions. [2018-11-06 19:49:22,727 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 954 transitions. Word has length 143 [2018-11-06 19:49:22,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:22,727 INFO L480 AbstractCegarLoop]: Abstraction has 650 states and 954 transitions. [2018-11-06 19:49:22,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:49:22,728 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 954 transitions. [2018-11-06 19:49:22,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-06 19:49:22,731 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:22,731 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:49:22,731 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:22,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:22,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1898708700, now seen corresponding path program 1 times [2018-11-06 19:49:22,732 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:22,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:22,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:22,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:22,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:22,855 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-06 19:49:22,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:22,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:49:22,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:49:22,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:49:22,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:49:22,857 INFO L87 Difference]: Start difference. First operand 650 states and 954 transitions. Second operand 3 states. [2018-11-06 19:49:24,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:24,679 INFO L93 Difference]: Finished difference Result 1371 states and 2052 transitions. [2018-11-06 19:49:24,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:49:24,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2018-11-06 19:49:24,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:24,690 INFO L225 Difference]: With dead ends: 1371 [2018-11-06 19:49:24,690 INFO L226 Difference]: Without dead ends: 782 [2018-11-06 19:49:24,693 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-06 19:49:24,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2018-11-06 19:49:24,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 782. [2018-11-06 19:49:24,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2018-11-06 19:49:24,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1134 transitions. [2018-11-06 19:49:24,723 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1134 transitions. Word has length 151 [2018-11-06 19:49:24,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:24,723 INFO L480 AbstractCegarLoop]: Abstraction has 782 states and 1134 transitions. [2018-11-06 19:49:24,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:49:24,724 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1134 transitions. [2018-11-06 19:49:24,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-06 19:49:24,727 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:24,727 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:49:24,729 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:24,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:24,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1347151541, now seen corresponding path program 1 times [2018-11-06 19:49:24,730 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:24,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:24,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:24,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:24,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:24,988 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-06 19:49:24,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:24,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:49:24,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:49:24,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:49:24,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:24,990 INFO L87 Difference]: Start difference. First operand 782 states and 1134 transitions. Second operand 4 states. [2018-11-06 19:49:26,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:26,970 INFO L93 Difference]: Finished difference Result 2691 states and 4008 transitions. [2018-11-06 19:49:26,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:49:26,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2018-11-06 19:49:26,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:26,986 INFO L225 Difference]: With dead ends: 2691 [2018-11-06 19:49:26,987 INFO L226 Difference]: Without dead ends: 1970 [2018-11-06 19:49:26,988 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:26,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2018-11-06 19:49:27,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1970. [2018-11-06 19:49:27,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1970 states. [2018-11-06 19:49:27,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 2683 transitions. [2018-11-06 19:49:27,029 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 2683 transitions. Word has length 161 [2018-11-06 19:49:27,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:27,029 INFO L480 AbstractCegarLoop]: Abstraction has 1970 states and 2683 transitions. [2018-11-06 19:49:27,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:49:27,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 2683 transitions. [2018-11-06 19:49:27,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-06 19:49:27,036 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:27,036 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:49:27,036 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:27,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:27,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1183098076, now seen corresponding path program 1 times [2018-11-06 19:49:27,037 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:27,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:27,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:27,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:27,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:27,277 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-06 19:49:27,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:27,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:49:27,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:49:27,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:49:27,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:27,279 INFO L87 Difference]: Start difference. First operand 1970 states and 2683 transitions. Second operand 4 states. [2018-11-06 19:49:28,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:28,399 INFO L93 Difference]: Finished difference Result 3879 states and 5300 transitions. [2018-11-06 19:49:28,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:49:28,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2018-11-06 19:49:28,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:28,411 INFO L225 Difference]: With dead ends: 3879 [2018-11-06 19:49:28,411 INFO L226 Difference]: Without dead ends: 1970 [2018-11-06 19:49:28,414 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-06 19:49:28,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2018-11-06 19:49:28,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1970. [2018-11-06 19:49:28,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1970 states. [2018-11-06 19:49:28,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 2659 transitions. [2018-11-06 19:49:28,459 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 2659 transitions. Word has length 167 [2018-11-06 19:49:28,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:28,460 INFO L480 AbstractCegarLoop]: Abstraction has 1970 states and 2659 transitions. [2018-11-06 19:49:28,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:49:28,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 2659 transitions. [2018-11-06 19:49:28,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-06 19:49:28,466 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:28,466 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:49:28,466 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:28,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:28,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1439669736, now seen corresponding path program 1 times [2018-11-06 19:49:28,467 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:28,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:28,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:28,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:28,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:28,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:28,595 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-06 19:49:28,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:28,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:49:28,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:49:28,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:49:28,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:49:28,597 INFO L87 Difference]: Start difference. First operand 1970 states and 2659 transitions. Second operand 3 states. [2018-11-06 19:49:29,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:29,592 INFO L93 Difference]: Finished difference Result 5327 states and 7170 transitions. [2018-11-06 19:49:29,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:49:29,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2018-11-06 19:49:29,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:29,604 INFO L225 Difference]: With dead ends: 5327 [2018-11-06 19:49:29,604 INFO L226 Difference]: Without dead ends: 2475 [2018-11-06 19:49:29,608 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:49:29,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2018-11-06 19:49:29,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 2475. [2018-11-06 19:49:29,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2475 states. [2018-11-06 19:49:29,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 2886 transitions. [2018-11-06 19:49:29,648 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 2886 transitions. Word has length 170 [2018-11-06 19:49:29,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:29,649 INFO L480 AbstractCegarLoop]: Abstraction has 2475 states and 2886 transitions. [2018-11-06 19:49:29,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:49:29,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 2886 transitions. [2018-11-06 19:49:29,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-06 19:49:29,655 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:29,655 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:49:29,655 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:29,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:29,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1304267757, now seen corresponding path program 1 times [2018-11-06 19:49:29,656 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:29,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:29,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:29,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:29,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:30,026 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:49:30,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:30,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:49:30,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:49:30,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:49:30,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:49:30,028 INFO L87 Difference]: Start difference. First operand 2475 states and 2886 transitions. Second operand 5 states. [2018-11-06 19:49:33,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:33,476 INFO L93 Difference]: Finished difference Result 7536 states and 8885 transitions. [2018-11-06 19:49:33,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:49:33,476 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 184 [2018-11-06 19:49:33,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:33,494 INFO L225 Difference]: With dead ends: 7536 [2018-11-06 19:49:33,494 INFO L226 Difference]: Without dead ends: 4590 [2018-11-06 19:49:33,499 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:49:33,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4590 states. [2018-11-06 19:49:33,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4590 to 3657. [2018-11-06 19:49:33,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3657 states. [2018-11-06 19:49:33,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3657 states to 3657 states and 4125 transitions. [2018-11-06 19:49:33,559 INFO L78 Accepts]: Start accepts. Automaton has 3657 states and 4125 transitions. Word has length 184 [2018-11-06 19:49:33,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:33,560 INFO L480 AbstractCegarLoop]: Abstraction has 3657 states and 4125 transitions. [2018-11-06 19:49:33,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:49:33,560 INFO L276 IsEmpty]: Start isEmpty. Operand 3657 states and 4125 transitions. [2018-11-06 19:49:33,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-06 19:49:33,567 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:33,568 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:49:33,568 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:33,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:33,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1770574550, now seen corresponding path program 1 times [2018-11-06 19:49:33,569 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:33,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:33,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:33,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:33,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:33,914 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-06 19:49:33,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:33,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:49:33,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:49:33,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:49:33,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:33,916 INFO L87 Difference]: Start difference. First operand 3657 states and 4125 transitions. Second operand 4 states. [2018-11-06 19:49:35,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:35,587 INFO L93 Difference]: Finished difference Result 7787 states and 8844 transitions. [2018-11-06 19:49:35,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:49:35,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 214 [2018-11-06 19:49:35,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:35,603 INFO L225 Difference]: With dead ends: 7787 [2018-11-06 19:49:35,603 INFO L226 Difference]: Without dead ends: 3925 [2018-11-06 19:49:35,609 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:35,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3925 states. [2018-11-06 19:49:35,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3925 to 3923. [2018-11-06 19:49:35,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3923 states. [2018-11-06 19:49:35,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3923 states to 3923 states and 4270 transitions. [2018-11-06 19:49:35,677 INFO L78 Accepts]: Start accepts. Automaton has 3923 states and 4270 transitions. Word has length 214 [2018-11-06 19:49:35,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:35,679 INFO L480 AbstractCegarLoop]: Abstraction has 3923 states and 4270 transitions. [2018-11-06 19:49:35,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:49:35,679 INFO L276 IsEmpty]: Start isEmpty. Operand 3923 states and 4270 transitions. [2018-11-06 19:49:35,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-11-06 19:49:35,687 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:35,687 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:49:35,688 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:35,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:35,688 INFO L82 PathProgramCache]: Analyzing trace with hash 488468739, now seen corresponding path program 1 times [2018-11-06 19:49:35,688 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:35,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:35,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:35,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:35,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:35,931 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-06 19:49:35,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:35,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:49:35,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:49:35,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:49:35,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:49:35,933 INFO L87 Difference]: Start difference. First operand 3923 states and 4270 transitions. Second operand 3 states. [2018-11-06 19:49:37,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:37,019 INFO L93 Difference]: Finished difference Result 7649 states and 8332 transitions. [2018-11-06 19:49:37,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:49:37,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2018-11-06 19:49:37,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:37,030 INFO L225 Difference]: With dead ends: 7649 [2018-11-06 19:49:37,030 INFO L226 Difference]: Without dead ends: 3385 [2018-11-06 19:49:37,035 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:49:37,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3385 states. [2018-11-06 19:49:37,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3385 to 3385. [2018-11-06 19:49:37,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3385 states. [2018-11-06 19:49:37,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 3617 transitions. [2018-11-06 19:49:37,099 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 3617 transitions. Word has length 239 [2018-11-06 19:49:37,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:37,099 INFO L480 AbstractCegarLoop]: Abstraction has 3385 states and 3617 transitions. [2018-11-06 19:49:37,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:49:37,100 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 3617 transitions. [2018-11-06 19:49:37,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-11-06 19:49:37,109 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:37,109 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:49:37,110 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:37,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:37,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1228233012, now seen corresponding path program 1 times [2018-11-06 19:49:37,110 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:37,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:37,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:37,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:37,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:37,321 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-06 19:49:37,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:37,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:49:37,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:49:37,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:49:37,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:37,323 INFO L87 Difference]: Start difference. First operand 3385 states and 3617 transitions. Second operand 4 states. [2018-11-06 19:49:38,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:38,165 INFO L93 Difference]: Finished difference Result 6576 states and 7029 transitions. [2018-11-06 19:49:38,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:49:38,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 242 [2018-11-06 19:49:38,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:38,173 INFO L225 Difference]: With dead ends: 6576 [2018-11-06 19:49:38,173 INFO L226 Difference]: Without dead ends: 2058 [2018-11-06 19:49:38,177 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:38,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2018-11-06 19:49:38,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 2058. [2018-11-06 19:49:38,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2058 states. [2018-11-06 19:49:38,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 2153 transitions. [2018-11-06 19:49:38,205 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 2153 transitions. Word has length 242 [2018-11-06 19:49:38,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:38,206 INFO L480 AbstractCegarLoop]: Abstraction has 2058 states and 2153 transitions. [2018-11-06 19:49:38,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:49:38,206 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 2153 transitions. [2018-11-06 19:49:38,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-11-06 19:49:38,211 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:38,212 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:49:38,212 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:38,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:38,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1100970507, now seen corresponding path program 1 times [2018-11-06 19:49:38,213 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:38,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:38,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:38,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:38,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:38,590 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-11-06 19:49:38,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:38,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:49:38,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:49:38,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:49:38,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:49:38,592 INFO L87 Difference]: Start difference. First operand 2058 states and 2153 transitions. Second operand 5 states. [2018-11-06 19:49:39,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:39,444 INFO L93 Difference]: Finished difference Result 4320 states and 4530 transitions. [2018-11-06 19:49:39,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:49:39,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 264 [2018-11-06 19:49:39,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:39,454 INFO L225 Difference]: With dead ends: 4320 [2018-11-06 19:49:39,454 INFO L226 Difference]: Without dead ends: 2057 [2018-11-06 19:49:39,456 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:49:39,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2057 states. [2018-11-06 19:49:39,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2057 to 2057. [2018-11-06 19:49:39,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2057 states. [2018-11-06 19:49:39,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 2147 transitions. [2018-11-06 19:49:39,486 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 2147 transitions. Word has length 264 [2018-11-06 19:49:39,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:39,486 INFO L480 AbstractCegarLoop]: Abstraction has 2057 states and 2147 transitions. [2018-11-06 19:49:39,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:49:39,487 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 2147 transitions. [2018-11-06 19:49:39,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-11-06 19:49:39,494 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:39,494 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:49:39,494 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:39,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:39,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1163586335, now seen corresponding path program 1 times [2018-11-06 19:49:39,495 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:39,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:39,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:39,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:39,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:39,961 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-06 19:49:40,479 WARN L179 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2018-11-06 19:49:40,948 WARN L179 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2018-11-06 19:49:41,218 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2018-11-06 19:49:41,788 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 223 proven. 5 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-11-06 19:49:41,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:49:41,788 INFO L225 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-06 19:49:41,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:41,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:49:42,256 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-11-06 19:49:42,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:49:42,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2018-11-06 19:49:42,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-06 19:49:42,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-06 19:49:42,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-11-06 19:49:42,284 INFO L87 Difference]: Start difference. First operand 2057 states and 2147 transitions. Second operand 14 states. [2018-11-06 19:49:44,840 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 22 [2018-11-06 19:49:49,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:49,053 INFO L93 Difference]: Finished difference Result 4113 states and 4298 transitions. [2018-11-06 19:49:49,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-06 19:49:49,053 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 288 [2018-11-06 19:49:49,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:49,061 INFO L225 Difference]: With dead ends: 4113 [2018-11-06 19:49:49,061 INFO L226 Difference]: Without dead ends: 2117 [2018-11-06 19:49:49,063 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 290 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=157, Invalid=263, Unknown=0, NotChecked=0, Total=420 [2018-11-06 19:49:49,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2117 states. [2018-11-06 19:49:49,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2117 to 2117. [2018-11-06 19:49:49,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2117 states. [2018-11-06 19:49:49,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 2209 transitions. [2018-11-06 19:49:49,099 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 2209 transitions. Word has length 288 [2018-11-06 19:49:49,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:49,100 INFO L480 AbstractCegarLoop]: Abstraction has 2117 states and 2209 transitions. [2018-11-06 19:49:49,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-06 19:49:49,100 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 2209 transitions. [2018-11-06 19:49:49,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-11-06 19:49:49,104 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:49,105 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:49:49,105 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:49,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:49,106 INFO L82 PathProgramCache]: Analyzing trace with hash 470577499, now seen corresponding path program 1 times [2018-11-06 19:49:49,106 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:49,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:49,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:49,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:49,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:49,525 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-06 19:49:49,703 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-11-06 19:49:49,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:49,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:49:49,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:49:49,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:49:49,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:49:49,705 INFO L87 Difference]: Start difference. First operand 2117 states and 2209 transitions. Second operand 5 states. [2018-11-06 19:49:50,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:50,319 INFO L93 Difference]: Finished difference Result 4038 states and 4216 transitions. [2018-11-06 19:49:50,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:49:50,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 300 [2018-11-06 19:49:50,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:50,320 INFO L225 Difference]: With dead ends: 4038 [2018-11-06 19:49:50,320 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 19:49:50,323 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:49:50,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 19:49:50,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 19:49:50,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 19:49:50,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 19:49:50,324 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 300 [2018-11-06 19:49:50,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:50,324 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 19:49:50,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:49:50,324 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 19:49:50,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 19:49:50,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 19:49:50,905 WARN L179 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2018-11-06 19:49:51,309 WARN L179 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2018-11-06 19:49:51,315 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-06 19:49:51,315 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-06 19:49:51,315 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,315 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,315 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,315 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,316 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,316 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,316 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-06 19:49:51,316 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-06 19:49:51,316 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-06 19:49:51,316 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-06 19:49:51,316 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-06 19:49:51,316 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-06 19:49:51,316 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-06 19:49:51,316 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-06 19:49:51,316 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-06 19:49:51,316 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-06 19:49:51,317 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,317 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,317 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,317 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,317 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,317 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,317 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-06 19:49:51,317 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-06 19:49:51,318 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-06 19:49:51,318 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-06 19:49:51,318 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-06 19:49:51,318 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-06 19:49:51,318 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-06 19:49:51,318 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-06 19:49:51,318 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-06 19:49:51,318 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-06 19:49:51,319 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-06 19:49:51,319 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-06 19:49:51,319 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-06 19:49:51,319 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-06 19:49:51,319 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-11-06 19:49:51,319 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,319 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,319 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,319 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,320 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,320 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-06 19:49:51,320 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-06 19:49:51,320 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-06 19:49:51,320 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-06 19:49:51,320 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-06 19:49:51,320 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-06 19:49:51,320 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-06 19:49:51,320 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-06 19:49:51,321 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-06 19:49:51,321 INFO L421 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1))) (let ((.cse1 (= ~a8~0 15)) (.cse12 (= ~a20~0 1)) (.cse15 (not .cse7))) (let ((.cse11 (and .cse1 .cse12 .cse15)) (.cse14 (= ~a16~0 5)) (.cse0 (not .cse12)) (.cse6 (not (= 6 ~a16~0))) (.cse9 (= ~a16~0 4)) (.cse8 (= ~a21~0 1)) (.cse5 (<= ~a21~0 0)) (.cse13 (= ~a8~0 13)) (.cse2 (= ~a12~0 8)) (.cse10 (<= ~a17~0 0)) (.cse3 (= ~a16~0 6)) (.cse4 (= ~a7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6 .cse2) (and .cse4 .cse7 .cse8) (and .cse9 .cse2 .cse10 .cse11) (and (not .cse4) .cse9 (= ~a8~0 14) .cse2 .cse10 .cse8) (and .cse7 .cse2 .cse8 .cse12) (and .cse4 .cse5 .cse6 .cse13 .cse2 .cse7) (and .cse1 .cse10 .cse14) (and .cse11 .cse3) (and .cse0 .cse1 .cse6 .cse8) (and .cse4 .cse1 .cse14) (and .cse4 .cse2 .cse15 .cse14) (and .cse4 .cse5 .cse9 .cse13 .cse2 .cse10 (= ULTIMATE.start_calculate_output_~input 4)) (and .cse0 .cse6 .cse15) (and .cse9 .cse13 .cse2 .cse10 .cse8 (<= ~a7~0 0)) (and .cse4 .cse5 .cse13 .cse2 .cse10 .cse12 .cse3) (and .cse4 .cse1 .cse12 .cse15))))) [2018-11-06 19:49:51,321 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,322 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,322 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,322 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,322 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,322 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-06 19:49:51,322 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-06 19:49:51,322 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-06 19:49:51,322 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-06 19:49:51,323 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-06 19:49:51,323 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-06 19:49:51,323 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-06 19:49:51,323 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-06 19:49:51,323 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-06 19:49:51,323 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-06 19:49:51,323 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-06 19:49:51,323 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-06 19:49:51,323 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-06 19:49:51,323 INFO L428 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-11-06 19:49:51,323 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,323 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,324 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,324 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,324 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,324 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-06 19:49:51,324 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-06 19:49:51,324 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-06 19:49:51,324 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-06 19:49:51,324 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-06 19:49:51,324 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-06 19:49:51,324 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-06 19:49:51,324 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-06 19:49:51,324 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-06 19:49:51,324 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,325 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,325 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,325 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 569) no Hoare annotation was computed. [2018-11-06 19:49:51,325 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,325 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,325 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-06 19:49:51,325 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-06 19:49:51,325 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-06 19:49:51,325 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-06 19:49:51,325 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-06 19:49:51,325 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-06 19:49:51,325 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-06 19:49:51,326 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-06 19:49:51,326 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 19:49:51,326 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-06 19:49:51,326 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-06 19:49:51,326 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-06 19:49:51,326 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-06 19:49:51,326 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-06 19:49:51,326 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-06 19:49:51,326 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-06 19:49:51,326 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,327 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,327 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,327 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1))) (let ((.cse1 (= ~a8~0 15)) (.cse12 (= ~a20~0 1)) (.cse15 (not .cse7))) (let ((.cse11 (and .cse1 .cse12 .cse15)) (.cse14 (= ~a16~0 5)) (.cse0 (not .cse12)) (.cse6 (not (= 6 ~a16~0))) (.cse9 (= ~a16~0 4)) (.cse8 (= ~a21~0 1)) (.cse5 (<= ~a21~0 0)) (.cse13 (= ~a8~0 13)) (.cse2 (= ~a12~0 8)) (.cse10 (<= ~a17~0 0)) (.cse3 (= ~a16~0 6)) (.cse4 (= ~a7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6 .cse2) (and .cse4 .cse7 .cse8) (and .cse9 .cse2 .cse10 .cse11) (and (not .cse4) .cse9 (= ~a8~0 14) .cse2 .cse10 .cse8) (and .cse7 .cse2 .cse8 .cse12) (and .cse4 .cse5 .cse6 .cse13 .cse2 .cse7) (and .cse1 .cse10 .cse14) (and .cse11 .cse3) (and .cse0 .cse1 .cse6 .cse8) (and .cse4 .cse1 .cse14) (and .cse4 .cse2 .cse15 .cse14) (and .cse4 .cse5 .cse9 .cse13 .cse2 .cse10 (= ULTIMATE.start_calculate_output_~input 4)) (and .cse0 .cse6 .cse15) (and .cse9 .cse13 .cse2 .cse10 .cse8 (<= ~a7~0 0)) (and .cse4 .cse5 .cse13 .cse2 .cse10 .cse12 .cse3) (and .cse4 .cse1 .cse12 .cse15))))) [2018-11-06 19:49:51,327 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,327 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,327 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-06 19:49:51,327 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-06 19:49:51,327 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-06 19:49:51,327 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-06 19:49:51,328 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-06 19:49:51,328 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-06 19:49:51,328 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-06 19:49:51,328 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-06 19:49:51,328 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,328 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,328 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,328 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,328 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,328 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-06 19:49:51,328 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 19:49:51,329 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-06 19:49:51,329 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-06 19:49:51,329 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-06 19:49:51,329 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-06 19:49:51,329 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-06 19:49:51,329 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-06 19:49:51,329 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-06 19:49:51,329 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-06 19:49:51,329 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-06 19:49:51,329 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-06 19:49:51,330 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-06 19:49:51,330 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,330 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,330 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,330 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,330 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,330 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-06 19:49:51,330 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,330 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-06 19:49:51,330 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-06 19:49:51,331 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 19:49:51,331 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-06 19:49:51,331 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-06 19:49:51,331 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-06 19:49:51,331 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-06 19:49:51,331 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-06 19:49:51,332 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-06 19:49:51,332 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-06 19:49:51,332 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-06 19:49:51,332 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-06 19:49:51,332 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-06 19:49:51,332 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,332 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,332 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,332 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,332 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,332 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,332 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-06 19:49:51,332 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-06 19:49:51,333 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-06 19:49:51,333 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-06 19:49:51,333 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-06 19:49:51,333 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-06 19:49:51,333 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-06 19:49:51,333 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-06 19:49:51,333 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-06 19:49:51,333 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-06 19:49:51,333 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-06 19:49:51,333 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-06 19:49:51,333 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 19:49:51,333 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-06 19:49:51,337 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-06 19:49:51,337 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-06 19:49:51,337 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,337 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,337 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,338 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,338 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,338 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:51,338 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-06 19:49:51,338 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-06 19:49:51,338 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-06 19:49:51,338 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-06 19:49:51,338 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-06 19:49:51,338 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-06 19:49:51,338 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-06 19:49:51,338 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-06 19:49:51,338 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-06 19:49:51,339 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-06 19:49:51,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:49:51 BoogieIcfgContainer [2018-11-06 19:49:51,375 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:49:51,378 INFO L168 Benchmark]: Toolchain (without parser) took 40737.36 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -334.9 MB). Peak memory consumption was 855.2 MB. Max. memory is 7.1 GB. [2018-11-06 19:49:51,379 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:49:51,380 INFO L168 Benchmark]: CACSL2BoogieTranslator took 778.27 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-06 19:49:51,380 INFO L168 Benchmark]: Boogie Procedure Inliner took 193.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -817.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. [2018-11-06 19:49:51,386 INFO L168 Benchmark]: Boogie Preprocessor took 64.34 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:49:51,386 INFO L168 Benchmark]: RCFGBuilder took 3137.52 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 118.5 MB). Peak memory consumption was 118.5 MB. Max. memory is 7.1 GB. [2018-11-06 19:49:51,387 INFO L168 Benchmark]: TraceAbstraction took 36558.18 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 448.8 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 332.2 MB). Peak memory consumption was 781.0 MB. Max. memory is 7.1 GB. [2018-11-06 19:49:51,397 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 778.27 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 193.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -817.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.34 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3137.52 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 118.5 MB). Peak memory consumption was 118.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 36558.18 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 448.8 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 332.2 MB). Peak memory consumption was 781.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 569]: 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: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(a20 == 1) && a8 == 15) && a12 == 8) && a16 == 6) || ((((a7 == 1 && !(a20 == 1)) && a21 <= 0) && !(6 == a16)) && a12 == 8)) || ((a7 == 1 && a17 == 1) && a21 == 1)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && (a8 == 15 && a20 == 1) && !(a17 == 1))) || (((((!(a7 == 1) && a16 == 4) && a8 == 14) && a12 == 8) && a17 <= 0) && a21 == 1)) || (((a17 == 1 && a12 == 8) && a21 == 1) && a20 == 1)) || (((((a7 == 1 && a21 <= 0) && !(6 == a16)) && a8 == 13) && a12 == 8) && a17 == 1)) || ((a8 == 15 && a17 <= 0) && a16 == 5)) || (((a8 == 15 && a20 == 1) && !(a17 == 1)) && a16 == 6)) || (((!(a20 == 1) && a8 == 15) && !(6 == a16)) && a21 == 1)) || ((a7 == 1 && a8 == 15) && a16 == 5)) || (((a7 == 1 && a12 == 8) && !(a17 == 1)) && a16 == 5)) || ((((((a7 == 1 && a21 <= 0) && a16 == 4) && a8 == 13) && a12 == 8) && a17 <= 0) && input == 4)) || ((!(a20 == 1) && !(6 == a16)) && !(a17 == 1))) || (((((a16 == 4 && a8 == 13) && a12 == 8) && a17 <= 0) && a21 == 1) && a7 <= 0)) || ((((((a7 == 1 && a21 <= 0) && a8 == 13) && a12 == 8) && a17 <= 0) && a20 == 1) && a16 == 6)) || (((a7 == 1 && a8 == 15) && a20 == 1) && !(a17 == 1)) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(a20 == 1) && a8 == 15) && a12 == 8) && a16 == 6) || ((((a7 == 1 && !(a20 == 1)) && a21 <= 0) && !(6 == a16)) && a12 == 8)) || ((a7 == 1 && a17 == 1) && a21 == 1)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && (a8 == 15 && a20 == 1) && !(a17 == 1))) || (((((!(a7 == 1) && a16 == 4) && a8 == 14) && a12 == 8) && a17 <= 0) && a21 == 1)) || (((a17 == 1 && a12 == 8) && a21 == 1) && a20 == 1)) || (((((a7 == 1 && a21 <= 0) && !(6 == a16)) && a8 == 13) && a12 == 8) && a17 == 1)) || ((a8 == 15 && a17 <= 0) && a16 == 5)) || (((a8 == 15 && a20 == 1) && !(a17 == 1)) && a16 == 6)) || (((!(a20 == 1) && a8 == 15) && !(6 == a16)) && a21 == 1)) || ((a7 == 1 && a8 == 15) && a16 == 5)) || (((a7 == 1 && a12 == 8) && !(a17 == 1)) && a16 == 5)) || ((((((a7 == 1 && a21 <= 0) && a16 == 4) && a8 == 13) && a12 == 8) && a17 <= 0) && input == 4)) || ((!(a20 == 1) && !(6 == a16)) && !(a17 == 1))) || (((((a16 == 4 && a8 == 13) && a12 == 8) && a17 <= 0) && a21 == 1) && a7 <= 0)) || ((((((a7 == 1 && a21 <= 0) && a8 == 13) && a12 == 8) && a17 <= 0) && a20 == 1) && a16 == 6)) || (((a7 == 1 && a8 == 15) && a20 == 1) && !(a17 == 1)) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 199 locations, 1 error locations. SAFE Result, 36.4s OverallTime, 14 OverallIterations, 6 TraceHistogramMax, 26.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1782 SDtfs, 4244 SDslu, 912 SDs, 0 SdLazy, 10260 SolverSat, 1338 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 374 GetRequests, 309 SyntacticMatches, 9 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3923occurred in iteration=9, 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, 14 MinimizatonAttempts, 935 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 96 NumberOfFragments, 543 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1155 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 390 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 3080 NumberOfCodeBlocks, 3080 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3065 ConstructedInterpolants, 0 QuantifiedInterpolants, 3378562 SizeOfPredicates, 1 NumberOfNonLiveVariables, 492 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 1994/1999 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...