java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label15.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 01:21:27,695 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 01:21:27,698 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 01:21:27,714 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 01:21:27,715 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 01:21:27,716 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 01:21:27,718 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 01:21:27,727 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 01:21:27,729 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 01:21:27,730 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 01:21:27,732 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 01:21:27,733 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 01:21:27,733 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 01:21:27,734 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 01:21:27,737 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 01:21:27,739 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 01:21:27,740 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 01:21:27,743 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 01:21:27,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 01:21:27,750 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 01:21:27,756 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 01:21:27,757 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 01:21:27,759 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 01:21:27,760 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 01:21:27,762 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 01:21:27,762 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 01:21:27,762 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 01:21:27,765 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 01:21:27,766 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 01:21:27,769 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 01:21:27,769 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 01:21:27,770 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 01:21:27,771 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 01:21:27,772 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 01:21:27,774 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 01:21:27,774 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 01:21:27,775 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 01:21:27,775 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 01:21:27,775 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 01:21:27,776 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 01:21:27,779 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 01:21:27,780 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 01:21:27,808 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 01:21:27,809 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 01:21:27,813 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 01:21:27,813 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 01:21:27,813 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 01:21:27,814 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 01:21:27,814 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 01:21:27,814 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 01:21:27,814 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 01:21:27,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 01:21:27,816 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 01:21:27,816 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 01:21:27,816 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 01:21:27,817 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 01:21:27,817 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 01:21:27,817 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 01:21:27,817 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 01:21:27,817 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 01:21:27,818 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 01:21:27,818 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 01:21:27,818 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 01:21:27,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 01:21:27,818 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 01:21:27,819 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 01:21:27,819 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 01:21:27,819 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 01:21:27,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 01:21:27,820 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 01:21:27,820 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 01:21:27,874 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 01:21:27,887 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 01:21:27,890 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 01:21:27,892 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 01:21:27,893 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 01:21:27,894 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label15.c [2019-10-02 01:21:27,961 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64f269d60/123b2429d97f4045973d9acb5a1a4e61/FLAGb02937e36 [2019-10-02 01:21:28,555 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 01:21:28,556 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label15.c [2019-10-02 01:21:28,570 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64f269d60/123b2429d97f4045973d9acb5a1a4e61/FLAGb02937e36 [2019-10-02 01:21:28,779 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64f269d60/123b2429d97f4045973d9acb5a1a4e61 [2019-10-02 01:21:28,790 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 01:21:28,792 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 01:21:28,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 01:21:28,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 01:21:28,795 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 01:21:28,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:21:28" (1/1) ... [2019-10-02 01:21:28,799 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f305386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:21:28, skipping insertion in model container [2019-10-02 01:21:28,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:21:28" (1/1) ... [2019-10-02 01:21:28,806 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 01:21:28,859 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 01:21:29,462 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:21:29,467 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 01:21:29,610 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:21:29,631 INFO L192 MainTranslator]: Completed translation [2019-10-02 01:21:29,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:21:29 WrapperNode [2019-10-02 01:21:29,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 01:21:29,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 01:21:29,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 01:21:29,633 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 01:21:29,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:21:29" (1/1) ... [2019-10-02 01:21:29,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:21:29" (1/1) ... [2019-10-02 01:21:29,673 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:21:29" (1/1) ... [2019-10-02 01:21:29,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:21:29" (1/1) ... [2019-10-02 01:21:29,741 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:21:29" (1/1) ... [2019-10-02 01:21:29,778 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:21:29" (1/1) ... [2019-10-02 01:21:29,791 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:21:29" (1/1) ... [2019-10-02 01:21:29,802 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 01:21:29,803 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 01:21:29,803 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 01:21:29,803 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 01:21:29,805 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:21:29" (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 [2019-10-02 01:21:29,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 01:21:29,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 01:21:29,888 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 01:21:29,888 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 01:21:29,889 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 01:21:29,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 01:21:29,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 01:21:29,889 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 01:21:29,890 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 01:21:29,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 01:21:29,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 01:21:31,573 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 01:21:31,573 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 01:21:31,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:21:31 BoogieIcfgContainer [2019-10-02 01:21:31,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 01:21:31,577 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 01:21:31,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 01:21:31,582 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 01:21:31,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:21:28" (1/3) ... [2019-10-02 01:21:31,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1afbeda0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:21:31, skipping insertion in model container [2019-10-02 01:21:31,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:21:29" (2/3) ... [2019-10-02 01:21:31,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1afbeda0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:21:31, skipping insertion in model container [2019-10-02 01:21:31,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:21:31" (3/3) ... [2019-10-02 01:21:31,585 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label15.c [2019-10-02 01:21:31,596 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 01:21:31,605 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 01:21:31,623 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 01:21:31,660 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 01:21:31,661 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 01:21:31,661 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 01:21:31,662 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 01:21:31,662 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 01:21:31,662 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 01:21:31,662 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 01:21:31,662 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 01:21:31,663 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 01:21:31,698 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2019-10-02 01:21:31,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-02 01:21:31,708 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:21:31,709 INFO L411 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] [2019-10-02 01:21:31,711 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:21:31,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:21:31,717 INFO L82 PathProgramCache]: Analyzing trace with hash -598870286, now seen corresponding path program 1 times [2019-10-02 01:21:31,719 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:21:31,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:21:31,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:21:31,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:21:31,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:21:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:21:32,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:21:32,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:21:32,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 01:21:32,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 01:21:32,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 01:21:32,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:21:32,132 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 3 states. [2019-10-02 01:21:33,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:21:33,405 INFO L93 Difference]: Finished difference Result 688 states and 1223 transitions. [2019-10-02 01:21:33,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 01:21:33,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-10-02 01:21:33,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:21:33,440 INFO L225 Difference]: With dead ends: 688 [2019-10-02 01:21:33,440 INFO L226 Difference]: Without dead ends: 372 [2019-10-02 01:21:33,453 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:21:33,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-10-02 01:21:33,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2019-10-02 01:21:33,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-10-02 01:21:33,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 602 transitions. [2019-10-02 01:21:33,569 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 602 transitions. Word has length 71 [2019-10-02 01:21:33,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:21:33,570 INFO L475 AbstractCegarLoop]: Abstraction has 372 states and 602 transitions. [2019-10-02 01:21:33,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 01:21:33,570 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 602 transitions. [2019-10-02 01:21:33,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 01:21:33,577 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:21:33,577 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:21:33,578 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:21:33,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:21:33,578 INFO L82 PathProgramCache]: Analyzing trace with hash 96309737, now seen corresponding path program 1 times [2019-10-02 01:21:33,578 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:21:33,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:21:33,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:21:33,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:21:33,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:21:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:21:33,863 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:21:33,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:21:33,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 01:21:33,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:21:33,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:21:33,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:21:33,868 INFO L87 Difference]: Start difference. First operand 372 states and 602 transitions. Second operand 6 states. [2019-10-02 01:21:35,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:21:35,262 INFO L93 Difference]: Finished difference Result 1122 states and 1837 transitions. [2019-10-02 01:21:35,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:21:35,262 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-10-02 01:21:35,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:21:35,268 INFO L225 Difference]: With dead ends: 1122 [2019-10-02 01:21:35,268 INFO L226 Difference]: Without dead ends: 756 [2019-10-02 01:21:35,270 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:21:35,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2019-10-02 01:21:35,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 752. [2019-10-02 01:21:35,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2019-10-02 01:21:35,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1190 transitions. [2019-10-02 01:21:35,324 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1190 transitions. Word has length 140 [2019-10-02 01:21:35,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:21:35,325 INFO L475 AbstractCegarLoop]: Abstraction has 752 states and 1190 transitions. [2019-10-02 01:21:35,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:21:35,326 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1190 transitions. [2019-10-02 01:21:35,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 01:21:35,333 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:21:35,333 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:21:35,334 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:21:35,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:21:35,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1593048690, now seen corresponding path program 1 times [2019-10-02 01:21:35,338 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:21:35,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:21:35,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:21:35,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:21:35,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:21:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:21:35,499 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:21:35,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:21:35,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 01:21:35,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 01:21:35,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 01:21:35,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 01:21:35,505 INFO L87 Difference]: Start difference. First operand 752 states and 1190 transitions. Second operand 5 states. [2019-10-02 01:21:36,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:21:36,728 INFO L93 Difference]: Finished difference Result 1904 states and 3099 transitions. [2019-10-02 01:21:36,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:21:36,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-10-02 01:21:36,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:21:36,761 INFO L225 Difference]: With dead ends: 1904 [2019-10-02 01:21:36,761 INFO L226 Difference]: Without dead ends: 1158 [2019-10-02 01:21:36,768 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 01:21:36,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2019-10-02 01:21:36,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1138. [2019-10-02 01:21:36,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2019-10-02 01:21:36,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1632 transitions. [2019-10-02 01:21:36,823 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1632 transitions. Word has length 141 [2019-10-02 01:21:36,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:21:36,824 INFO L475 AbstractCegarLoop]: Abstraction has 1138 states and 1632 transitions. [2019-10-02 01:21:36,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 01:21:36,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1632 transitions. [2019-10-02 01:21:36,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 01:21:36,827 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:21:36,827 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:21:36,827 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:21:36,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:21:36,828 INFO L82 PathProgramCache]: Analyzing trace with hash -552951950, now seen corresponding path program 1 times [2019-10-02 01:21:36,828 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:21:36,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:21:36,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:21:36,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:21:36,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:21:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:21:36,990 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:21:36,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:21:36,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 01:21:36,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 01:21:36,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 01:21:36,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 01:21:36,992 INFO L87 Difference]: Start difference. First operand 1138 states and 1632 transitions. Second operand 5 states. [2019-10-02 01:21:38,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:21:38,325 INFO L93 Difference]: Finished difference Result 2880 states and 4162 transitions. [2019-10-02 01:21:38,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 01:21:38,328 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2019-10-02 01:21:38,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:21:38,338 INFO L225 Difference]: With dead ends: 2880 [2019-10-02 01:21:38,339 INFO L226 Difference]: Without dead ends: 1748 [2019-10-02 01:21:38,342 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 01:21:38,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2019-10-02 01:21:38,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1326. [2019-10-02 01:21:38,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1326 states. [2019-10-02 01:21:38,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 1863 transitions. [2019-10-02 01:21:38,433 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 1863 transitions. Word has length 143 [2019-10-02 01:21:38,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:21:38,435 INFO L475 AbstractCegarLoop]: Abstraction has 1326 states and 1863 transitions. [2019-10-02 01:21:38,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 01:21:38,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1863 transitions. [2019-10-02 01:21:38,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-02 01:21:38,440 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:21:38,440 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:21:38,440 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:21:38,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:21:38,441 INFO L82 PathProgramCache]: Analyzing trace with hash -621255906, now seen corresponding path program 1 times [2019-10-02 01:21:38,441 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:21:38,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:21:38,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:21:38,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:21:38,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:21:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:21:38,642 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-02 01:21:38,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:21:38,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 01:21:38,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 01:21:38,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 01:21:38,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:21:38,644 INFO L87 Difference]: Start difference. First operand 1326 states and 1863 transitions. Second operand 4 states. [2019-10-02 01:21:40,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:21:40,148 INFO L93 Difference]: Finished difference Result 4126 states and 5834 transitions. [2019-10-02 01:21:40,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 01:21:40,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 227 [2019-10-02 01:21:40,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:21:40,165 INFO L225 Difference]: With dead ends: 4126 [2019-10-02 01:21:40,165 INFO L226 Difference]: Without dead ends: 2806 [2019-10-02 01:21:40,169 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:21:40,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2806 states. [2019-10-02 01:21:40,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2806 to 2258. [2019-10-02 01:21:40,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2258 states. [2019-10-02 01:21:40,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 3058 transitions. [2019-10-02 01:21:40,246 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 3058 transitions. Word has length 227 [2019-10-02 01:21:40,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:21:40,247 INFO L475 AbstractCegarLoop]: Abstraction has 2258 states and 3058 transitions. [2019-10-02 01:21:40,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 01:21:40,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 3058 transitions. [2019-10-02 01:21:40,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-10-02 01:21:40,261 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:21:40,262 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:21:40,262 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:21:40,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:21:40,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1660138625, now seen corresponding path program 1 times [2019-10-02 01:21:40,263 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:21:40,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:21:40,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:21:40,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:21:40,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:21:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:21:40,630 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 238 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:21:40,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:21:40,630 INFO L224 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 [2019-10-02 01:21:40,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:21:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:21:40,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 01:21:40,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:21:40,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:41,118 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-02 01:21:41,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:21:41,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 01:21:41,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:21:41,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:21:41,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:21:41,126 INFO L87 Difference]: Start difference. First operand 2258 states and 3058 transitions. Second operand 9 states. [2019-10-02 01:21:45,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:21:45,182 INFO L93 Difference]: Finished difference Result 6654 states and 9552 transitions. [2019-10-02 01:21:45,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 01:21:45,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 336 [2019-10-02 01:21:45,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:21:45,211 INFO L225 Difference]: With dead ends: 6654 [2019-10-02 01:21:45,212 INFO L226 Difference]: Without dead ends: 4584 [2019-10-02 01:21:45,219 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2019-10-02 01:21:45,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4584 states. [2019-10-02 01:21:45,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4584 to 4390. [2019-10-02 01:21:45,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4390 states. [2019-10-02 01:21:45,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4390 states to 4390 states and 5893 transitions. [2019-10-02 01:21:45,390 INFO L78 Accepts]: Start accepts. Automaton has 4390 states and 5893 transitions. Word has length 336 [2019-10-02 01:21:45,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:21:45,392 INFO L475 AbstractCegarLoop]: Abstraction has 4390 states and 5893 transitions. [2019-10-02 01:21:45,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:21:45,392 INFO L276 IsEmpty]: Start isEmpty. Operand 4390 states and 5893 transitions. [2019-10-02 01:21:45,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2019-10-02 01:21:45,418 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:21:45,419 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:21:45,420 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:21:45,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:21:45,426 INFO L82 PathProgramCache]: Analyzing trace with hash -2146418395, now seen corresponding path program 1 times [2019-10-02 01:21:45,426 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:21:45,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:21:45,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:21:45,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:21:45,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:21:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:21:46,417 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 278 proven. 208 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 01:21:46,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:21:46,418 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:21:46,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:21:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:21:46,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 01:21:46,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:21:46,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:21:46,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:21:46,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:46,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:46,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:46,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:21:46,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:46,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:46,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:21:46,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:46,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:47,046 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 407 proven. 2 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-10-02 01:21:47,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:21:47,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 16 [2019-10-02 01:21:47,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 01:21:47,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 01:21:47,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-02 01:21:47,054 INFO L87 Difference]: Start difference. First operand 4390 states and 5893 transitions. Second operand 16 states. [2019-10-02 01:21:49,916 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-10-02 01:21:51,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:21:51,901 INFO L93 Difference]: Finished difference Result 8684 states and 11791 transitions. [2019-10-02 01:21:51,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-02 01:21:51,901 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 438 [2019-10-02 01:21:51,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:21:51,924 INFO L225 Difference]: With dead ends: 8684 [2019-10-02 01:21:51,924 INFO L226 Difference]: Without dead ends: 4402 [2019-10-02 01:21:51,938 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=431, Invalid=1921, Unknown=0, NotChecked=0, Total=2352 [2019-10-02 01:21:51,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4402 states. [2019-10-02 01:21:52,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4402 to 4386. [2019-10-02 01:21:52,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4386 states. [2019-10-02 01:21:52,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4386 states to 4386 states and 5351 transitions. [2019-10-02 01:21:52,071 INFO L78 Accepts]: Start accepts. Automaton has 4386 states and 5351 transitions. Word has length 438 [2019-10-02 01:21:52,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:21:52,072 INFO L475 AbstractCegarLoop]: Abstraction has 4386 states and 5351 transitions. [2019-10-02 01:21:52,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 01:21:52,072 INFO L276 IsEmpty]: Start isEmpty. Operand 4386 states and 5351 transitions. [2019-10-02 01:21:52,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2019-10-02 01:21:52,110 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:21:52,110 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:21:52,111 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:21:52,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:21:52,112 INFO L82 PathProgramCache]: Analyzing trace with hash 807172485, now seen corresponding path program 1 times [2019-10-02 01:21:52,112 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:21:52,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:21:52,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:21:52,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:21:52,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:21:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:21:52,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 665 proven. 153 refuted. 0 times theorem prover too weak. 641 trivial. 0 not checked. [2019-10-02 01:21:52,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:21:52,886 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:21:52,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:21:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:21:53,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:21:53,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:21:53,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 1070 proven. 2 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2019-10-02 01:21:53,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:21:53,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-10-02 01:21:53,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 01:21:53,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 01:21:53,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-02 01:21:53,484 INFO L87 Difference]: Start difference. First operand 4386 states and 5351 transitions. Second operand 7 states. [2019-10-02 01:21:55,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:21:55,453 INFO L93 Difference]: Finished difference Result 10676 states and 14348 transitions. [2019-10-02 01:21:55,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 01:21:55,454 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 732 [2019-10-02 01:21:55,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:21:55,496 INFO L225 Difference]: With dead ends: 10676 [2019-10-02 01:21:55,496 INFO L226 Difference]: Without dead ends: 6480 [2019-10-02 01:21:55,512 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 749 GetRequests, 738 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-10-02 01:21:55,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6480 states. [2019-10-02 01:21:55,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6480 to 6064. [2019-10-02 01:21:55,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6064 states. [2019-10-02 01:21:55,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6064 states to 6064 states and 7392 transitions. [2019-10-02 01:21:55,736 INFO L78 Accepts]: Start accepts. Automaton has 6064 states and 7392 transitions. Word has length 732 [2019-10-02 01:21:55,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:21:55,738 INFO L475 AbstractCegarLoop]: Abstraction has 6064 states and 7392 transitions. [2019-10-02 01:21:55,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 01:21:55,738 INFO L276 IsEmpty]: Start isEmpty. Operand 6064 states and 7392 transitions. [2019-10-02 01:21:55,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 737 [2019-10-02 01:21:55,785 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:21:55,786 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:21:55,786 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:21:55,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:21:55,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1142243891, now seen corresponding path program 1 times [2019-10-02 01:21:55,787 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:21:55,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:21:55,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:21:55,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:21:55,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:21:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:21:57,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1792 backedges. 719 proven. 727 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2019-10-02 01:21:57,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:21:57,504 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:21:57,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:21:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:21:57,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 1069 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:21:57,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:21:58,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1792 backedges. 906 proven. 2 refuted. 0 times theorem prover too weak. 884 trivial. 0 not checked. [2019-10-02 01:21:58,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:21:58,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-10-02 01:21:58,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 01:21:58,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 01:21:58,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-10-02 01:21:58,044 INFO L87 Difference]: Start difference. First operand 6064 states and 7392 transitions. Second operand 15 states. [2019-10-02 01:22:02,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:22:02,307 INFO L93 Difference]: Finished difference Result 12424 states and 16130 transitions. [2019-10-02 01:22:02,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-02 01:22:02,308 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 736 [2019-10-02 01:22:02,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:22:02,360 INFO L225 Difference]: With dead ends: 12424 [2019-10-02 01:22:02,361 INFO L226 Difference]: Without dead ends: 6460 [2019-10-02 01:22:02,387 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 788 GetRequests, 752 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=310, Invalid=1096, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 01:22:02,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6460 states. [2019-10-02 01:22:02,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6460 to 6056. [2019-10-02 01:22:02,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6056 states. [2019-10-02 01:22:02,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6056 states to 6056 states and 7048 transitions. [2019-10-02 01:22:02,629 INFO L78 Accepts]: Start accepts. Automaton has 6056 states and 7048 transitions. Word has length 736 [2019-10-02 01:22:02,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:22:02,630 INFO L475 AbstractCegarLoop]: Abstraction has 6056 states and 7048 transitions. [2019-10-02 01:22:02,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 01:22:02,634 INFO L276 IsEmpty]: Start isEmpty. Operand 6056 states and 7048 transitions. [2019-10-02 01:22:02,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 740 [2019-10-02 01:22:02,662 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:22:02,663 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:22:02,663 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:22:02,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:22:02,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1668829274, now seen corresponding path program 1 times [2019-10-02 01:22:02,664 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:22:02,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:22:02,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:22:02,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:22:02,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:22:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:22:03,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1473 backedges. 672 proven. 153 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2019-10-02 01:22:03,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:22:03,647 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 01:22:03,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:22:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:22:03,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:22:03,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:22:04,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1473 backedges. 1084 proven. 2 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2019-10-02 01:22:04,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:22:04,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-10-02 01:22:04,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 01:22:04,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 01:22:04,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-02 01:22:04,597 INFO L87 Difference]: Start difference. First operand 6056 states and 7048 transitions. Second operand 7 states. [2019-10-02 01:22:06,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:22:06,380 INFO L93 Difference]: Finished difference Result 13880 states and 17358 transitions. [2019-10-02 01:22:06,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 01:22:06,380 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 739 [2019-10-02 01:22:06,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:22:06,419 INFO L225 Difference]: With dead ends: 13880 [2019-10-02 01:22:06,419 INFO L226 Difference]: Without dead ends: 8014 [2019-10-02 01:22:06,436 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 745 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-10-02 01:22:06,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8014 states. [2019-10-02 01:22:06,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8014 to 7742. [2019-10-02 01:22:06,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7742 states. [2019-10-02 01:22:06,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7742 states to 7742 states and 9070 transitions. [2019-10-02 01:22:06,747 INFO L78 Accepts]: Start accepts. Automaton has 7742 states and 9070 transitions. Word has length 739 [2019-10-02 01:22:06,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:22:06,748 INFO L475 AbstractCegarLoop]: Abstraction has 7742 states and 9070 transitions. [2019-10-02 01:22:06,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 01:22:06,749 INFO L276 IsEmpty]: Start isEmpty. Operand 7742 states and 9070 transitions. [2019-10-02 01:22:06,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 845 [2019-10-02 01:22:06,782 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:22:06,783 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:22:06,784 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:22:06,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:22:06,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1327026731, now seen corresponding path program 1 times [2019-10-02 01:22:06,786 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:22:06,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:22:06,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:22:06,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:22:06,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:22:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:22:10,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2076 backedges. 680 proven. 1107 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-10-02 01:22:10,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:22:10,115 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:22:10,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:22:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:22:10,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 1179 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:22:10,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:22:11,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2076 backedges. 1361 proven. 2 refuted. 0 times theorem prover too weak. 713 trivial. 0 not checked. [2019-10-02 01:22:11,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:22:11,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 5] total 21 [2019-10-02 01:22:11,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 01:22:11,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 01:22:11,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2019-10-02 01:22:11,179 INFO L87 Difference]: Start difference. First operand 7742 states and 9070 transitions. Second operand 21 states. [2019-10-02 01:22:17,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:22:17,951 INFO L93 Difference]: Finished difference Result 17838 states and 21156 transitions. [2019-10-02 01:22:17,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-02 01:22:17,952 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 844 [2019-10-02 01:22:17,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:22:17,997 INFO L225 Difference]: With dead ends: 17838 [2019-10-02 01:22:17,997 INFO L226 Difference]: Without dead ends: 10286 [2019-10-02 01:22:18,018 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 923 GetRequests, 867 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 869 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=635, Invalid=2671, Unknown=0, NotChecked=0, Total=3306 [2019-10-02 01:22:18,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10286 states. [2019-10-02 01:22:18,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10286 to 9016. [2019-10-02 01:22:18,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9016 states. [2019-10-02 01:22:18,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9016 states to 9016 states and 9999 transitions. [2019-10-02 01:22:18,234 INFO L78 Accepts]: Start accepts. Automaton has 9016 states and 9999 transitions. Word has length 844 [2019-10-02 01:22:18,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:22:18,235 INFO L475 AbstractCegarLoop]: Abstraction has 9016 states and 9999 transitions. [2019-10-02 01:22:18,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 01:22:18,235 INFO L276 IsEmpty]: Start isEmpty. Operand 9016 states and 9999 transitions. [2019-10-02 01:22:18,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 899 [2019-10-02 01:22:18,267 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:22:18,267 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 01:22:18,268 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:22:18,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:22:18,268 INFO L82 PathProgramCache]: Analyzing trace with hash -37663379, now seen corresponding path program 1 times [2019-10-02 01:22:18,268 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:22:18,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:22:18,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:22:18,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:22:18,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:22:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:22:20,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 953 proven. 518 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2019-10-02 01:22:20,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:22:20,927 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:22:20,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:22:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:22:21,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 1236 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 01:22:21,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:22:21,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 1463 proven. 2 refuted. 0 times theorem prover too weak. 720 trivial. 0 not checked. [2019-10-02 01:22:21,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:22:21,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 18 [2019-10-02 01:22:21,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 01:22:21,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 01:22:21,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2019-10-02 01:22:21,684 INFO L87 Difference]: Start difference. First operand 9016 states and 9999 transitions. Second operand 18 states. [2019-10-02 01:22:31,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:22:31,437 INFO L93 Difference]: Finished difference Result 17326 states and 20058 transitions. [2019-10-02 01:22:31,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-02 01:22:31,438 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 898 [2019-10-02 01:22:31,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:22:31,439 INFO L225 Difference]: With dead ends: 17326 [2019-10-02 01:22:31,439 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 01:22:31,477 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1008 GetRequests, 937 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1567 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=960, Invalid=4296, Unknown=0, NotChecked=0, Total=5256 [2019-10-02 01:22:31,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 01:22:31,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 01:22:31,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 01:22:31,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 01:22:31,478 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 898 [2019-10-02 01:22:31,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:22:31,479 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 01:22:31,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 01:22:31,479 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 01:22:31,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 01:22:31,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 01:22:34,759 WARN L191 SmtUtils]: Spent 2.81 s on a formula simplification. DAG size of input: 684 DAG size of output: 590 [2019-10-02 01:22:36,754 WARN L191 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 684 DAG size of output: 590 [2019-10-02 01:22:37,810 WARN L191 SmtUtils]: Spent 953.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 63 [2019-10-02 01:22:43,226 WARN L191 SmtUtils]: Spent 5.39 s on a formula simplification. DAG size of input: 569 DAG size of output: 72 [2019-10-02 01:22:48,698 WARN L191 SmtUtils]: Spent 5.47 s on a formula simplification. DAG size of input: 569 DAG size of output: 72 [2019-10-02 01:22:48,701 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 01:22:48,701 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a12~0 |old(~a12~0)|) (= ~a24~0 |old(~a24~0)|) (= ~a21~0 |old(~a21~0)|) (= ~a15~0 |old(~a15~0)|)) [2019-10-02 01:22:48,702 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 01:22:48,702 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 199) no Hoare annotation was computed. [2019-10-02 01:22:48,702 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-10-02 01:22:48,702 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-10-02 01:22:48,702 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,703 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,703 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,703 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-10-02 01:22:48,703 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-10-02 01:22:48,703 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-10-02 01:22:48,703 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-10-02 01:22:48,703 INFO L443 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-10-02 01:22:48,704 INFO L443 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-10-02 01:22:48,704 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-10-02 01:22:48,704 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-10-02 01:22:48,704 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,704 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,704 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,704 INFO L443 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-10-02 01:22:48,704 INFO L443 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-10-02 01:22:48,705 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-02 01:22:48,705 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-10-02 01:22:48,705 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-10-02 01:22:48,705 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-10-02 01:22:48,705 INFO L443 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-10-02 01:22:48,705 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-10-02 01:22:48,705 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,705 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,706 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,706 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-10-02 01:22:48,706 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-10-02 01:22:48,706 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-10-02 01:22:48,706 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-10-02 01:22:48,706 INFO L443 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-10-02 01:22:48,706 INFO L443 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-10-02 01:22:48,707 INFO L443 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-10-02 01:22:48,707 INFO L443 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-10-02 01:22:48,707 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-10-02 01:22:48,707 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,707 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,707 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,707 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-10-02 01:22:48,707 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-10-02 01:22:48,707 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-10-02 01:22:48,708 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-10-02 01:22:48,708 INFO L443 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-10-02 01:22:48,708 INFO L443 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-10-02 01:22:48,708 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-10-02 01:22:48,708 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,708 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,708 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,708 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-10-02 01:22:48,709 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-10-02 01:22:48,709 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-10-02 01:22:48,709 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-10-02 01:22:48,709 INFO L443 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-10-02 01:22:48,709 INFO L443 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-10-02 01:22:48,709 INFO L443 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-10-02 01:22:48,709 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-10-02 01:22:48,709 INFO L443 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-10-02 01:22:48,710 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,710 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,710 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,710 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,710 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-10-02 01:22:48,710 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-10-02 01:22:48,710 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-10-02 01:22:48,710 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-10-02 01:22:48,710 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-10-02 01:22:48,711 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-10-02 01:22:48,711 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-10-02 01:22:48,711 INFO L443 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-10-02 01:22:48,711 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,711 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,711 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,711 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-10-02 01:22:48,711 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-10-02 01:22:48,711 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-10-02 01:22:48,712 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-10-02 01:22:48,712 INFO L443 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-10-02 01:22:48,712 INFO L443 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-10-02 01:22:48,712 INFO L443 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-10-02 01:22:48,712 INFO L443 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-10-02 01:22:48,712 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,712 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,712 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,713 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-10-02 01:22:48,713 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-10-02 01:22:48,713 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-10-02 01:22:48,713 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-10-02 01:22:48,713 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-10-02 01:22:48,713 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-10-02 01:22:48,714 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 872) the Hoare annotation is: (let ((.cse8 (= 7 |old(~a21~0)|)) (.cse7 (= ~a24~0 1)) (.cse5 (= ~a12~0 |old(~a12~0)|)) (.cse6 (= ~a21~0 |old(~a21~0)|)) (.cse9 (= ~a15~0 |old(~a15~0)|))) (let ((.cse1 (and .cse5 (= ~a24~0 |old(~a24~0)|) .cse6 .cse9)) (.cse2 (and .cse5 .cse9 .cse7 (= ~a21~0 7))) (.cse3 (not .cse8)) (.cse4 (not (= 1 |old(~a24~0)|))) (.cse0 (= 9 |old(~a15~0)|))) (and (or (not (= 6 |old(~a21~0)|)) (or (not (<= (+ |old(~a12~0)| 49) 0)) .cse0) .cse1) (or .cse2 .cse3 (not (<= |old(~a12~0)| 76)) .cse4 .cse0) (or (and .cse5 .cse6 .cse7 (= ~a15~0 9)) (not .cse0) .cse4 (not (= 8 |old(~a21~0)|))) (or (not (<= 9 |old(~a15~0)|)) .cse1 .cse4 (not (< 80 |old(~a12~0)|))) (or (= 9 |old(~a21~0)|) .cse8 .cse4 (not (<= |old(~a12~0)| 11)) (and .cse5 .cse6 .cse9 .cse7)) (or (or .cse8 .cse0) .cse4 .cse1) (or .cse2 .cse3 (= 5 |old(~a15~0)|) .cse4 .cse0)))) [2019-10-02 01:22:48,714 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-10-02 01:22:48,714 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-10-02 01:22:48,714 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,714 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,714 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,714 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-10-02 01:22:48,715 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-10-02 01:22:48,715 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-10-02 01:22:48,715 INFO L443 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-10-02 01:22:48,715 INFO L443 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-10-02 01:22:48,715 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-10-02 01:22:48,715 INFO L443 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-10-02 01:22:48,715 INFO L443 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-10-02 01:22:48,715 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,715 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,716 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,716 INFO L443 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-10-02 01:22:48,716 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-10-02 01:22:48,716 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-10-02 01:22:48,716 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-10-02 01:22:48,716 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-10-02 01:22:48,716 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-10-02 01:22:48,716 INFO L443 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-10-02 01:22:48,716 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-10-02 01:22:48,717 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,717 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,717 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,717 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-10-02 01:22:48,717 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-10-02 01:22:48,717 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-10-02 01:22:48,717 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-10-02 01:22:48,717 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-10-02 01:22:48,718 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-10-02 01:22:48,718 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-10-02 01:22:48,718 INFO L443 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-10-02 01:22:48,718 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,718 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,718 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,718 INFO L443 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-10-02 01:22:48,718 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-10-02 01:22:48,719 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-10-02 01:22:48,719 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-10-02 01:22:48,719 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-10-02 01:22:48,719 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-10-02 01:22:48,719 INFO L443 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-10-02 01:22:48,719 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-10-02 01:22:48,719 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,719 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,719 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-10-02 01:22:48,720 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-10-02 01:22:48,720 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-10-02 01:22:48,720 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-10-02 01:22:48,720 INFO L443 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-10-02 01:22:48,720 INFO L443 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-10-02 01:22:48,720 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-10-02 01:22:48,720 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-10-02 01:22:48,720 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,720 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,721 INFO L443 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-10-02 01:22:48,721 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-10-02 01:22:48,721 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-10-02 01:22:48,721 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-10-02 01:22:48,721 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-10-02 01:22:48,721 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-10-02 01:22:48,721 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,721 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,721 INFO L443 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-10-02 01:22:48,722 INFO L443 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-10-02 01:22:48,722 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-10-02 01:22:48,722 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-10-02 01:22:48,722 INFO L443 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-10-02 01:22:48,722 INFO L443 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-10-02 01:22:48,722 INFO L443 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-10-02 01:22:48,722 INFO L443 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-10-02 01:22:48,722 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,723 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,723 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-10-02 01:22:48,723 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-10-02 01:22:48,723 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-10-02 01:22:48,723 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-10-02 01:22:48,723 INFO L443 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-10-02 01:22:48,723 INFO L443 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-10-02 01:22:48,723 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-10-02 01:22:48,724 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,724 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,724 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,724 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-10-02 01:22:48,724 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-10-02 01:22:48,724 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-10-02 01:22:48,724 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-10-02 01:22:48,724 INFO L443 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-10-02 01:22:48,724 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-10-02 01:22:48,725 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,725 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,725 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-10-02 01:22:48,725 INFO L443 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,725 INFO L443 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-10-02 01:22:48,725 INFO L443 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-10-02 01:22:48,725 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-10-02 01:22:48,725 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-10-02 01:22:48,726 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-10-02 01:22:48,726 INFO L443 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-10-02 01:22:48,726 INFO L443 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-10-02 01:22:48,726 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-10-02 01:22:48,726 INFO L443 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-10-02 01:22:48,726 INFO L443 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-10-02 01:22:48,726 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,726 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,726 INFO L443 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,726 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-10-02 01:22:48,727 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-10-02 01:22:48,727 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-10-02 01:22:48,727 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-10-02 01:22:48,727 INFO L443 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-10-02 01:22:48,727 INFO L443 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-10-02 01:22:48,727 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-10-02 01:22:48,727 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-10-02 01:22:48,727 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,727 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,728 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,728 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-10-02 01:22:48,728 INFO L443 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-10-02 01:22:48,728 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-10-02 01:22:48,728 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-10-02 01:22:48,728 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-10-02 01:22:48,728 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-10-02 01:22:48,728 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-10-02 01:22:48,728 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-10-02 01:22:48,729 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,729 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,729 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,729 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-10-02 01:22:48,729 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-10-02 01:22:48,729 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-10-02 01:22:48,729 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-10-02 01:22:48,729 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-10-02 01:22:48,729 INFO L443 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-10-02 01:22:48,730 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-10-02 01:22:48,730 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-10-02 01:22:48,730 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-10-02 01:22:48,730 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,730 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,730 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:22:48,730 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-10-02 01:22:48,730 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-10-02 01:22:48,730 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-02 01:22:48,731 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-10-02 01:22:48,731 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-10-02 01:22:48,731 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 01:22:48,731 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a24~0 1) (= ~a21~0 7) (not (= 9 ~a15~0)) (<= (+ ~a12~0 49) 0) (not (= 5 ~a15~0))) [2019-10-02 01:22:48,731 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 01:22:48,731 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 01:22:48,732 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 874 890) the Hoare annotation is: (or (not (= 7 |old(~a21~0)|)) (= 5 |old(~a15~0)|) (not (<= (+ |old(~a12~0)| 49) 0)) (not (= 1 |old(~a24~0)|)) (and (= ~a12~0 |old(~a12~0)|) (= ~a15~0 |old(~a15~0)|) (= ~a24~0 1) (= ~a21~0 7)) (= 9 |old(~a15~0)|)) [2019-10-02 01:22:48,732 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 874 890) no Hoare annotation was computed. [2019-10-02 01:22:48,732 INFO L439 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (let ((.cse1 (= ~a21~0 7))) (let ((.cse2 (= ~a21~0 6)) (.cse5 (= ~a24~0 |old(~a24~0)|)) (.cse0 (= ~a24~0 1)) (.cse4 (not (= 9 ~a15~0))) (.cse6 (not .cse1)) (.cse3 (<= |old(~a15~0)| 8))) (or (and (= ~a12~0 |old(~a12~0)|) (= ~a15~0 |old(~a15~0)|) .cse0 .cse1) (and .cse2 .cse3 .cse4 (<= (+ ~a12~0 49) 0)) (and .cse3 (and .cse0 .cse4 (not (= 5 ~a15~0)))) (not (= 7 |old(~a21~0)|)) (not (<= (+ |old(~a12~0)| 49) 0)) (and .cse3 (and .cse5 (< 80 ~a12~0)) (<= 9 ~a15~0)) (= 9 |old(~a15~0)|) (not (= 1 |old(~a24~0)|)) (= 5 |old(~a15~0)|) (and .cse3 .cse5 (= ~a21~0 8)) (and (and (<= (+ ~a12~0 43) 0) .cse2) .cse5 (= ~a15~0 5)) (and (and .cse0 .cse4) (<= ~a12~0 76) .cse3) (and (and (and .cse0 (and (not (= ~a21~0 9)) .cse6)) (<= ~a12~0 11)) .cse3) (and (and .cse0 (and .cse4 .cse6)) .cse3)))) [2019-10-02 01:22:48,732 INFO L443 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2019-10-02 01:22:48,732 INFO L443 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2019-10-02 01:22:48,733 INFO L439 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse1 (= ~a21~0 7))) (let ((.cse2 (= ~a21~0 6)) (.cse5 (= ~a24~0 |old(~a24~0)|)) (.cse0 (= ~a24~0 1)) (.cse4 (not (= 9 ~a15~0))) (.cse6 (not .cse1)) (.cse3 (<= |old(~a15~0)| 8))) (or (and (= ~a12~0 |old(~a12~0)|) (= ~a15~0 |old(~a15~0)|) .cse0 .cse1) (and .cse2 .cse3 .cse4 (<= (+ ~a12~0 49) 0)) (and .cse3 (and .cse0 .cse4 (not (= 5 ~a15~0)))) (not (= 7 |old(~a21~0)|)) (not (<= (+ |old(~a12~0)| 49) 0)) (and .cse3 (and .cse5 (< 80 ~a12~0)) (<= 9 ~a15~0)) (= 9 |old(~a15~0)|) (not (= 1 |old(~a24~0)|)) (= 5 |old(~a15~0)|) (and .cse3 .cse5 (= ~a21~0 8)) (and (and (<= (+ ~a12~0 43) 0) .cse2) .cse5 (= ~a15~0 5)) (and (and .cse0 .cse4) (<= ~a12~0 76) .cse3) (and (and (and .cse0 (and (not (= ~a21~0 9)) .cse6)) (<= ~a12~0 11)) .cse3) (and (and .cse0 (and .cse4 .cse6)) .cse3)))) [2019-10-02 01:22:48,733 INFO L443 ceAbstractionStarter]: For program point L880-3(lines 874 890) no Hoare annotation was computed. [2019-10-02 01:22:48,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 01:22:48 BoogieIcfgContainer [2019-10-02 01:22:48,754 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 01:22:48,756 INFO L168 Benchmark]: Toolchain (without parser) took 79964.27 ms. Allocated memory was 132.1 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 85.8 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-10-02 01:22:48,757 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 132.1 MB. Free memory was 106.3 MB in the beginning and 106.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 01:22:48,758 INFO L168 Benchmark]: CACSL2BoogieTranslator took 840.25 ms. Allocated memory was 132.1 MB in the beginning and 201.3 MB in the end (delta: 69.2 MB). Free memory was 85.6 MB in the beginning and 152.6 MB in the end (delta: -67.0 MB). Peak memory consumption was 30.8 MB. Max. memory is 7.1 GB. [2019-10-02 01:22:48,759 INFO L168 Benchmark]: Boogie Preprocessor took 169.08 ms. Allocated memory is still 201.3 MB. Free memory was 152.6 MB in the beginning and 147.3 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 7.1 GB. [2019-10-02 01:22:48,760 INFO L168 Benchmark]: RCFGBuilder took 1772.53 ms. Allocated memory was 201.3 MB in the beginning and 223.3 MB in the end (delta: 22.0 MB). Free memory was 147.3 MB in the beginning and 140.6 MB in the end (delta: 6.7 MB). Peak memory consumption was 80.7 MB. Max. memory is 7.1 GB. [2019-10-02 01:22:48,761 INFO L168 Benchmark]: TraceAbstraction took 77177.87 ms. Allocated memory was 223.3 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 140.6 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-10-02 01:22:48,765 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41 ms. Allocated memory is still 132.1 MB. Free memory was 106.3 MB in the beginning and 106.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 840.25 ms. Allocated memory was 132.1 MB in the beginning and 201.3 MB in the end (delta: 69.2 MB). Free memory was 85.6 MB in the beginning and 152.6 MB in the end (delta: -67.0 MB). Peak memory consumption was 30.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 169.08 ms. Allocated memory is still 201.3 MB. Free memory was 152.6 MB in the beginning and 147.3 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1772.53 ms. Allocated memory was 201.3 MB in the beginning and 223.3 MB in the end (delta: 22.0 MB). Free memory was 147.3 MB in the beginning and 140.6 MB in the end (delta: 6.7 MB). Peak memory consumption was 80.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 77177.87 ms. Allocated memory was 223.3 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 140.6 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 199]: 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: 880]: Loop Invariant Derived loop invariant: (((((((((((((((a12 == \old(a12) && a15 == \old(a15)) && a24 == 1) && a21 == 7) || (((a21 == 6 && \old(a15) <= 8) && !(9 == a15)) && a12 + 49 <= 0)) || (\old(a15) <= 8 && (a24 == 1 && !(9 == a15)) && !(5 == a15))) || !(7 == \old(a21))) || !(\old(a12) + 49 <= 0)) || ((\old(a15) <= 8 && a24 == \old(a24) && 80 < a12) && 9 <= a15)) || 9 == \old(a15)) || !(1 == \old(a24))) || 5 == \old(a15)) || ((\old(a15) <= 8 && a24 == \old(a24)) && a21 == 8)) || (((a12 + 43 <= 0 && a21 == 6) && a24 == \old(a24)) && a15 == 5)) || (((a24 == 1 && !(9 == a15)) && a12 <= 76) && \old(a15) <= 8)) || (((a24 == 1 && !(a21 == 9) && !(a21 == 7)) && a12 <= 11) && \old(a15) <= 8)) || ((a24 == 1 && !(9 == a15) && !(a21 == 7)) && \old(a15) <= 8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 254 locations, 1 error locations. SAFE Result, 77.0s OverallTime, 12 OverallIterations, 7 TraceHistogramMax, 40.6s AutomataDifference, 0.0s DeadEndRemovalTime, 17.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 601 SDtfs, 16001 SDslu, 1196 SDs, 0 SdLazy, 23805 SolverSat, 4522 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 25.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5140 GetRequests, 4854 SyntacticMatches, 3 SemanticMatches, 283 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3711 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9016occurred in iteration=11, 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: 1.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 3566 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 409 PreInvPairs, 671 NumberOfFragments, 577 HoareAnnotationTreeSize, 409 FomulaSimplifications, 1010363 FormulaSimplificationTreeSizeReduction, 5.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 354757 FormulaSimplificationTreeSizeReductionInter, 11.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 10168 NumberOfCodeBlocks, 10168 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 10149 ConstructedInterpolants, 0 QuantifiedInterpolants, 30543621 SizeOfPredicates, 5 NumberOfNonLiveVariables, 6730 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 19 InterpolantComputations, 6 PerfectInterpolantSequences, 16943/19823 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...