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_label19_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:49:21,700 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:49:21,702 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:49:21,720 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:49:21,720 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:49:21,721 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:49:21,723 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:49:21,725 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:49:21,726 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:49:21,727 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:49:21,728 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:49:21,729 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:49:21,730 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:49:21,731 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:49:21,732 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:49:21,733 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:49:21,734 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:49:21,736 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:49:21,741 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:49:21,746 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:49:21,751 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:49:21,753 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:49:21,755 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:49:21,756 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:49:21,756 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:49:21,757 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:49:21,758 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:49:21,759 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:49:21,760 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:49:21,761 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:49:21,762 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:49:21,762 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:49:21,763 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:49:21,763 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:49:21,764 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:49:21,765 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:49:21,765 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:21,795 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:49:21,796 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:49:21,796 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:49:21,797 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:49:21,798 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:49:21,798 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:49:21,798 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:49:21,798 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:49:21,799 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:49:21,799 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:49:21,799 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:49:21,799 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:49:21,799 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:49:21,801 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:49:21,801 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:49:21,801 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:49:21,801 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:49:21,802 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:49:21,802 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:49:21,802 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:49:21,802 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:49:21,802 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:49:21,804 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:49:21,804 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:49:21,804 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:49:21,805 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:49:21,805 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:49:21,805 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:49:21,875 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:49:21,892 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:49:21,898 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:49:21,899 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:49:21,900 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:49:21,901 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label19_true-unreach-call_false-termination.c [2018-11-06 19:49:21,972 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f3c0e568/3dbf4faa6bf74f60a2096e0b764caace/FLAG544e1eda5 [2018-11-06 19:49:22,550 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:49:22,551 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label19_true-unreach-call_false-termination.c [2018-11-06 19:49:22,573 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f3c0e568/3dbf4faa6bf74f60a2096e0b764caace/FLAG544e1eda5 [2018-11-06 19:49:22,594 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f3c0e568/3dbf4faa6bf74f60a2096e0b764caace [2018-11-06 19:49:22,606 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:49:22,607 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:49:22,609 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:49:22,609 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:49:22,613 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:49:22,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:49:22" (1/1) ... [2018-11-06 19:49:22,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2166149d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:22, skipping insertion in model container [2018-11-06 19:49:22,618 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:49:22" (1/1) ... [2018-11-06 19:49:22,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:49:22,707 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:49:23,201 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:49:23,206 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:49:23,322 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:49:23,339 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:49:23,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:23 WrapperNode [2018-11-06 19:49:23,340 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:49:23,341 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:49:23,341 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:49:23,341 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:49:23,353 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:23" (1/1) ... [2018-11-06 19:49:23,379 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:23" (1/1) ... [2018-11-06 19:49:23,545 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:49:23,546 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:49:23,546 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:49:23,546 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:49:23,556 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:23" (1/1) ... [2018-11-06 19:49:23,556 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:23" (1/1) ... [2018-11-06 19:49:23,561 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:23" (1/1) ... [2018-11-06 19:49:23,561 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:23" (1/1) ... [2018-11-06 19:49:23,598 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:23" (1/1) ... [2018-11-06 19:49:23,625 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:23" (1/1) ... [2018-11-06 19:49:23,633 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:23" (1/1) ... [2018-11-06 19:49:23,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:49:23,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:49:23,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:49:23,651 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:49:23,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:23" (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:23,739 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:49:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:49:23,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:49:27,089 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:49:27,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:49:27 BoogieIcfgContainer [2018-11-06 19:49:27,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:49:27,092 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:49:27,092 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:49:27,096 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:49:27,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:49:22" (1/3) ... [2018-11-06 19:49:27,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e0cf30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:49:27, skipping insertion in model container [2018-11-06 19:49:27,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:23" (2/3) ... [2018-11-06 19:49:27,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e0cf30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:49:27, skipping insertion in model container [2018-11-06 19:49:27,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:49:27" (3/3) ... [2018-11-06 19:49:27,102 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label19_true-unreach-call_false-termination.c [2018-11-06 19:49:27,114 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:49:27,132 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:49:27,151 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:49:27,201 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:49:27,202 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:49:27,203 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:49:27,203 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:49:27,203 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:49:27,203 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:49:27,203 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:49:27,204 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:49:27,204 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:49:27,237 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-11-06 19:49:27,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-06 19:49:27,254 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:27,255 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] [2018-11-06 19:49:27,258 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:27,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:27,266 INFO L82 PathProgramCache]: Analyzing trace with hash -911056249, now seen corresponding path program 1 times [2018-11-06 19:49:27,268 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:27,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:27,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:27,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:27,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:27,905 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:27,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:27,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:49:27,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:49:27,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:49:27,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:27,936 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 4 states. [2018-11-06 19:49:30,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:30,318 INFO L93 Difference]: Finished difference Result 666 states and 1182 transitions. [2018-11-06 19:49:30,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:49:30,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-11-06 19:49:30,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:30,342 INFO L225 Difference]: With dead ends: 666 [2018-11-06 19:49:30,343 INFO L226 Difference]: Without dead ends: 460 [2018-11-06 19:49:30,347 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:30,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-11-06 19:49:30,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2018-11-06 19:49:30,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-11-06 19:49:30,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 743 transitions. [2018-11-06 19:49:30,421 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 743 transitions. Word has length 87 [2018-11-06 19:49:30,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:30,422 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 743 transitions. [2018-11-06 19:49:30,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:49:30,423 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 743 transitions. [2018-11-06 19:49:30,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-06 19:49:30,428 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:30,428 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-06 19:49:30,429 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:30,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:30,429 INFO L82 PathProgramCache]: Analyzing trace with hash -629824146, now seen corresponding path program 1 times [2018-11-06 19:49:30,429 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:30,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:30,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:30,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:30,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:30,526 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:49:30,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:30,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:49:30,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:49:30,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:49:30,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:30,529 INFO L87 Difference]: Start difference. First operand 460 states and 743 transitions. Second operand 4 states. [2018-11-06 19:49:31,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:31,653 INFO L93 Difference]: Finished difference Result 1314 states and 2164 transitions. [2018-11-06 19:49:31,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:49:31,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-11-06 19:49:31,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:31,661 INFO L225 Difference]: With dead ends: 1314 [2018-11-06 19:49:31,662 INFO L226 Difference]: Without dead ends: 856 [2018-11-06 19:49:31,665 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:31,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-11-06 19:49:31,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2018-11-06 19:49:31,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-11-06 19:49:31,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1279 transitions. [2018-11-06 19:49:31,719 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1279 transitions. Word has length 93 [2018-11-06 19:49:31,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:31,719 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 1279 transitions. [2018-11-06 19:49:31,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:49:31,719 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1279 transitions. [2018-11-06 19:49:31,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-06 19:49:31,727 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:31,728 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2018-11-06 19:49:31,728 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:31,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:31,729 INFO L82 PathProgramCache]: Analyzing trace with hash -824834435, now seen corresponding path program 1 times [2018-11-06 19:49:31,729 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:31,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:31,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:31,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:31,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:31,845 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:49:31,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:31,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:49:31,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:49:31,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:49:31,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:49:31,848 INFO L87 Difference]: Start difference. First operand 856 states and 1279 transitions. Second operand 3 states. [2018-11-06 19:49:34,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:34,868 INFO L93 Difference]: Finished difference Result 2106 states and 3236 transitions. [2018-11-06 19:49:34,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:49:34,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2018-11-06 19:49:34,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:34,876 INFO L225 Difference]: With dead ends: 2106 [2018-11-06 19:49:34,877 INFO L226 Difference]: Without dead ends: 1252 [2018-11-06 19:49:34,879 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:34,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2018-11-06 19:49:34,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1252. [2018-11-06 19:49:34,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2018-11-06 19:49:34,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1911 transitions. [2018-11-06 19:49:34,919 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1911 transitions. Word has length 115 [2018-11-06 19:49:34,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:34,920 INFO L480 AbstractCegarLoop]: Abstraction has 1252 states and 1911 transitions. [2018-11-06 19:49:34,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:49:34,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1911 transitions. [2018-11-06 19:49:34,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-06 19:49:34,930 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:34,931 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 19:49:34,931 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:34,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:34,932 INFO L82 PathProgramCache]: Analyzing trace with hash -190984820, now seen corresponding path program 1 times [2018-11-06 19:49:34,932 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:34,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:34,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:34,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:34,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:35,163 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-11-06 19:49:35,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:35,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:49:35,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:49:35,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:49:35,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:49:35,165 INFO L87 Difference]: Start difference. First operand 1252 states and 1911 transitions. Second operand 3 states. [2018-11-06 19:49:36,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:36,266 INFO L93 Difference]: Finished difference Result 3294 states and 4988 transitions. [2018-11-06 19:49:36,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:49:36,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2018-11-06 19:49:36,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:36,277 INFO L225 Difference]: With dead ends: 3294 [2018-11-06 19:49:36,278 INFO L226 Difference]: Without dead ends: 2044 [2018-11-06 19:49:36,280 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:36,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2018-11-06 19:49:36,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 2044. [2018-11-06 19:49:36,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2044 states. [2018-11-06 19:49:36,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 2875 transitions. [2018-11-06 19:49:36,323 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 2875 transitions. Word has length 153 [2018-11-06 19:49:36,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:36,324 INFO L480 AbstractCegarLoop]: Abstraction has 2044 states and 2875 transitions. [2018-11-06 19:49:36,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:49:36,324 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2875 transitions. [2018-11-06 19:49:36,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-06 19:49:36,330 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:36,330 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2018-11-06 19:49:36,331 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:36,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:36,331 INFO L82 PathProgramCache]: Analyzing trace with hash -222581075, now seen corresponding path program 1 times [2018-11-06 19:49:36,331 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:36,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:36,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:36,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:36,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:36,432 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-11-06 19:49:36,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:36,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:49:36,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:49:36,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:49:36,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:49:36,434 INFO L87 Difference]: Start difference. First operand 2044 states and 2875 transitions. Second operand 3 states. [2018-11-06 19:49:37,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:37,158 INFO L93 Difference]: Finished difference Result 5802 states and 8113 transitions. [2018-11-06 19:49:37,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:49:37,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2018-11-06 19:49:37,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:37,175 INFO L225 Difference]: With dead ends: 5802 [2018-11-06 19:49:37,176 INFO L226 Difference]: Without dead ends: 3760 [2018-11-06 19:49:37,180 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:37,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3760 states. [2018-11-06 19:49:37,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3760 to 3760. [2018-11-06 19:49:37,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3760 states. [2018-11-06 19:49:37,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3760 states to 3760 states and 4970 transitions. [2018-11-06 19:49:37,247 INFO L78 Accepts]: Start accepts. Automaton has 3760 states and 4970 transitions. Word has length 173 [2018-11-06 19:49:37,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:37,247 INFO L480 AbstractCegarLoop]: Abstraction has 3760 states and 4970 transitions. [2018-11-06 19:49:37,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:49:37,247 INFO L276 IsEmpty]: Start isEmpty. Operand 3760 states and 4970 transitions. [2018-11-06 19:49:37,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-06 19:49:37,254 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:37,255 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2018-11-06 19:49:37,255 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:37,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:37,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1268532227, now seen corresponding path program 1 times [2018-11-06 19:49:37,256 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:37,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:37,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:37,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:37,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:37,444 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-11-06 19:49:37,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:37,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:49:37,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:49:37,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:49:37,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:49:37,445 INFO L87 Difference]: Start difference. First operand 3760 states and 4970 transitions. Second operand 3 states. [2018-11-06 19:49:38,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:38,076 INFO L93 Difference]: Finished difference Result 7650 states and 10133 transitions. [2018-11-06 19:49:38,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:49:38,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2018-11-06 19:49:38,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:38,094 INFO L225 Difference]: With dead ends: 7650 [2018-11-06 19:49:38,095 INFO L226 Difference]: Without dead ends: 3892 [2018-11-06 19:49:38,100 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:49:38,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3892 states. [2018-11-06 19:49:38,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3892 to 3892. [2018-11-06 19:49:38,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3892 states. [2018-11-06 19:49:38,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3892 states to 3892 states and 5084 transitions. [2018-11-06 19:49:38,169 INFO L78 Accepts]: Start accepts. Automaton has 3892 states and 5084 transitions. Word has length 175 [2018-11-06 19:49:38,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:38,170 INFO L480 AbstractCegarLoop]: Abstraction has 3892 states and 5084 transitions. [2018-11-06 19:49:38,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:49:38,170 INFO L276 IsEmpty]: Start isEmpty. Operand 3892 states and 5084 transitions. [2018-11-06 19:49:38,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-06 19:49:38,177 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:38,178 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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] [2018-11-06 19:49:38,178 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:38,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:38,178 INFO L82 PathProgramCache]: Analyzing trace with hash -403770965, now seen corresponding path program 1 times [2018-11-06 19:49:38,179 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:38,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:38,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:38,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:38,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:38,661 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-11-06 19:49:38,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:38,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 19:49:38,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 19:49:38,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 19:49:38,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:49:38,663 INFO L87 Difference]: Start difference. First operand 3892 states and 5084 transitions. Second operand 7 states. [2018-11-06 19:49:40,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:40,178 INFO L93 Difference]: Finished difference Result 7846 states and 10230 transitions. [2018-11-06 19:49:40,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 19:49:40,179 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 180 [2018-11-06 19:49:40,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:40,196 INFO L225 Difference]: With dead ends: 7846 [2018-11-06 19:49:40,196 INFO L226 Difference]: Without dead ends: 3956 [2018-11-06 19:49:40,202 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:49:40,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3956 states. [2018-11-06 19:49:40,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3956 to 3892. [2018-11-06 19:49:40,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3892 states. [2018-11-06 19:49:40,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3892 states to 3892 states and 5066 transitions. [2018-11-06 19:49:40,278 INFO L78 Accepts]: Start accepts. Automaton has 3892 states and 5066 transitions. Word has length 180 [2018-11-06 19:49:40,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:40,279 INFO L480 AbstractCegarLoop]: Abstraction has 3892 states and 5066 transitions. [2018-11-06 19:49:40,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 19:49:40,279 INFO L276 IsEmpty]: Start isEmpty. Operand 3892 states and 5066 transitions. [2018-11-06 19:49:40,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-06 19:49:40,288 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:40,288 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2018-11-06 19:49:40,288 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:40,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:40,289 INFO L82 PathProgramCache]: Analyzing trace with hash -419698118, now seen corresponding path program 1 times [2018-11-06 19:49:40,289 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:40,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:40,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:40,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:40,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:40,558 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-11-06 19:49:40,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:40,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:49:40,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:49:40,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:49:40,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:40,559 INFO L87 Difference]: Start difference. First operand 3892 states and 5066 transitions. Second operand 4 states. [2018-11-06 19:49:44,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:44,207 INFO L93 Difference]: Finished difference Result 8320 states and 10864 transitions. [2018-11-06 19:49:44,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:49:44,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2018-11-06 19:49:44,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:44,222 INFO L225 Difference]: With dead ends: 8320 [2018-11-06 19:49:44,222 INFO L226 Difference]: Without dead ends: 4430 [2018-11-06 19:49:44,226 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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:44,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4430 states. [2018-11-06 19:49:44,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4430 to 4430. [2018-11-06 19:49:44,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4430 states. [2018-11-06 19:49:44,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4430 states to 4430 states and 5443 transitions. [2018-11-06 19:49:44,296 INFO L78 Accepts]: Start accepts. Automaton has 4430 states and 5443 transitions. Word has length 213 [2018-11-06 19:49:44,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:44,297 INFO L480 AbstractCegarLoop]: Abstraction has 4430 states and 5443 transitions. [2018-11-06 19:49:44,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:49:44,297 INFO L276 IsEmpty]: Start isEmpty. Operand 4430 states and 5443 transitions. [2018-11-06 19:49:44,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-11-06 19:49:44,306 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:44,306 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,306 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:44,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:44,307 INFO L82 PathProgramCache]: Analyzing trace with hash 441010427, now seen corresponding path program 1 times [2018-11-06 19:49:44,307 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:44,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:44,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:44,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:44,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:44,523 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-06 19:49:44,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:44,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:49:44,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:49:44,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:49:44,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:44,525 INFO L87 Difference]: Start difference. First operand 4430 states and 5443 transitions. Second operand 4 states. [2018-11-06 19:49:45,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:45,824 INFO L93 Difference]: Finished difference Result 12158 states and 14876 transitions. [2018-11-06 19:49:45,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:49:45,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 239 [2018-11-06 19:49:45,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:45,852 INFO L225 Difference]: With dead ends: 12158 [2018-11-06 19:49:45,853 INFO L226 Difference]: Without dead ends: 7730 [2018-11-06 19:49:45,858 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:45,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7730 states. [2018-11-06 19:49:45,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7730 to 7730. [2018-11-06 19:49:45,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7730 states. [2018-11-06 19:49:45,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7730 states to 7730 states and 9228 transitions. [2018-11-06 19:49:45,971 INFO L78 Accepts]: Start accepts. Automaton has 7730 states and 9228 transitions. Word has length 239 [2018-11-06 19:49:45,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:45,971 INFO L480 AbstractCegarLoop]: Abstraction has 7730 states and 9228 transitions. [2018-11-06 19:49:45,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:49:45,971 INFO L276 IsEmpty]: Start isEmpty. Operand 7730 states and 9228 transitions. [2018-11-06 19:49:45,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-06 19:49:45,982 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:45,983 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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, 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] [2018-11-06 19:49:45,983 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:45,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:45,984 INFO L82 PathProgramCache]: Analyzing trace with hash 2140333706, now seen corresponding path program 1 times [2018-11-06 19:49:45,984 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:45,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:45,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:45,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:45,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:46,204 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-11-06 19:49:46,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:46,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 19:49:46,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:49:46,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:49:46,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:49:46,206 INFO L87 Difference]: Start difference. First operand 7730 states and 9228 transitions. Second operand 6 states. [2018-11-06 19:49:47,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:47,813 INFO L93 Difference]: Finished difference Result 15354 states and 18264 transitions. [2018-11-06 19:49:47,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:49:47,813 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 261 [2018-11-06 19:49:47,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:47,833 INFO L225 Difference]: With dead ends: 15354 [2018-11-06 19:49:47,833 INFO L226 Difference]: Without dead ends: 7758 [2018-11-06 19:49:47,841 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:49:47,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7758 states. [2018-11-06 19:49:47,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7758 to 7196. [2018-11-06 19:49:47,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7196 states. [2018-11-06 19:49:47,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7196 states to 7196 states and 8212 transitions. [2018-11-06 19:49:47,961 INFO L78 Accepts]: Start accepts. Automaton has 7196 states and 8212 transitions. Word has length 261 [2018-11-06 19:49:47,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:47,962 INFO L480 AbstractCegarLoop]: Abstraction has 7196 states and 8212 transitions. [2018-11-06 19:49:47,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:49:47,962 INFO L276 IsEmpty]: Start isEmpty. Operand 7196 states and 8212 transitions. [2018-11-06 19:49:47,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-11-06 19:49:47,975 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:47,975 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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, 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] [2018-11-06 19:49:47,975 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:47,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:47,976 INFO L82 PathProgramCache]: Analyzing trace with hash -259654463, now seen corresponding path program 1 times [2018-11-06 19:49:47,976 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:47,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:47,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:47,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:47,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:48,583 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-06 19:49:49,016 WARN L179 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2018-11-06 19:49:49,215 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-11-06 19:49:49,465 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2018-11-06 19:49:50,013 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 364 proven. 10 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-06 19:49:50,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:49:50,014 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:50,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:50,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:49:50,374 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-11-06 19:49:50,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:49:50,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2018-11-06 19:49:50,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-06 19:49:50,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-06 19:49:50,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2018-11-06 19:49:50,413 INFO L87 Difference]: Start difference. First operand 7196 states and 8212 transitions. Second operand 14 states. [2018-11-06 19:49:54,356 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-11-06 19:49:55,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:55,160 INFO L93 Difference]: Finished difference Result 12951 states and 14657 transitions. [2018-11-06 19:49:55,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-06 19:49:55,161 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 283 [2018-11-06 19:49:55,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:55,162 INFO L225 Difference]: With dead ends: 12951 [2018-11-06 19:49:55,162 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 19:49:55,171 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 284 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2018-11-06 19:49:55,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 19:49:55,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 19:49:55,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 19:49:55,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 19:49:55,173 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 283 [2018-11-06 19:49:55,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:55,173 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 19:49:55,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-06 19:49:55,173 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 19:49:55,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 19:49:55,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 19:49:55,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,389 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 88 [2018-11-06 19:49:55,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:55,583 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 88 [2018-11-06 19:49:57,776 WARN L179 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2018-11-06 19:49:58,204 WARN L179 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2018-11-06 19:49:58,225 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-06 19:49:58,225 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-06 19:49:58,226 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,226 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,226 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,226 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,226 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,226 INFO L425 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,226 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-06 19:49:58,226 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-06 19:49:58,227 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-06 19:49:58,227 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-06 19:49:58,227 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-06 19:49:58,227 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-06 19:49:58,227 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-06 19:49:58,227 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-06 19:49:58,227 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-06 19:49:58,227 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-06 19:49:58,227 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,227 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,228 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,228 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,228 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,228 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,228 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-06 19:49:58,228 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-06 19:49:58,228 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-06 19:49:58,228 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-06 19:49:58,228 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-06 19:49:58,229 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-06 19:49:58,229 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-06 19:49:58,229 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-06 19:49:58,229 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-06 19:49:58,229 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-06 19:49:58,229 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-06 19:49:58,229 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-06 19:49:58,229 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-06 19:49:58,229 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-06 19:49:58,230 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-11-06 19:49:58,230 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,230 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,230 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,230 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,230 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,230 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-06 19:49:58,230 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-06 19:49:58,231 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-06 19:49:58,231 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-06 19:49:58,231 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-06 19:49:58,231 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-06 19:49:58,231 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-06 19:49:58,231 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-06 19:49:58,231 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-06 19:49:58,232 INFO L421 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse9 (= ~a16~0 6)) (.cse10 (= ~a7~0 1)) (.cse6 (= ~a17~0 1))) (let ((.cse2 (not .cse6)) (.cse3 (<= ~a8~0 13)) (.cse4 (not .cse10)) (.cse8 (= ~a8~0 15)) (.cse5 (not .cse9)) (.cse1 (= ~a21~0 1)) (.cse13 (= ~a16~0 4)) (.cse11 (<= ~a21~0 0)) (.cse12 (= ~a8~0 13)) (.cse0 (= ~a12~0 8)) (.cse14 (<= ~a17~0 0)) (.cse7 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2 (= ~a16~0 5)) (and .cse3 .cse4 .cse5 .cse0 .cse1 .cse2) (and .cse4 .cse5 .cse6 .cse0 .cse1 .cse7) (and .cse4 .cse8 .cse0 .cse1 .cse9) (and .cse3 .cse4 .cse0 .cse6 .cse1 .cse7) (and .cse3 .cse5 .cse0 .cse6 .cse1 .cse7) (and .cse4 .cse8 .cse0 .cse6 .cse1) (and .cse10 .cse11 .cse5 .cse12 .cse6 .cse0) (and .cse13 .cse0 .cse14 .cse1) (and .cse10 .cse11 .cse13 .cse12 .cse0 .cse14) (and .cse10 .cse11 .cse12 .cse0 .cse14 .cse7 .cse9 (or (= ULTIMATE.start_calculate_output_~input 2) (= ULTIMATE.start_calculate_output_~input 4) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 6)))))) [2018-11-06 19:49:58,232 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,232 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,233 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,233 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,233 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,233 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-06 19:49:58,233 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-06 19:49:58,233 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-06 19:49:58,233 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-06 19:49:58,233 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-06 19:49:58,233 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-06 19:49:58,234 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-06 19:49:58,234 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-06 19:49:58,234 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-06 19:49:58,234 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-06 19:49:58,234 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-06 19:49:58,234 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-06 19:49:58,234 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-06 19:49:58,234 INFO L428 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-11-06 19:49:58,235 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,235 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,235 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,235 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,235 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,235 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-06 19:49:58,235 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-06 19:49:58,235 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-06 19:49:58,235 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-06 19:49:58,236 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-06 19:49:58,236 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-06 19:49:58,236 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-06 19:49:58,236 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-06 19:49:58,236 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-06 19:49:58,236 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,236 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,236 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,236 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,237 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,237 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-06 19:49:58,237 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-06 19:49:58,237 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-06 19:49:58,237 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-06 19:49:58,237 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-06 19:49:58,237 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-06 19:49:58,237 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-06 19:49:58,237 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-06 19:49:58,237 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 19:49:58,238 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-06 19:49:58,238 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-06 19:49:58,238 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-06 19:49:58,238 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-06 19:49:58,238 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-06 19:49:58,238 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-06 19:49:58,238 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-06 19:49:58,238 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,238 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,239 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,239 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse9 (= ~a16~0 6)) (.cse10 (= ~a7~0 1)) (.cse6 (= ~a17~0 1))) (let ((.cse2 (not .cse6)) (.cse3 (<= ~a8~0 13)) (.cse4 (not .cse10)) (.cse8 (= ~a8~0 15)) (.cse5 (not .cse9)) (.cse1 (= ~a21~0 1)) (.cse13 (= ~a16~0 4)) (.cse11 (<= ~a21~0 0)) (.cse12 (= ~a8~0 13)) (.cse0 (= ~a12~0 8)) (.cse14 (<= ~a17~0 0)) (.cse7 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2 (= ~a16~0 5)) (and .cse3 .cse4 .cse5 .cse0 .cse1 .cse2) (and .cse4 .cse5 .cse6 .cse0 .cse1 .cse7) (and .cse4 .cse8 .cse0 .cse1 .cse9) (and .cse3 .cse4 .cse0 .cse6 .cse1 .cse7) (and .cse3 .cse5 .cse0 .cse6 .cse1 .cse7) (and .cse4 .cse8 .cse0 .cse6 .cse1) (and .cse10 .cse11 .cse5 .cse12 .cse6 .cse0) (and .cse13 .cse0 .cse14 .cse1) (and .cse10 .cse11 .cse13 .cse12 .cse0 .cse14) (and .cse10 .cse11 .cse12 .cse0 .cse14 .cse7 .cse9 (or (= ULTIMATE.start_calculate_output_~input 2) (= ULTIMATE.start_calculate_output_~input 4) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 6)))))) [2018-11-06 19:49:58,239 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,239 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,239 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-06 19:49:58,239 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-06 19:49:58,240 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-06 19:49:58,240 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-06 19:49:58,240 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-06 19:49:58,240 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-06 19:49:58,240 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-06 19:49:58,240 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-06 19:49:58,240 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,240 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,240 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,241 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,241 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,241 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-06 19:49:58,241 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 19:49:58,241 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-06 19:49:58,241 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-06 19:49:58,241 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-06 19:49:58,241 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-06 19:49:58,241 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-06 19:49:58,242 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-06 19:49:58,242 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-06 19:49:58,242 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-06 19:49:58,242 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-06 19:49:58,242 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-06 19:49:58,242 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-06 19:49:58,242 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,242 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,242 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,243 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,243 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,243 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-06 19:49:58,243 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,243 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-06 19:49:58,243 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-06 19:49:58,243 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 19:49:58,243 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-06 19:49:58,244 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-06 19:49:58,244 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-06 19:49:58,244 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-06 19:49:58,244 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-06 19:49:58,244 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-06 19:49:58,244 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-06 19:49:58,244 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-06 19:49:58,244 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-06 19:49:58,245 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-06 19:49:58,245 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,245 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,245 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,245 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,245 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,245 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,245 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-06 19:49:58,245 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-06 19:49:58,246 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-06 19:49:58,246 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-06 19:49:58,246 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-06 19:49:58,246 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-06 19:49:58,246 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-06 19:49:58,246 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-06 19:49:58,246 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-06 19:49:58,246 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-06 19:49:58,246 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-06 19:49:58,246 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-06 19:49:58,247 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 19:49:58,247 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-06 19:49:58,247 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-06 19:49:58,247 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 434) no Hoare annotation was computed. [2018-11-06 19:49:58,247 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-06 19:49:58,247 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,247 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,248 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,248 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,248 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,248 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:58,248 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-06 19:49:58,248 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-06 19:49:58,248 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-06 19:49:58,248 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-06 19:49:58,248 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-06 19:49:58,249 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-06 19:49:58,249 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-06 19:49:58,249 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-06 19:49:58,249 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-06 19:49:58,249 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-06 19:49:58,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:49:58 BoogieIcfgContainer [2018-11-06 19:49:58,277 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:49:58,278 INFO L168 Benchmark]: Toolchain (without parser) took 35671.91 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 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 914.0 MB. Max. memory is 7.1 GB. [2018-11-06 19:49:58,279 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:49:58,280 INFO L168 Benchmark]: CACSL2BoogieTranslator took 731.78 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:58,281 INFO L168 Benchmark]: Boogie Procedure Inliner took 204.66 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 723.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -799.0 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-11-06 19:49:58,282 INFO L168 Benchmark]: Boogie Preprocessor took 102.36 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 7.1 GB. [2018-11-06 19:49:58,283 INFO L168 Benchmark]: RCFGBuilder took 3439.68 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 106.3 MB). Peak memory consumption was 106.3 MB. Max. memory is 7.1 GB. [2018-11-06 19:49:58,284 INFO L168 Benchmark]: TraceAbstraction took 31185.56 ms. Allocated memory was 2.2 GB in the beginning and 2.7 GB in the end (delta: 476.6 MB). Free memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: -576.8 MB). Peak memory consumption was 835.0 MB. Max. memory is 7.1 GB. [2018-11-06 19:49:58,289 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 731.78 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 204.66 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 723.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -799.0 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 102.36 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3439.68 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 106.3 MB). Peak memory consumption was 106.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31185.56 ms. Allocated memory was 2.2 GB in the beginning and 2.7 GB in the end (delta: 476.6 MB). Free memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: -576.8 MB). Peak memory consumption was 835.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 434]: 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: ((((((((((((a12 == 8 && a21 == 1) && !(a17 == 1)) && a16 == 5) || (((((a8 <= 13 && !(a7 == 1)) && !(a16 == 6)) && a12 == 8) && a21 == 1) && !(a17 == 1))) || (((((!(a7 == 1) && !(a16 == 6)) && a17 == 1) && a12 == 8) && a21 == 1) && a20 == 1)) || ((((!(a7 == 1) && a8 == 15) && a12 == 8) && a21 == 1) && a16 == 6)) || (((((a8 <= 13 && !(a7 == 1)) && a12 == 8) && a17 == 1) && a21 == 1) && a20 == 1)) || (((((a8 <= 13 && !(a16 == 6)) && a12 == 8) && a17 == 1) && a21 == 1) && a20 == 1)) || ((((!(a7 == 1) && a8 == 15) && a12 == 8) && a17 == 1) && a21 == 1)) || (((((a7 == 1 && a21 <= 0) && !(a16 == 6)) && a8 == 13) && a17 == 1) && a12 == 8)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1)) || (((((a7 == 1 && a21 <= 0) && a16 == 4) && a8 == 13) && a12 == 8) && a17 <= 0)) || (((((((a7 == 1 && a21 <= 0) && a8 == 13) && a12 == 8) && a17 <= 0) && a20 == 1) && a16 == 6) && ((((input == 2 || input == 4) || 1 == input) || 5 == input) || input == 6)) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((a12 == 8 && a21 == 1) && !(a17 == 1)) && a16 == 5) || (((((a8 <= 13 && !(a7 == 1)) && !(a16 == 6)) && a12 == 8) && a21 == 1) && !(a17 == 1))) || (((((!(a7 == 1) && !(a16 == 6)) && a17 == 1) && a12 == 8) && a21 == 1) && a20 == 1)) || ((((!(a7 == 1) && a8 == 15) && a12 == 8) && a21 == 1) && a16 == 6)) || (((((a8 <= 13 && !(a7 == 1)) && a12 == 8) && a17 == 1) && a21 == 1) && a20 == 1)) || (((((a8 <= 13 && !(a16 == 6)) && a12 == 8) && a17 == 1) && a21 == 1) && a20 == 1)) || ((((!(a7 == 1) && a8 == 15) && a12 == 8) && a17 == 1) && a21 == 1)) || (((((a7 == 1 && a21 <= 0) && !(a16 == 6)) && a8 == 13) && a17 == 1) && a12 == 8)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1)) || (((((a7 == 1 && a21 <= 0) && a16 == 4) && a8 == 13) && a12 == 8) && a17 <= 0)) || (((((((a7 == 1 && a21 <= 0) && a8 == 13) && a12 == 8) && a17 <= 0) && a20 == 1) && a16 == 6) && ((((input == 2 || input == 4) || 1 == input) || 5 == input) || input == 6)) - 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, 31.0s OverallTime, 11 OverallIterations, 7 TraceHistogramMax, 22.0s AutomataDifference, 0.0s DeadEndRemovalTime, 3.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1812 SDtfs, 3230 SDslu, 925 SDs, 0 SdLazy, 8633 SolverSat, 1607 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 344 GetRequests, 297 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7730occurred 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.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 626 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 96 NumberOfFragments, 445 HoareAnnotationTreeSize, 3 FomulaSimplifications, 5961 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 3 FomulaSimplificationsInter, 460 FormulaSimplificationTreeSizeReductionInter, 2.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 2255 NumberOfCodeBlocks, 2255 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2243 ConstructedInterpolants, 0 QuantifiedInterpolants, 1630802 SizeOfPredicates, 1 NumberOfNonLiveVariables, 514 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 2855/2865 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...