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/Problem02_label48.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 00:47:59,753 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 00:47:59,755 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 00:47:59,767 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 00:47:59,768 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 00:47:59,769 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 00:47:59,770 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 00:47:59,772 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 00:47:59,774 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 00:47:59,775 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 00:47:59,776 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 00:47:59,777 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 00:47:59,777 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 00:47:59,778 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 00:47:59,779 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 00:47:59,780 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 00:47:59,781 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 00:47:59,782 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 00:47:59,784 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 00:47:59,786 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 00:47:59,788 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 00:47:59,789 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 00:47:59,790 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 00:47:59,791 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 00:47:59,793 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 00:47:59,794 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 00:47:59,794 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 00:47:59,795 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 00:47:59,796 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 00:47:59,797 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 00:47:59,797 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 00:47:59,798 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 00:47:59,799 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 00:47:59,800 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 00:47:59,801 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 00:47:59,801 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 00:47:59,802 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 00:47:59,802 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 00:47:59,802 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 00:47:59,803 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 00:47:59,804 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 00:47:59,805 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 00:47:59,820 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 00:47:59,821 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 00:47:59,822 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 00:47:59,822 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 00:47:59,822 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 00:47:59,823 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 00:47:59,823 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 00:47:59,823 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 00:47:59,823 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 00:47:59,823 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 00:47:59,824 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 00:47:59,824 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 00:47:59,824 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 00:47:59,824 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 00:47:59,824 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 00:47:59,824 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 00:47:59,825 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 00:47:59,825 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 00:47:59,825 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 00:47:59,825 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 00:47:59,825 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 00:47:59,826 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 00:47:59,826 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 00:47:59,826 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 00:47:59,826 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 00:47:59,827 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 00:47:59,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 00:47:59,827 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 00:47:59,827 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 00:47:59,855 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 00:47:59,867 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 00:47:59,871 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 00:47:59,872 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 00:47:59,872 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 00:47:59,873 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label48.c [2019-10-02 00:47:59,935 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c97a5aca/cdbb1e3b6a254402863690562a8d34d7/FLAG96297ca0b [2019-10-02 00:48:00,479 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 00:48:00,480 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label48.c [2019-10-02 00:48:00,497 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c97a5aca/cdbb1e3b6a254402863690562a8d34d7/FLAG96297ca0b [2019-10-02 00:48:00,696 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c97a5aca/cdbb1e3b6a254402863690562a8d34d7 [2019-10-02 00:48:00,708 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 00:48:00,709 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 00:48:00,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 00:48:00,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 00:48:00,715 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 00:48:00,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:48:00" (1/1) ... [2019-10-02 00:48:00,719 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f5f647f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:00, skipping insertion in model container [2019-10-02 00:48:00,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:48:00" (1/1) ... [2019-10-02 00:48:00,728 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 00:48:00,802 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 00:48:01,361 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:48:01,369 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 00:48:01,560 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:48:01,579 INFO L192 MainTranslator]: Completed translation [2019-10-02 00:48:01,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:01 WrapperNode [2019-10-02 00:48:01,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 00:48:01,581 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 00:48:01,581 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 00:48:01,581 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 00:48:01,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:01" (1/1) ... [2019-10-02 00:48:01,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:01" (1/1) ... [2019-10-02 00:48:01,615 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:01" (1/1) ... [2019-10-02 00:48:01,615 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:01" (1/1) ... [2019-10-02 00:48:01,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:01" (1/1) ... [2019-10-02 00:48:01,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:01" (1/1) ... [2019-10-02 00:48:01,701 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:01" (1/1) ... [2019-10-02 00:48:01,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 00:48:01,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 00:48:01,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 00:48:01,719 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 00:48:01,721 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:01" (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 00:48:01,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 00:48:01,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 00:48:01,794 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 00:48:01,794 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 00:48:01,795 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 00:48:01,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 00:48:01,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 00:48:01,796 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 00:48:01,797 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 00:48:01,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 00:48:01,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 00:48:02,947 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 00:48:02,947 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 00:48:02,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:48:02 BoogieIcfgContainer [2019-10-02 00:48:02,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 00:48:02,950 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 00:48:02,950 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 00:48:02,953 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 00:48:02,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:48:00" (1/3) ... [2019-10-02 00:48:02,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a0dc34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:48:02, skipping insertion in model container [2019-10-02 00:48:02,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:48:01" (2/3) ... [2019-10-02 00:48:02,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a0dc34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:48:02, skipping insertion in model container [2019-10-02 00:48:02,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:48:02" (3/3) ... [2019-10-02 00:48:02,957 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label48.c [2019-10-02 00:48:02,967 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 00:48:02,976 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 00:48:02,994 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 00:48:03,028 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 00:48:03,028 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 00:48:03,029 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 00:48:03,029 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 00:48:03,029 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 00:48:03,030 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 00:48:03,030 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 00:48:03,030 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 00:48:03,030 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 00:48:03,054 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-10-02 00:48:03,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 00:48:03,070 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:03,071 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:48:03,073 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:03,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:03,080 INFO L82 PathProgramCache]: Analyzing trace with hash 231210793, now seen corresponding path program 1 times [2019-10-02 00:48:03,081 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:03,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:03,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:03,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:03,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:03,612 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 00:48:03,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:48:03,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 00:48:03,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 00:48:03,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 00:48:03,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:48:03,640 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2019-10-02 00:48:04,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:04,563 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2019-10-02 00:48:04,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 00:48:04,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-10-02 00:48:04,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:04,592 INFO L225 Difference]: With dead ends: 618 [2019-10-02 00:48:04,593 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 00:48:04,605 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 00:48:04,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 00:48:04,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 00:48:04,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 00:48:04,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 465 transitions. [2019-10-02 00:48:04,674 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 465 transitions. Word has length 143 [2019-10-02 00:48:04,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:04,676 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 465 transitions. [2019-10-02 00:48:04,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 00:48:04,676 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 465 transitions. [2019-10-02 00:48:04,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-02 00:48:04,682 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:04,683 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:48:04,683 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:04,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:04,684 INFO L82 PathProgramCache]: Analyzing trace with hash 703690926, now seen corresponding path program 1 times [2019-10-02 00:48:04,684 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:04,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:04,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:04,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:04,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:05,056 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:05,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:48:05,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:48:05,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:48:05,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:48:05,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:48:05,059 INFO L87 Difference]: Start difference. First operand 320 states and 465 transitions. Second operand 5 states. [2019-10-02 00:48:05,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:05,781 INFO L93 Difference]: Finished difference Result 721 states and 1089 transitions. [2019-10-02 00:48:05,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:48:05,786 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2019-10-02 00:48:05,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:05,789 INFO L225 Difference]: With dead ends: 721 [2019-10-02 00:48:05,789 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 00:48:05,791 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:48:05,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 00:48:05,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 00:48:05,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 00:48:05,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 461 transitions. [2019-10-02 00:48:05,814 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 461 transitions. Word has length 151 [2019-10-02 00:48:05,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:05,815 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 461 transitions. [2019-10-02 00:48:05,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:48:05,815 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 461 transitions. [2019-10-02 00:48:05,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-02 00:48:05,819 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:05,819 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:48:05,820 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:05,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:05,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1665282438, now seen corresponding path program 1 times [2019-10-02 00:48:05,820 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:05,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:05,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:05,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:05,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:06,183 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:06,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:48:06,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:48:06,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:48:06,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:48:06,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:48:06,185 INFO L87 Difference]: Start difference. First operand 320 states and 461 transitions. Second operand 5 states. [2019-10-02 00:48:06,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:06,942 INFO L93 Difference]: Finished difference Result 717 states and 1075 transitions. [2019-10-02 00:48:06,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:48:06,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-10-02 00:48:06,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:06,947 INFO L225 Difference]: With dead ends: 717 [2019-10-02 00:48:06,947 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 00:48:06,949 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:48:06,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 00:48:06,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 00:48:06,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 00:48:06,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 455 transitions. [2019-10-02 00:48:06,970 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 455 transitions. Word has length 157 [2019-10-02 00:48:06,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:06,970 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 455 transitions. [2019-10-02 00:48:06,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:48:06,971 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 455 transitions. [2019-10-02 00:48:06,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-02 00:48:06,974 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:06,975 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:48:06,975 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:06,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:06,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1117544721, now seen corresponding path program 1 times [2019-10-02 00:48:06,976 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:06,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:06,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:06,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:06,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:07,094 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:07,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:48:07,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 00:48:07,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 00:48:07,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 00:48:07,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 00:48:07,097 INFO L87 Difference]: Start difference. First operand 320 states and 455 transitions. Second operand 6 states. [2019-10-02 00:48:07,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:07,946 INFO L93 Difference]: Finished difference Result 951 states and 1383 transitions. [2019-10-02 00:48:07,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 00:48:07,950 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2019-10-02 00:48:07,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:07,954 INFO L225 Difference]: With dead ends: 951 [2019-10-02 00:48:07,955 INFO L226 Difference]: Without dead ends: 637 [2019-10-02 00:48:07,956 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 00:48:07,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-02 00:48:07,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 626. [2019-10-02 00:48:07,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 00:48:07,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 871 transitions. [2019-10-02 00:48:07,993 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 871 transitions. Word has length 165 [2019-10-02 00:48:07,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:07,994 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 871 transitions. [2019-10-02 00:48:07,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 00:48:07,994 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 871 transitions. [2019-10-02 00:48:07,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 00:48:07,998 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:07,998 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:48:07,999 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:07,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:07,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1318962261, now seen corresponding path program 1 times [2019-10-02 00:48:07,999 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:07,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:08,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:08,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:08,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:08,206 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:08,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:48:08,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:48:08,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:48:08,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:48:08,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:48:08,208 INFO L87 Difference]: Start difference. First operand 626 states and 871 transitions. Second operand 5 states. [2019-10-02 00:48:08,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:08,884 INFO L93 Difference]: Finished difference Result 1330 states and 1903 transitions. [2019-10-02 00:48:08,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:48:08,885 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 167 [2019-10-02 00:48:08,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:08,890 INFO L225 Difference]: With dead ends: 1330 [2019-10-02 00:48:08,890 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 00:48:08,893 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:48:08,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 00:48:08,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 00:48:08,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 00:48:08,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 859 transitions. [2019-10-02 00:48:08,918 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 859 transitions. Word has length 167 [2019-10-02 00:48:08,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:08,918 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 859 transitions. [2019-10-02 00:48:08,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:48:08,918 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 859 transitions. [2019-10-02 00:48:08,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-02 00:48:08,922 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:08,922 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:48:08,922 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:08,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:08,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1177950311, now seen corresponding path program 1 times [2019-10-02 00:48:08,923 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:08,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:08,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:08,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:08,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:09,156 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:09,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:48:09,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:48:09,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:48:09,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:48:09,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:48:09,159 INFO L87 Difference]: Start difference. First operand 626 states and 859 transitions. Second operand 5 states. [2019-10-02 00:48:09,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:09,854 INFO L93 Difference]: Finished difference Result 1332 states and 1878 transitions. [2019-10-02 00:48:09,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:48:09,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2019-10-02 00:48:09,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:09,858 INFO L225 Difference]: With dead ends: 1332 [2019-10-02 00:48:09,859 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 00:48:09,861 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:48:09,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 00:48:09,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 00:48:09,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 00:48:09,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 843 transitions. [2019-10-02 00:48:09,887 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 843 transitions. Word has length 169 [2019-10-02 00:48:09,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:09,887 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 843 transitions. [2019-10-02 00:48:09,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:48:09,888 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 843 transitions. [2019-10-02 00:48:09,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-02 00:48:09,892 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:09,893 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:48:09,893 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:09,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:09,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1524788769, now seen corresponding path program 1 times [2019-10-02 00:48:09,894 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:09,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:09,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:09,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:09,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:10,010 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:10,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:48:10,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 00:48:10,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 00:48:10,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 00:48:10,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 00:48:10,013 INFO L87 Difference]: Start difference. First operand 626 states and 843 transitions. Second operand 6 states. [2019-10-02 00:48:11,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:11,020 INFO L93 Difference]: Finished difference Result 1858 states and 2601 transitions. [2019-10-02 00:48:11,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 00:48:11,023 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 173 [2019-10-02 00:48:11,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:11,035 INFO L225 Difference]: With dead ends: 1858 [2019-10-02 00:48:11,035 INFO L226 Difference]: Without dead ends: 1238 [2019-10-02 00:48:11,037 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 00:48:11,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2019-10-02 00:48:11,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1218. [2019-10-02 00:48:11,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-10-02 00:48:11,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1637 transitions. [2019-10-02 00:48:11,098 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1637 transitions. Word has length 173 [2019-10-02 00:48:11,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:11,100 INFO L475 AbstractCegarLoop]: Abstraction has 1218 states and 1637 transitions. [2019-10-02 00:48:11,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 00:48:11,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1637 transitions. [2019-10-02 00:48:11,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 00:48:11,105 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:11,106 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:48:11,106 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:11,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:11,106 INFO L82 PathProgramCache]: Analyzing trace with hash 689826632, now seen corresponding path program 1 times [2019-10-02 00:48:11,107 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:11,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:11,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:11,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:11,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:11,361 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 25 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:11,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:48:11,361 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 00:48:11,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:11,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 00:48:11,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:48:11,590 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-10-02 00:48:11,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 00:48:11,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2019-10-02 00:48:11,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 00:48:11,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 00:48:11,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-02 00:48:11,599 INFO L87 Difference]: Start difference. First operand 1218 states and 1637 transitions. Second operand 10 states. [2019-10-02 00:48:13,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:13,647 INFO L93 Difference]: Finished difference Result 3725 states and 5739 transitions. [2019-10-02 00:48:13,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 00:48:13,648 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 178 [2019-10-02 00:48:13,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:13,663 INFO L225 Difference]: With dead ends: 3725 [2019-10-02 00:48:13,663 INFO L226 Difference]: Without dead ends: 1749 [2019-10-02 00:48:13,672 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-10-02 00:48:13,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1749 states. [2019-10-02 00:48:13,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1749 to 1732. [2019-10-02 00:48:13,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1732 states. [2019-10-02 00:48:13,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2603 transitions. [2019-10-02 00:48:13,787 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 2603 transitions. Word has length 178 [2019-10-02 00:48:13,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:13,787 INFO L475 AbstractCegarLoop]: Abstraction has 1732 states and 2603 transitions. [2019-10-02 00:48:13,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 00:48:13,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2603 transitions. [2019-10-02 00:48:13,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-02 00:48:13,805 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:13,805 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:48:13,806 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:13,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:13,806 INFO L82 PathProgramCache]: Analyzing trace with hash -865565521, now seen corresponding path program 1 times [2019-10-02 00:48:13,806 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:13,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:13,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:13,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:13,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:13,968 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 70 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:13,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:48:13,969 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 00:48:14,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:14,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 00:48:14,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:48:14,214 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-02 00:48:14,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 00:48:14,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-02 00:48:14,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 00:48:14,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 00:48:14,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 00:48:14,228 INFO L87 Difference]: Start difference. First operand 1732 states and 2603 transitions. Second operand 7 states. [2019-10-02 00:48:15,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:15,545 INFO L93 Difference]: Finished difference Result 4590 states and 6581 transitions. [2019-10-02 00:48:15,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 00:48:15,545 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 210 [2019-10-02 00:48:15,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:15,562 INFO L225 Difference]: With dead ends: 4590 [2019-10-02 00:48:15,562 INFO L226 Difference]: Without dead ends: 2864 [2019-10-02 00:48:15,573 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-10-02 00:48:15,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2864 states. [2019-10-02 00:48:15,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2864 to 2398. [2019-10-02 00:48:15,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2398 states. [2019-10-02 00:48:15,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2398 states and 2925 transitions. [2019-10-02 00:48:15,671 INFO L78 Accepts]: Start accepts. Automaton has 2398 states and 2925 transitions. Word has length 210 [2019-10-02 00:48:15,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:15,671 INFO L475 AbstractCegarLoop]: Abstraction has 2398 states and 2925 transitions. [2019-10-02 00:48:15,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 00:48:15,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 2925 transitions. [2019-10-02 00:48:15,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-02 00:48:15,683 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:48:15,684 INFO L411 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:48:15,684 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:48:15,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:48:15,684 INFO L82 PathProgramCache]: Analyzing trace with hash 848190709, now seen corresponding path program 1 times [2019-10-02 00:48:15,685 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:48:15,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:48:15,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:15,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:15,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:48:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:16,194 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 66 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:48:16,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:48:16,195 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 00:48:16,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:48:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:48:16,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 00:48:16,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:48:16,353 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 00:48:16,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 00:48:16,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2019-10-02 00:48:16,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 00:48:16,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 00:48:16,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-02 00:48:16,368 INFO L87 Difference]: Start difference. First operand 2398 states and 2925 transitions. Second operand 10 states. [2019-10-02 00:48:16,498 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-10-02 00:48:19,102 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-10-02 00:48:20,030 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-10-02 00:48:20,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:20,401 INFO L93 Difference]: Finished difference Result 5533 states and 6798 transitions. [2019-10-02 00:48:20,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 00:48:20,401 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 225 [2019-10-02 00:48:20,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:20,402 INFO L225 Difference]: With dead ends: 5533 [2019-10-02 00:48:20,402 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 00:48:20,414 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 242 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 00:48:20,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 00:48:20,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 00:48:20,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 00:48:20,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 00:48:20,415 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 225 [2019-10-02 00:48:20,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:20,416 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 00:48:20,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 00:48:20,416 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 00:48:20,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 00:48:20,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 00:48:21,548 WARN L191 SmtUtils]: Spent 756.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 65 [2019-10-02 00:48:22,055 WARN L191 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 71 [2019-10-02 00:48:22,560 WARN L191 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 71 [2019-10-02 00:48:22,562 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 00:48:22,563 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a11~0 |old(~a11~0)|) (= ~a17~0 |old(~a17~0)|) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) [2019-10-02 00:48:22,563 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 00:48:22,563 INFO L443 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,563 INFO L443 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,563 INFO L443 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,563 INFO L443 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,563 INFO L443 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,564 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-10-02 00:48:22,564 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-10-02 00:48:22,564 INFO L443 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-10-02 00:48:22,564 INFO L443 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-10-02 00:48:22,564 INFO L443 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-10-02 00:48:22,564 INFO L443 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-10-02 00:48:22,564 INFO L443 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-10-02 00:48:22,564 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-10-02 00:48:22,565 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-10-02 00:48:22,565 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-10-02 00:48:22,565 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-10-02 00:48:22,565 INFO L443 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-10-02 00:48:22,565 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-10-02 00:48:22,565 INFO L443 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,565 INFO L443 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,565 INFO L443 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,566 INFO L443 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,566 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-10-02 00:48:22,566 INFO L443 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,566 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-10-02 00:48:22,566 INFO L443 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-10-02 00:48:22,566 INFO L443 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-10-02 00:48:22,566 INFO L443 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-10-02 00:48:22,566 INFO L443 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-10-02 00:48:22,567 INFO L443 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-10-02 00:48:22,567 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-10-02 00:48:22,567 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-10-02 00:48:22,567 INFO L443 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-10-02 00:48:22,567 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-10-02 00:48:22,567 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-10-02 00:48:22,567 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-10-02 00:48:22,567 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-10-02 00:48:22,568 INFO L443 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-10-02 00:48:22,568 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-10-02 00:48:22,568 INFO L443 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,568 INFO L443 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,568 INFO L443 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,568 INFO L443 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,568 INFO L443 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,568 INFO L443 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-10-02 00:48:22,569 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-10-02 00:48:22,569 INFO L443 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-10-02 00:48:22,569 INFO L443 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-10-02 00:48:22,569 INFO L443 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-10-02 00:48:22,569 INFO L443 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-10-02 00:48:22,569 INFO L443 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-10-02 00:48:22,569 INFO L443 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-10-02 00:48:22,569 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-10-02 00:48:22,570 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-10-02 00:48:22,570 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-10-02 00:48:22,570 INFO L443 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,570 INFO L443 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,570 INFO L443 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,570 INFO L443 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,570 INFO L443 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,571 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-10-02 00:48:22,571 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-10-02 00:48:22,571 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-10-02 00:48:22,571 INFO L443 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-10-02 00:48:22,571 INFO L443 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-10-02 00:48:22,571 INFO L443 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-10-02 00:48:22,571 INFO L443 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-10-02 00:48:22,571 INFO L443 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-10-02 00:48:22,572 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-10-02 00:48:22,572 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 583) no Hoare annotation was computed. [2019-10-02 00:48:22,572 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-10-02 00:48:22,572 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-10-02 00:48:22,572 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-10-02 00:48:22,572 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-10-02 00:48:22,572 INFO L443 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,572 INFO L443 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,573 INFO L443 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,573 INFO L443 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,573 INFO L443 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,573 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-10-02 00:48:22,573 INFO L443 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-10-02 00:48:22,573 INFO L443 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-10-02 00:48:22,573 INFO L443 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-10-02 00:48:22,573 INFO L443 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-10-02 00:48:22,573 INFO L443 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-10-02 00:48:22,574 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-10-02 00:48:22,574 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-10-02 00:48:22,574 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-10-02 00:48:22,574 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-10-02 00:48:22,574 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-10-02 00:48:22,574 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-10-02 00:48:22,574 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-10-02 00:48:22,574 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-10-02 00:48:22,574 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-10-02 00:48:22,575 INFO L443 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-10-02 00:48:22,575 INFO L443 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,575 INFO L443 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,575 INFO L443 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,575 INFO L443 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,575 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-10-02 00:48:22,575 INFO L443 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,575 INFO L443 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-10-02 00:48:22,576 INFO L443 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,576 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-10-02 00:48:22,576 INFO L443 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-10-02 00:48:22,576 INFO L443 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-10-02 00:48:22,576 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,576 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,576 INFO L443 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-10-02 00:48:22,577 INFO L443 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-10-02 00:48:22,577 INFO L443 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-10-02 00:48:22,577 INFO L443 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-10-02 00:48:22,577 INFO L443 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-10-02 00:48:22,577 INFO L443 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-10-02 00:48:22,577 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-10-02 00:48:22,577 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-10-02 00:48:22,577 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-10-02 00:48:22,578 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-10-02 00:48:22,578 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-10-02 00:48:22,578 INFO L443 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,578 INFO L443 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,578 INFO L443 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,578 INFO L443 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,578 INFO L443 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,578 INFO L443 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,578 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-10-02 00:48:22,579 INFO L443 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-10-02 00:48:22,579 INFO L443 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-10-02 00:48:22,579 INFO L443 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-10-02 00:48:22,579 INFO L443 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-10-02 00:48:22,579 INFO L443 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-10-02 00:48:22,579 INFO L443 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-10-02 00:48:22,579 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-10-02 00:48:22,579 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-10-02 00:48:22,579 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-10-02 00:48:22,580 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-10-02 00:48:22,580 INFO L443 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,580 INFO L443 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,580 INFO L443 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,580 INFO L443 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,580 INFO L443 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,580 INFO L443 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,580 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-10-02 00:48:22,580 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-10-02 00:48:22,580 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-10-02 00:48:22,581 INFO L443 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-10-02 00:48:22,581 INFO L443 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-10-02 00:48:22,581 INFO L443 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-10-02 00:48:22,581 INFO L443 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-10-02 00:48:22,581 INFO L443 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-10-02 00:48:22,581 INFO L443 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-10-02 00:48:22,581 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-10-02 00:48:22,581 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-10-02 00:48:22,581 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-10-02 00:48:22,582 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-10-02 00:48:22,582 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-10-02 00:48:22,582 INFO L443 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,582 INFO L443 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,582 INFO L443 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,582 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse12 (= ~a11~0 |old(~a11~0)|)) (.cse15 (= ~a17~0 |old(~a17~0)|)) (.cse13 (= ~a19~0 |old(~a19~0)|)) (.cse14 (= ~a28~0 |old(~a28~0)|)) (.cse9 (= ~a25~0 |old(~a25~0)|))) (let ((.cse3 (= 1 |old(~a25~0)|)) (.cse10 (not (<= |old(~a28~0)| 7))) (.cse1 (= 1 |old(~a11~0)|)) (.cse8 (= ~a17~0 8)) (.cse6 (not (= 1 |old(~a19~0)|))) (.cse7 (not (= 8 |old(~a17~0)|))) (.cse11 (not (= 7 |old(~a17~0)|))) (.cse0 (not (= 1 ~a21~0))) (.cse5 (not (<= |old(~a28~0)| 9))) (.cse2 (= |old(~a17~0)| |old(~a28~0)|)) (.cse4 (and .cse12 .cse15 .cse13 .cse14 .cse9))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse1 .cse5 (= 9 |old(~a28~0)|) .cse4 .cse3) (or .cse0 (not (= 10 |old(~a28~0)|)) (not .cse3) .cse6 .cse7 (not .cse1) (and (= ~a28~0 10) .cse8 (= ~a19~0 1) (= ~a11~0 1) .cse9)) (or .cse0 .cse10 .cse4 .cse6) (or .cse0 .cse1 .cse5 .cse6 .cse4) (or .cse0 .cse10 .cse1 .cse4) (or .cse0 .cse1 .cse11 (not (= 1 ~a11~0))) (or .cse0 .cse1 .cse4 .cse2 (= 11 |old(~a28~0)|)) (or .cse0 .cse1 (and .cse12 .cse8 .cse13 .cse14 .cse9) .cse6 .cse7) (or .cse0 (and .cse15 .cse14 .cse9) .cse2 .cse11) (or .cse0 .cse5 .cse2 .cse4)))) [2019-10-02 00:48:22,583 INFO L443 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,583 INFO L443 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,583 INFO L443 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,583 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-10-02 00:48:22,583 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-10-02 00:48:22,583 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-10-02 00:48:22,583 INFO L443 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-10-02 00:48:22,583 INFO L443 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-10-02 00:48:22,584 INFO L443 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-10-02 00:48:22,584 INFO L443 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-10-02 00:48:22,584 INFO L443 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-10-02 00:48:22,584 INFO L443 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-10-02 00:48:22,584 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-10-02 00:48:22,584 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-10-02 00:48:22,584 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-10-02 00:48:22,584 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-10-02 00:48:22,584 INFO L443 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,585 INFO L443 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,585 INFO L443 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,585 INFO L443 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,585 INFO L443 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,585 INFO L443 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,585 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-10-02 00:48:22,585 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-10-02 00:48:22,585 INFO L443 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-10-02 00:48:22,585 INFO L443 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-10-02 00:48:22,585 INFO L443 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-10-02 00:48:22,586 INFO L443 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-10-02 00:48:22,586 INFO L443 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-10-02 00:48:22,586 INFO L443 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-10-02 00:48:22,586 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-10-02 00:48:22,586 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-10-02 00:48:22,586 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-10-02 00:48:22,586 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-10-02 00:48:22,586 INFO L443 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-10-02 00:48:22,586 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-10-02 00:48:22,587 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-10-02 00:48:22,587 INFO L443 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-10-02 00:48:22,587 INFO L443 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,587 INFO L443 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,587 INFO L443 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,587 INFO L443 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,587 INFO L443 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:22,587 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-10-02 00:48:22,587 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-10-02 00:48:22,588 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-10-02 00:48:22,588 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-10-02 00:48:22,588 INFO L443 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-10-02 00:48:22,588 INFO L443 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-10-02 00:48:22,588 INFO L443 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-10-02 00:48:22,588 INFO L443 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-10-02 00:48:22,588 INFO L443 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-10-02 00:48:22,588 INFO L443 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-10-02 00:48:22,588 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-10-02 00:48:22,588 INFO L443 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-10-02 00:48:22,589 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-10-02 00:48:22,589 INFO L443 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-10-02 00:48:22,589 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-10-02 00:48:22,589 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-10-02 00:48:22,589 INFO L443 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-10-02 00:48:22,589 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-10-02 00:48:22,589 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-10-02 00:48:22,589 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 00:48:22,590 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= 1 ~a11~0)) (<= ~a28~0 7) (not (= ~a28~0 ~a17~0)) (not (= ~a25~0 1)) (= ~a19~0 1) (= ~a21~0 1)) [2019-10-02 00:48:22,590 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 00:48:22,590 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 00:48:22,590 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (not (<= |old(~a28~0)| 7)) (= 1 |old(~a11~0)|) (not (= 1 |old(~a19~0)|)) (and (= ~a11~0 |old(~a11~0)|) (= ~a17~0 |old(~a17~0)|) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) (= |old(~a17~0)| |old(~a28~0)|) (= 1 |old(~a25~0)|)) [2019-10-02 00:48:22,590 INFO L439 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse10 (= ~a25~0 1))) (let ((.cse7 (= ~a17~0 7)) (.cse0 (<= ~a28~0 7)) (.cse5 (not (= ~a28~0 ~a17~0))) (.cse13 (= ~a28~0 7)) (.cse4 (not (= 1 ~a11~0))) (.cse6 (not .cse10)) (.cse12 (<= ~a28~0 9)) (.cse8 (= ~a28~0 9)) (.cse1 (= 7 |old(~a28~0)|)) (.cse9 (= ~a17~0 8)) (.cse2 (= ~a19~0 1)) (.cse11 (= ~a11~0 1)) (.cse3 (= 8 |old(~a17~0)|))) (or (not (= 1 ~a21~0)) (not (<= |old(~a28~0)| 7)) (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse1 .cse3) (and .cse4 .cse5 .cse1 .cse3 (not (= ~a28~0 11))) (and .cse5 .cse7) (and .cse4 .cse0 .cse1 .cse3) (and .cse8 .cse9 .cse2 .cse10 .cse11) (and .cse5 .cse1 .cse3 .cse12) (= 1 |old(~a25~0)|) (and .cse7 .cse2 .cse10 .cse11) (= 1 |old(~a11~0)|) (= |old(~a17~0)| |old(~a28~0)|) (and .cse0 (= ~a11~0 |old(~a11~0)|) (= ~a17~0 |old(~a17~0)|) (and .cse5 (or (not .cse13) (not .cse9))) (= ~a19~0 |old(~a19~0)|) (= ~a25~0 |old(~a25~0)|)) (and (not .cse2) .cse6 .cse9 .cse13 .cse11) (and .cse4 .cse1 .cse2 .cse12 .cse3) (not (= 1 |old(~a19~0)|)) (and (= ~a28~0 10) .cse9 .cse2 .cse10 .cse11) (and .cse4 .cse6 .cse1 .cse3 .cse12 (not .cse8)) (and .cse1 .cse9 .cse2 (not .cse11) .cse3)))) [2019-10-02 00:48:22,590 INFO L443 ceAbstractionStarter]: For program point L606-3(lines 600 617) no Hoare annotation was computed. [2019-10-02 00:48:22,591 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2019-10-02 00:48:22,591 INFO L439 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse10 (= ~a25~0 1))) (let ((.cse7 (= ~a17~0 7)) (.cse0 (<= ~a28~0 7)) (.cse5 (not (= ~a28~0 ~a17~0))) (.cse13 (= ~a28~0 7)) (.cse4 (not (= 1 ~a11~0))) (.cse6 (not .cse10)) (.cse12 (<= ~a28~0 9)) (.cse8 (= ~a28~0 9)) (.cse1 (= 7 |old(~a28~0)|)) (.cse9 (= ~a17~0 8)) (.cse2 (= ~a19~0 1)) (.cse11 (= ~a11~0 1)) (.cse3 (= 8 |old(~a17~0)|))) (or (not (= 1 ~a21~0)) (not (<= |old(~a28~0)| 7)) (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse1 .cse3) (and .cse4 .cse5 .cse1 .cse3 (not (= ~a28~0 11))) (and .cse5 .cse7) (and .cse4 .cse0 .cse1 .cse3) (and .cse8 .cse9 .cse2 .cse10 .cse11) (and .cse5 .cse1 .cse3 .cse12) (= 1 |old(~a25~0)|) (and .cse7 .cse2 .cse10 .cse11) (= 1 |old(~a11~0)|) (= |old(~a17~0)| |old(~a28~0)|) (and .cse0 (= ~a11~0 |old(~a11~0)|) (= ~a17~0 |old(~a17~0)|) (and .cse5 (or (not .cse13) (not .cse9))) (= ~a19~0 |old(~a19~0)|) (= ~a25~0 |old(~a25~0)|)) (and (not .cse2) .cse6 .cse9 .cse13 .cse11) (and .cse4 .cse1 .cse2 .cse12 .cse3) (not (= 1 |old(~a19~0)|)) (and (= ~a28~0 10) .cse9 .cse2 .cse10 .cse11) (and .cse4 .cse6 .cse1 .cse3 .cse12 (not .cse8)) (and .cse1 .cse9 .cse2 (not .cse11) .cse3)))) [2019-10-02 00:48:22,591 INFO L443 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2019-10-02 00:48:22,591 INFO L443 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-10-02 00:48:22,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:48:22 BoogieIcfgContainer [2019-10-02 00:48:22,615 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 00:48:22,617 INFO L168 Benchmark]: Toolchain (without parser) took 21907.64 ms. Allocated memory was 132.6 MB in the beginning and 551.6 MB in the end (delta: 418.9 MB). Free memory was 85.9 MB in the beginning and 195.6 MB in the end (delta: -109.8 MB). Peak memory consumption was 427.8 MB. Max. memory is 7.1 GB. [2019-10-02 00:48:22,618 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 132.6 MB. Free memory was 105.4 MB in the beginning and 105.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 00:48:22,619 INFO L168 Benchmark]: CACSL2BoogieTranslator took 869.68 ms. Allocated memory was 132.6 MB in the beginning and 202.9 MB in the end (delta: 70.3 MB). Free memory was 85.7 MB in the beginning and 168.4 MB in the end (delta: -82.7 MB). Peak memory consumption was 36.8 MB. Max. memory is 7.1 GB. [2019-10-02 00:48:22,620 INFO L168 Benchmark]: Boogie Preprocessor took 135.74 ms. Allocated memory is still 202.9 MB. Free memory was 168.4 MB in the beginning and 162.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 7.1 GB. [2019-10-02 00:48:22,621 INFO L168 Benchmark]: RCFGBuilder took 1231.97 ms. Allocated memory was 202.9 MB in the beginning and 227.0 MB in the end (delta: 24.1 MB). Free memory was 162.9 MB in the beginning and 179.2 MB in the end (delta: -16.3 MB). Peak memory consumption was 91.0 MB. Max. memory is 7.1 GB. [2019-10-02 00:48:22,622 INFO L168 Benchmark]: TraceAbstraction took 19664.99 ms. Allocated memory was 227.0 MB in the beginning and 551.6 MB in the end (delta: 324.5 MB). Free memory was 179.2 MB in the beginning and 195.6 MB in the end (delta: -16.4 MB). Peak memory consumption was 426.8 MB. Max. memory is 7.1 GB. [2019-10-02 00:48:22,626 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.20 ms. Allocated memory is still 132.6 MB. Free memory was 105.4 MB in the beginning and 105.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 869.68 ms. Allocated memory was 132.6 MB in the beginning and 202.9 MB in the end (delta: 70.3 MB). Free memory was 85.7 MB in the beginning and 168.4 MB in the end (delta: -82.7 MB). Peak memory consumption was 36.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.74 ms. Allocated memory is still 202.9 MB. Free memory was 168.4 MB in the beginning and 162.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1231.97 ms. Allocated memory was 202.9 MB in the beginning and 227.0 MB in the end (delta: 24.1 MB). Free memory was 162.9 MB in the beginning and 179.2 MB in the end (delta: -16.3 MB). Peak memory consumption was 91.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19664.99 ms. Allocated memory was 227.0 MB in the beginning and 551.6 MB in the end (delta: 324.5 MB). Free memory was 179.2 MB in the beginning and 195.6 MB in the end (delta: -16.4 MB). Peak memory consumption was 426.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 583]: 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: 606]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(1 == a21) || !(\old(a28) <= 7)) || (((a28 <= 7 && 7 == \old(a28)) && a19 == 1) && 8 == \old(a17))) || ((((!(1 == a11) && !(a28 == a17)) && !(a25 == 1)) && 7 == \old(a28)) && 8 == \old(a17))) || ((((!(1 == a11) && !(a28 == a17)) && 7 == \old(a28)) && 8 == \old(a17)) && !(a28 == 11))) || (!(a28 == a17) && a17 == 7)) || (((!(1 == a11) && a28 <= 7) && 7 == \old(a28)) && 8 == \old(a17))) || ((((a28 == 9 && a17 == 8) && a19 == 1) && a25 == 1) && a11 == 1)) || (((!(a28 == a17) && 7 == \old(a28)) && 8 == \old(a17)) && a28 <= 9)) || 1 == \old(a25)) || (((a17 == 7 && a19 == 1) && a25 == 1) && a11 == 1)) || 1 == \old(a11)) || \old(a17) == \old(a28)) || (((((a28 <= 7 && a11 == \old(a11)) && a17 == \old(a17)) && !(a28 == a17) && (!(a28 == 7) || !(a17 == 8))) && a19 == \old(a19)) && a25 == \old(a25))) || ((((!(a19 == 1) && !(a25 == 1)) && a17 == 8) && a28 == 7) && a11 == 1)) || ((((!(1 == a11) && 7 == \old(a28)) && a19 == 1) && a28 <= 9) && 8 == \old(a17))) || !(1 == \old(a19))) || ((((a28 == 10 && a17 == 8) && a19 == 1) && a25 == 1) && a11 == 1)) || (((((!(1 == a11) && !(a25 == 1)) && 7 == \old(a28)) && 8 == \old(a17)) && a28 <= 9) && !(a28 == 9))) || ((((7 == \old(a28) && a17 == 8) && a19 == 1) && !(a11 == 1)) && 8 == \old(a17)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 236 locations, 1 error locations. SAFE Result, 19.5s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 13.2s AutomataDifference, 0.0s DeadEndRemovalTime, 2.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 590 SDtfs, 6807 SDslu, 593 SDs, 0 SdLazy, 7773 SolverSat, 1692 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 765 GetRequests, 673 SyntacticMatches, 4 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2398occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 514 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 116 PreInvPairs, 192 NumberOfFragments, 916 HoareAnnotationTreeSize, 116 FomulaSimplifications, 5169 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 2533 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 2351 NumberOfCodeBlocks, 2351 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2338 ConstructedInterpolants, 0 QuantifiedInterpolants, 2190065 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1377 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 470/512 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...