java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label21_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 20:35:21,798 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 20:35:21,800 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 20:35:21,812 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 20:35:21,813 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 20:35:21,814 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 20:35:21,815 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 20:35:21,817 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 20:35:21,819 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 20:35:21,820 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 20:35:21,820 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 20:35:21,821 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 20:35:21,822 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 20:35:21,823 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 20:35:21,824 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 20:35:21,825 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 20:35:21,825 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 20:35:21,827 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 20:35:21,829 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 20:35:21,831 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 20:35:21,832 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 20:35:21,833 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 20:35:21,835 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 20:35:21,836 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 20:35:21,836 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 20:35:21,837 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 20:35:21,838 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 20:35:21,838 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 20:35:21,839 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 20:35:21,840 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 20:35:21,841 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 20:35:21,841 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 20:35:21,841 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 20:35:21,842 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 20:35:21,843 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 20:35:21,843 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 20:35:21,844 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 20:35:21,859 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 20:35:21,860 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 20:35:21,860 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 20:35:21,861 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 20:35:21,861 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 20:35:21,861 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 20:35:21,861 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 20:35:21,861 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 20:35:21,862 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 20:35:21,862 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 20:35:21,862 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 20:35:21,862 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 20:35:21,862 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 20:35:21,863 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 20:35:21,863 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 20:35:21,864 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 20:35:21,864 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 20:35:21,864 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 20:35:21,864 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 20:35:21,864 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 20:35:21,865 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 20:35:21,865 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 20:35:21,866 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 20:35:21,866 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 20:35:21,866 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 20:35:21,866 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:35:21,866 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 20:35:21,867 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 20:35:21,867 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 20:35:21,867 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 20:35:21,867 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 20:35:21,867 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 20:35:21,868 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 20:35:21,868 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 20:35:21,869 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 20:35:21,934 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 20:35:21,953 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 20:35:21,957 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 20:35:21,959 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 20:35:21,959 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 20:35:21,960 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label21_true-unreach-call_false-termination.c [2018-11-07 20:35:22,024 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04ac3e45b/62af84bb31764e9b8df69c8781b49b1f/FLAG84520d0a8 [2018-11-07 20:35:22,625 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 20:35:22,629 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label21_true-unreach-call_false-termination.c [2018-11-07 20:35:22,656 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04ac3e45b/62af84bb31764e9b8df69c8781b49b1f/FLAG84520d0a8 [2018-11-07 20:35:22,679 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04ac3e45b/62af84bb31764e9b8df69c8781b49b1f [2018-11-07 20:35:22,693 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 20:35:22,695 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 20:35:22,696 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 20:35:22,696 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 20:35:22,701 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 20:35:22,702 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:35:22" (1/1) ... [2018-11-07 20:35:22,705 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58dd67db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:22, skipping insertion in model container [2018-11-07 20:35:22,705 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:35:22" (1/1) ... [2018-11-07 20:35:22,717 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 20:35:22,783 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 20:35:23,298 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:35:23,304 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 20:35:23,501 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:35:23,521 INFO L193 MainTranslator]: Completed translation [2018-11-07 20:35:23,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:23 WrapperNode [2018-11-07 20:35:23,522 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 20:35:23,523 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 20:35:23,523 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 20:35:23,523 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 20:35:23,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:23" (1/1) ... [2018-11-07 20:35:23,657 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:23" (1/1) ... [2018-11-07 20:35:23,674 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 20:35:23,675 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 20:35:23,675 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 20:35:23,675 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 20:35:23,686 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:23" (1/1) ... [2018-11-07 20:35:23,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:23" (1/1) ... [2018-11-07 20:35:23,697 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:23" (1/1) ... [2018-11-07 20:35:23,697 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:23" (1/1) ... [2018-11-07 20:35:23,751 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:23" (1/1) ... [2018-11-07 20:35:23,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:23" (1/1) ... [2018-11-07 20:35:23,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:23" (1/1) ... [2018-11-07 20:35:23,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 20:35:23,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 20:35:23,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 20:35:23,781 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 20:35:23,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:35:23,883 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 20:35:23,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 20:35:23,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 20:35:23,885 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 20:35:23,885 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 20:35:23,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 20:35:23,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 20:35:23,886 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 20:35:23,886 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 20:35:27,775 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 20:35:27,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:35:27 BoogieIcfgContainer [2018-11-07 20:35:27,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 20:35:27,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 20:35:27,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 20:35:27,781 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 20:35:27,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:35:22" (1/3) ... [2018-11-07 20:35:27,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56cf635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:35:27, skipping insertion in model container [2018-11-07 20:35:27,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:23" (2/3) ... [2018-11-07 20:35:27,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56cf635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:35:27, skipping insertion in model container [2018-11-07 20:35:27,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:35:27" (3/3) ... [2018-11-07 20:35:27,785 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label21_true-unreach-call_false-termination.c [2018-11-07 20:35:27,795 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 20:35:27,805 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 20:35:27,823 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 20:35:27,862 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 20:35:27,862 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 20:35:27,862 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 20:35:27,862 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 20:35:27,862 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 20:35:27,862 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 20:35:27,863 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 20:35:27,863 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 20:35:27,892 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-11-07 20:35:27,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 20:35:27,900 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:35:27,902 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:35:27,904 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:35:27,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:35:27,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1101027815, now seen corresponding path program 1 times [2018-11-07 20:35:27,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:35:27,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:27,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:35:27,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:27,966 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:35:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:35:28,344 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:35:28,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:35:28,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:35:28,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 20:35:28,414 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:35:28,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 20:35:28,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 20:35:28,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 20:35:28,445 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2018-11-07 20:35:30,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:35:30,586 INFO L93 Difference]: Finished difference Result 691 states and 1226 transitions. [2018-11-07 20:35:30,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 20:35:30,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-11-07 20:35:30,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:35:30,610 INFO L225 Difference]: With dead ends: 691 [2018-11-07 20:35:30,610 INFO L226 Difference]: Without dead ends: 434 [2018-11-07 20:35:30,619 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 20:35:30,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-11-07 20:35:30,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-11-07 20:35:30,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-11-07 20:35:30,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 767 transitions. [2018-11-07 20:35:30,709 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 767 transitions. Word has length 41 [2018-11-07 20:35:30,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:35:30,710 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 767 transitions. [2018-11-07 20:35:30,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 20:35:30,710 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 767 transitions. [2018-11-07 20:35:30,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-07 20:35:30,717 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:35:30,718 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:35:30,718 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:35:30,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:35:30,719 INFO L82 PathProgramCache]: Analyzing trace with hash 212852571, now seen corresponding path program 1 times [2018-11-07 20:35:30,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:35:30,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:30,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:35:30,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:30,721 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:35:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:35:31,024 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:35:31,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:35:31,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 20:35:31,025 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:35:31,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 20:35:31,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 20:35:31,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 20:35:31,028 INFO L87 Difference]: Start difference. First operand 434 states and 767 transitions. Second operand 5 states. [2018-11-07 20:35:34,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:35:34,936 INFO L93 Difference]: Finished difference Result 1416 states and 2580 transitions. [2018-11-07 20:35:34,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 20:35:34,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2018-11-07 20:35:34,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:35:34,952 INFO L225 Difference]: With dead ends: 1416 [2018-11-07 20:35:34,952 INFO L226 Difference]: Without dead ends: 988 [2018-11-07 20:35:34,961 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 20:35:34,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-11-07 20:35:35,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 973. [2018-11-07 20:35:35,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2018-11-07 20:35:35,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1540 transitions. [2018-11-07 20:35:35,032 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1540 transitions. Word has length 118 [2018-11-07 20:35:35,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:35:35,033 INFO L480 AbstractCegarLoop]: Abstraction has 973 states and 1540 transitions. [2018-11-07 20:35:35,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 20:35:35,034 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1540 transitions. [2018-11-07 20:35:35,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-07 20:35:35,040 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:35:35,041 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:35:35,041 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:35:35,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:35:35,041 INFO L82 PathProgramCache]: Analyzing trace with hash -2137480229, now seen corresponding path program 1 times [2018-11-07 20:35:35,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:35:35,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:35,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:35:35,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:35,043 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:35:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:35:35,484 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:35:35,923 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:35:35,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:35:35,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:35:35,924 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:35:35,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:35:35,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:35:35,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:35:35,928 INFO L87 Difference]: Start difference. First operand 973 states and 1540 transitions. Second operand 6 states. [2018-11-07 20:35:39,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:35:39,849 INFO L93 Difference]: Finished difference Result 2347 states and 3916 transitions. [2018-11-07 20:35:39,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:35:39,850 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 182 [2018-11-07 20:35:39,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:35:39,868 INFO L225 Difference]: With dead ends: 2347 [2018-11-07 20:35:39,869 INFO L226 Difference]: Without dead ends: 1380 [2018-11-07 20:35:39,872 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:35:39,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2018-11-07 20:35:39,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1352. [2018-11-07 20:35:39,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-11-07 20:35:39,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2126 transitions. [2018-11-07 20:35:39,950 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2126 transitions. Word has length 182 [2018-11-07 20:35:39,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:35:39,951 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 2126 transitions. [2018-11-07 20:35:39,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:35:39,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2126 transitions. [2018-11-07 20:35:39,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-07 20:35:39,957 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:35:39,958 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 20:35:39,958 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:35:39,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:35:39,959 INFO L82 PathProgramCache]: Analyzing trace with hash -448591016, now seen corresponding path program 1 times [2018-11-07 20:35:39,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:35:39,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:39,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:35:39,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:39,960 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:35:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:35:40,337 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 140 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:35:40,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:35:40,338 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:35:40,339 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 193 with the following transitions: [2018-11-07 20:35:40,341 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [522], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:35:40,392 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:35:40,392 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:35:40,934 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:35:40,973 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:35:40,975 INFO L272 AbstractInterpreter]: Visited 82 different actions 82 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-11-07 20:35:41,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:35:41,025 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:35:41,609 INFO L227 lantSequenceWeakener]: Weakened 183 states. On average, predicates are now at 77.83% of their original sizes. [2018-11-07 20:35:41,611 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:35:41,971 INFO L415 sIntCurrentIteration]: We unified 191 AI predicates to 191 [2018-11-07 20:35:41,972 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:35:41,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:35:41,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-11-07 20:35:41,973 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:35:41,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 20:35:41,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 20:35:41,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-07 20:35:41,975 INFO L87 Difference]: Start difference. First operand 1352 states and 2126 transitions. Second operand 7 states. [2018-11-07 20:35:55,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:35:55,318 INFO L93 Difference]: Finished difference Result 2883 states and 4473 transitions. [2018-11-07 20:35:55,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:35:55,319 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 192 [2018-11-07 20:35:55,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:35:55,329 INFO L225 Difference]: With dead ends: 2883 [2018-11-07 20:35:55,329 INFO L226 Difference]: Without dead ends: 1537 [2018-11-07 20:35:55,336 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 192 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-07 20:35:55,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2018-11-07 20:35:55,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1535. [2018-11-07 20:35:55,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1535 states. [2018-11-07 20:35:55,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2316 transitions. [2018-11-07 20:35:55,384 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2316 transitions. Word has length 192 [2018-11-07 20:35:55,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:35:55,385 INFO L480 AbstractCegarLoop]: Abstraction has 1535 states and 2316 transitions. [2018-11-07 20:35:55,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 20:35:55,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2316 transitions. [2018-11-07 20:35:55,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-11-07 20:35:55,391 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:35:55,391 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:35:55,392 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:35:55,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:35:55,392 INFO L82 PathProgramCache]: Analyzing trace with hash 475311430, now seen corresponding path program 1 times [2018-11-07 20:35:55,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:35:55,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:55,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:35:55,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:55,394 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:35:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:35:56,127 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 254 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-07 20:35:56,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:35:56,128 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:35:56,128 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 278 with the following transitions: [2018-11-07 20:35:56,129 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [554], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:35:56,135 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:35:56,135 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:35:56,207 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:35:56,345 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:35:56,346 INFO L272 AbstractInterpreter]: Visited 94 different actions 181 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:35:56,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:35:56,379 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:35:56,928 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 77.8% of their original sizes. [2018-11-07 20:35:56,928 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:35:58,397 INFO L415 sIntCurrentIteration]: We unified 276 AI predicates to 276 [2018-11-07 20:35:58,397 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:35:58,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:35:58,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [7] total 23 [2018-11-07 20:35:58,399 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:35:58,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 20:35:58,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 20:35:58,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-11-07 20:35:58,401 INFO L87 Difference]: Start difference. First operand 1535 states and 2316 transitions. Second operand 18 states. [2018-11-07 20:36:22,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:36:22,573 INFO L93 Difference]: Finished difference Result 4032 states and 5799 transitions. [2018-11-07 20:36:22,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 20:36:22,573 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 277 [2018-11-07 20:36:22,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:36:22,585 INFO L225 Difference]: With dead ends: 4032 [2018-11-07 20:36:22,585 INFO L226 Difference]: Without dead ends: 2686 [2018-11-07 20:36:22,591 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 284 GetRequests, 256 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2018-11-07 20:36:22,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2018-11-07 20:36:22,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 2292. [2018-11-07 20:36:22,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2292 states. [2018-11-07 20:36:22,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2292 states to 2292 states and 3121 transitions. [2018-11-07 20:36:22,656 INFO L78 Accepts]: Start accepts. Automaton has 2292 states and 3121 transitions. Word has length 277 [2018-11-07 20:36:22,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:36:22,657 INFO L480 AbstractCegarLoop]: Abstraction has 2292 states and 3121 transitions. [2018-11-07 20:36:22,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 20:36:22,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2292 states and 3121 transitions. [2018-11-07 20:36:22,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-11-07 20:36:22,664 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:36:22,664 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:36:22,665 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:36:22,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:36:22,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1118573838, now seen corresponding path program 1 times [2018-11-07 20:36:22,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:36:22,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:22,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:36:22,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:22,667 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:36:22,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:36:24,066 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 256 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:36:24,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:36:24,066 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:36:24,066 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 304 with the following transitions: [2018-11-07 20:36:24,067 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:36:24,072 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:36:24,072 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:36:24,105 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:36:24,222 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:36:24,222 INFO L272 AbstractInterpreter]: Visited 120 different actions 234 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:36:24,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:36:24,262 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:36:24,584 INFO L227 lantSequenceWeakener]: Weakened 189 states. On average, predicates are now at 78.14% of their original sizes. [2018-11-07 20:36:24,584 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:36:24,857 INFO L415 sIntCurrentIteration]: We unified 302 AI predicates to 302 [2018-11-07 20:36:24,858 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:36:24,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:36:24,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [14] total 30 [2018-11-07 20:36:24,858 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:36:24,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 20:36:24,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 20:36:24,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-11-07 20:36:24,860 INFO L87 Difference]: Start difference. First operand 2292 states and 3121 transitions. Second operand 18 states. [2018-11-07 20:36:33,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:36:33,810 INFO L93 Difference]: Finished difference Result 4011 states and 5701 transitions. [2018-11-07 20:36:33,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 20:36:33,810 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 303 [2018-11-07 20:36:33,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:36:33,821 INFO L225 Difference]: With dead ends: 4011 [2018-11-07 20:36:33,821 INFO L226 Difference]: Without dead ends: 2665 [2018-11-07 20:36:33,828 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 322 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=269, Invalid=1137, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 20:36:33,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2665 states. [2018-11-07 20:36:33,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2665 to 2660. [2018-11-07 20:36:33,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2660 states. [2018-11-07 20:36:33,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2660 states and 3518 transitions. [2018-11-07 20:36:33,898 INFO L78 Accepts]: Start accepts. Automaton has 2660 states and 3518 transitions. Word has length 303 [2018-11-07 20:36:33,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:36:33,899 INFO L480 AbstractCegarLoop]: Abstraction has 2660 states and 3518 transitions. [2018-11-07 20:36:33,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 20:36:33,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2660 states and 3518 transitions. [2018-11-07 20:36:33,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-11-07 20:36:33,907 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:36:33,907 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:36:33,908 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:36:33,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:36:33,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1867617726, now seen corresponding path program 1 times [2018-11-07 20:36:33,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:36:33,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:33,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:36:33,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:33,910 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:36:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:36:34,381 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:36:34,915 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 179 proven. 143 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:36:34,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:36:34,915 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:36:34,916 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 314 with the following transitions: [2018-11-07 20:36:34,916 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [698], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:36:34,920 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:36:34,921 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:36:34,957 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:36:35,091 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:36:35,092 INFO L272 AbstractInterpreter]: Visited 130 different actions 253 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:36:35,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:36:35,102 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:36:35,495 INFO L227 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 77.84% of their original sizes. [2018-11-07 20:36:35,496 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:36:35,990 INFO L415 sIntCurrentIteration]: We unified 312 AI predicates to 312 [2018-11-07 20:36:35,990 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:36:35,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:36:35,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [13] total 29 [2018-11-07 20:36:35,991 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:36:35,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 20:36:35,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 20:36:35,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2018-11-07 20:36:35,992 INFO L87 Difference]: Start difference. First operand 2660 states and 3518 transitions. Second operand 18 states. [2018-11-07 20:36:55,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:36:55,358 INFO L93 Difference]: Finished difference Result 4982 states and 6815 transitions. [2018-11-07 20:36:55,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 20:36:55,358 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 313 [2018-11-07 20:36:55,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:36:55,368 INFO L225 Difference]: With dead ends: 4982 [2018-11-07 20:36:55,369 INFO L226 Difference]: Without dead ends: 3636 [2018-11-07 20:36:55,374 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 320 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2018-11-07 20:36:55,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3636 states. [2018-11-07 20:36:55,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3636 to 3052. [2018-11-07 20:36:55,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3052 states. [2018-11-07 20:36:55,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3052 states to 3052 states and 3934 transitions. [2018-11-07 20:36:55,450 INFO L78 Accepts]: Start accepts. Automaton has 3052 states and 3934 transitions. Word has length 313 [2018-11-07 20:36:55,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:36:55,451 INFO L480 AbstractCegarLoop]: Abstraction has 3052 states and 3934 transitions. [2018-11-07 20:36:55,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 20:36:55,451 INFO L276 IsEmpty]: Start isEmpty. Operand 3052 states and 3934 transitions. [2018-11-07 20:36:55,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-11-07 20:36:55,461 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:36:55,461 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:36:55,461 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:36:55,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:36:55,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1810298629, now seen corresponding path program 1 times [2018-11-07 20:36:55,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:36:55,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:55,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:36:55,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:55,463 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:36:55,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:36:55,966 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:36:56,186 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 20:36:56,391 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:36:56,727 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-07 20:36:57,105 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 179 proven. 143 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:36:57,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:36:57,105 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:36:57,106 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 339 with the following transitions: [2018-11-07 20:36:57,106 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [798], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:36:57,111 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:36:57,111 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:36:57,180 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:36:57,539 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:36:57,540 INFO L272 AbstractInterpreter]: Visited 155 different actions 306 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:36:57,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:36:57,579 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:36:58,053 INFO L227 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 77.84% of their original sizes. [2018-11-07 20:36:58,053 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:36:59,191 INFO L415 sIntCurrentIteration]: We unified 337 AI predicates to 337 [2018-11-07 20:36:59,192 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:36:59,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:36:59,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [13] total 28 [2018-11-07 20:36:59,192 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:36:59,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 20:36:59,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 20:36:59,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-11-07 20:36:59,195 INFO L87 Difference]: Start difference. First operand 3052 states and 3934 transitions. Second operand 17 states. [2018-11-07 20:37:16,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:37:16,761 INFO L93 Difference]: Finished difference Result 5371 states and 7230 transitions. [2018-11-07 20:37:16,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 20:37:16,761 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 338 [2018-11-07 20:37:16,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:37:16,773 INFO L225 Difference]: With dead ends: 5371 [2018-11-07 20:37:16,774 INFO L226 Difference]: Without dead ends: 4025 [2018-11-07 20:37:16,779 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 345 GetRequests, 316 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2018-11-07 20:37:16,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4025 states. [2018-11-07 20:37:16,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4025 to 3440. [2018-11-07 20:37:16,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3440 states. [2018-11-07 20:37:16,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3440 states to 3440 states and 4348 transitions. [2018-11-07 20:37:16,860 INFO L78 Accepts]: Start accepts. Automaton has 3440 states and 4348 transitions. Word has length 338 [2018-11-07 20:37:16,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:37:16,861 INFO L480 AbstractCegarLoop]: Abstraction has 3440 states and 4348 transitions. [2018-11-07 20:37:16,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 20:37:16,861 INFO L276 IsEmpty]: Start isEmpty. Operand 3440 states and 4348 transitions. [2018-11-07 20:37:16,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-11-07 20:37:16,871 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:37:16,872 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:37:16,872 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:37:16,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:37:16,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1902382058, now seen corresponding path program 1 times [2018-11-07 20:37:16,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:37:16,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:37:16,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:37:16,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:37:16,873 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:37:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:37:17,387 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 257 proven. 2 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-07 20:37:17,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:37:17,388 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:37:17,388 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 340 with the following transitions: [2018-11-07 20:37:17,388 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:37:17,391 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:37:17,391 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:37:17,505 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:37:17,596 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:37:17,597 INFO L272 AbstractInterpreter]: Visited 120 different actions 359 times. Merged at 8 different actions 21 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 20:37:17,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:37:17,607 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:37:17,877 INFO L227 lantSequenceWeakener]: Weakened 336 states. On average, predicates are now at 80.35% of their original sizes. [2018-11-07 20:37:17,878 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:37:17,961 INFO L415 sIntCurrentIteration]: We unified 338 AI predicates to 338 [2018-11-07 20:37:17,961 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:37:17,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:37:17,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2018-11-07 20:37:17,962 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:37:17,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 20:37:17,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 20:37:17,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 20:37:17,963 INFO L87 Difference]: Start difference. First operand 3440 states and 4348 transitions. Second operand 10 states. [2018-11-07 20:37:26,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:37:26,588 INFO L93 Difference]: Finished difference Result 5378 states and 7400 transitions. [2018-11-07 20:37:26,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 20:37:26,588 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 339 [2018-11-07 20:37:26,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:37:26,603 INFO L225 Difference]: With dead ends: 5378 [2018-11-07 20:37:26,603 INFO L226 Difference]: Without dead ends: 4032 [2018-11-07 20:37:26,610 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 346 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-07 20:37:26,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4032 states. [2018-11-07 20:37:26,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4032 to 3809. [2018-11-07 20:37:26,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3809 states. [2018-11-07 20:37:26,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3809 states to 3809 states and 4809 transitions. [2018-11-07 20:37:26,694 INFO L78 Accepts]: Start accepts. Automaton has 3809 states and 4809 transitions. Word has length 339 [2018-11-07 20:37:26,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:37:26,695 INFO L480 AbstractCegarLoop]: Abstraction has 3809 states and 4809 transitions. [2018-11-07 20:37:26,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 20:37:26,696 INFO L276 IsEmpty]: Start isEmpty. Operand 3809 states and 4809 transitions. [2018-11-07 20:37:26,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-11-07 20:37:26,709 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:37:26,710 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:37:26,710 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:37:26,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:37:26,710 INFO L82 PathProgramCache]: Analyzing trace with hash -622963045, now seen corresponding path program 1 times [2018-11-07 20:37:26,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:37:26,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:37:26,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:37:26,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:37:26,712 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:37:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:37:28,124 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 189 proven. 211 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:37:28,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:37:28,124 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:37:28,125 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 409 with the following transitions: [2018-11-07 20:37:28,125 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [850], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:37:28,127 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:37:28,127 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:37:28,182 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:37:28,392 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:37:28,393 INFO L272 AbstractInterpreter]: Visited 168 different actions 329 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:37:28,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:37:28,404 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:37:28,992 INFO L227 lantSequenceWeakener]: Weakened 81 states. On average, predicates are now at 77.44% of their original sizes. [2018-11-07 20:37:28,992 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:37:29,593 INFO L415 sIntCurrentIteration]: We unified 407 AI predicates to 407 [2018-11-07 20:37:29,593 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:37:29,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:37:29,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [12] total 28 [2018-11-07 20:37:29,594 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:37:29,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 20:37:29,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 20:37:29,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-11-07 20:37:29,596 INFO L87 Difference]: Start difference. First operand 3809 states and 4809 transitions. Second operand 18 states. [2018-11-07 20:37:49,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:37:49,735 INFO L93 Difference]: Finished difference Result 6498 states and 8571 transitions. [2018-11-07 20:37:49,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 20:37:49,735 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 408 [2018-11-07 20:37:49,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:37:49,752 INFO L225 Difference]: With dead ends: 6498 [2018-11-07 20:37:49,752 INFO L226 Difference]: Without dead ends: 4783 [2018-11-07 20:37:49,758 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 414 GetRequests, 385 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2018-11-07 20:37:49,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4783 states. [2018-11-07 20:37:49,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4783 to 4210. [2018-11-07 20:37:49,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4210 states. [2018-11-07 20:37:49,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4210 states to 4210 states and 5236 transitions. [2018-11-07 20:37:49,856 INFO L78 Accepts]: Start accepts. Automaton has 4210 states and 5236 transitions. Word has length 408 [2018-11-07 20:37:49,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:37:49,856 INFO L480 AbstractCegarLoop]: Abstraction has 4210 states and 5236 transitions. [2018-11-07 20:37:49,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 20:37:49,857 INFO L276 IsEmpty]: Start isEmpty. Operand 4210 states and 5236 transitions. [2018-11-07 20:37:50,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-11-07 20:37:50,343 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:37:50,343 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:37:50,344 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:37:50,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:37:50,344 INFO L82 PathProgramCache]: Analyzing trace with hash -976073869, now seen corresponding path program 1 times [2018-11-07 20:37:50,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:37:50,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:37:50,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:37:50,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:37:50,347 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:37:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:37:51,299 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 177 proven. 223 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:37:51,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:37:51,299 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:37:51,300 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 421 with the following transitions: [2018-11-07 20:37:51,300 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [879], [883], [887], [891], [895], [898], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:37:51,302 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:37:51,303 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:37:51,359 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:37:51,527 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:37:51,527 INFO L272 AbstractInterpreter]: Visited 180 different actions 353 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:37:51,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:37:51,539 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:37:51,967 INFO L227 lantSequenceWeakener]: Weakened 85 states. On average, predicates are now at 77.43% of their original sizes. [2018-11-07 20:37:51,968 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:37:52,452 INFO L415 sIntCurrentIteration]: We unified 419 AI predicates to 419 [2018-11-07 20:37:52,452 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:37:52,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:37:52,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [14] total 31 [2018-11-07 20:37:52,453 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:37:52,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 20:37:52,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 20:37:52,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-11-07 20:37:52,454 INFO L87 Difference]: Start difference. First operand 4210 states and 5236 transitions. Second operand 19 states. [2018-11-07 20:38:16,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:38:16,023 INFO L93 Difference]: Finished difference Result 7020 states and 9144 transitions. [2018-11-07 20:38:16,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 20:38:16,023 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 420 [2018-11-07 20:38:16,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:38:16,036 INFO L225 Difference]: With dead ends: 7020 [2018-11-07 20:38:16,036 INFO L226 Difference]: Without dead ends: 5305 [2018-11-07 20:38:16,042 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 428 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2018-11-07 20:38:16,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5305 states. [2018-11-07 20:38:16,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5305 to 4596. [2018-11-07 20:38:16,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4596 states. [2018-11-07 20:38:16,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4596 states to 4596 states and 5647 transitions. [2018-11-07 20:38:16,123 INFO L78 Accepts]: Start accepts. Automaton has 4596 states and 5647 transitions. Word has length 420 [2018-11-07 20:38:16,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:38:16,124 INFO L480 AbstractCegarLoop]: Abstraction has 4596 states and 5647 transitions. [2018-11-07 20:38:16,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 20:38:16,124 INFO L276 IsEmpty]: Start isEmpty. Operand 4596 states and 5647 transitions. [2018-11-07 20:38:16,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2018-11-07 20:38:16,137 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:38:16,137 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 20:38:16,138 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:38:16,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:38:16,138 INFO L82 PathProgramCache]: Analyzing trace with hash 886254657, now seen corresponding path program 1 times [2018-11-07 20:38:16,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:38:16,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:16,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:38:16,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:16,139 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:38:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:38:16,519 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-07 20:38:16,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:38:16,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:38:16,520 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:38:16,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:38:16,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:38:16,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:38:16,521 INFO L87 Difference]: Start difference. First operand 4596 states and 5647 transitions. Second operand 4 states. [2018-11-07 20:38:18,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:38:18,636 INFO L93 Difference]: Finished difference Result 9110 states and 11636 transitions. [2018-11-07 20:38:18,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 20:38:18,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 442 [2018-11-07 20:38:18,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:38:18,652 INFO L225 Difference]: With dead ends: 9110 [2018-11-07 20:38:18,652 INFO L226 Difference]: Without dead ends: 5263 [2018-11-07 20:38:18,663 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:38:18,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5263 states. [2018-11-07 20:38:18,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5263 to 5205. [2018-11-07 20:38:18,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5205 states. [2018-11-07 20:38:18,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5205 states to 5205 states and 6336 transitions. [2018-11-07 20:38:18,756 INFO L78 Accepts]: Start accepts. Automaton has 5205 states and 6336 transitions. Word has length 442 [2018-11-07 20:38:18,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:38:18,757 INFO L480 AbstractCegarLoop]: Abstraction has 5205 states and 6336 transitions. [2018-11-07 20:38:18,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:38:18,757 INFO L276 IsEmpty]: Start isEmpty. Operand 5205 states and 6336 transitions. [2018-11-07 20:38:18,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2018-11-07 20:38:18,772 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:38:18,772 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 20:38:18,772 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:38:18,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:38:18,773 INFO L82 PathProgramCache]: Analyzing trace with hash 185450881, now seen corresponding path program 1 times [2018-11-07 20:38:18,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:38:18,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:18,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:38:18,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:18,774 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:38:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:38:19,421 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 229 proven. 166 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2018-11-07 20:38:19,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:38:19,422 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:38:19,422 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 446 with the following transitions: [2018-11-07 20:38:19,422 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [666], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:38:19,425 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:38:19,425 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:38:19,541 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:38:20,192 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 20:38:20,192 INFO L272 AbstractInterpreter]: Visited 124 different actions 372 times. Merged at 7 different actions 24 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 20:38:20,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:38:20,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 20:38:20,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:38:20,202 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 20:38:20,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:38:20,213 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 20:38:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:38:20,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 20:38:20,931 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 525 proven. 2 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-11-07 20:38:20,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 20:38:21,193 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-07 20:38:21,937 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 229 proven. 166 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2018-11-07 20:38:21,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 20:38:21,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-07 20:38:21,958 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 20:38:21,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 20:38:21,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 20:38:21,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-07 20:38:21,960 INFO L87 Difference]: Start difference. First operand 5205 states and 6336 transitions. Second operand 9 states. [2018-11-07 20:38:27,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:38:27,236 INFO L93 Difference]: Finished difference Result 13568 states and 17369 transitions. [2018-11-07 20:38:27,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 20:38:27,236 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 445 [2018-11-07 20:38:27,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:38:27,258 INFO L225 Difference]: With dead ends: 13568 [2018-11-07 20:38:27,258 INFO L226 Difference]: Without dead ends: 6852 [2018-11-07 20:38:27,290 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 920 GetRequests, 897 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2018-11-07 20:38:27,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6852 states. [2018-11-07 20:38:27,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6852 to 5648. [2018-11-07 20:38:27,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5648 states. [2018-11-07 20:38:27,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5648 states to 5648 states and 7209 transitions. [2018-11-07 20:38:27,460 INFO L78 Accepts]: Start accepts. Automaton has 5648 states and 7209 transitions. Word has length 445 [2018-11-07 20:38:27,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:38:27,461 INFO L480 AbstractCegarLoop]: Abstraction has 5648 states and 7209 transitions. [2018-11-07 20:38:27,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 20:38:27,461 INFO L276 IsEmpty]: Start isEmpty. Operand 5648 states and 7209 transitions. [2018-11-07 20:38:27,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2018-11-07 20:38:27,476 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:38:27,477 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 20:38:27,477 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:38:27,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:38:27,477 INFO L82 PathProgramCache]: Analyzing trace with hash 916834010, now seen corresponding path program 1 times [2018-11-07 20:38:27,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:38:27,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:27,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:38:27,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:27,479 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:38:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:38:28,490 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:38:28,734 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 20:38:29,300 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 247 proven. 449 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:38:29,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:38:29,301 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:38:29,301 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 449 with the following transitions: [2018-11-07 20:38:29,301 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [566], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [666], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:38:29,304 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:38:29,305 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:38:29,445 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:38:29,857 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 20:38:29,857 INFO L272 AbstractInterpreter]: Visited 124 different actions 365 times. Merged at 7 different actions 17 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-07 20:38:29,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:38:29,891 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 20:38:29,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:38:29,891 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 20:38:29,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:38:29,908 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 20:38:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:38:30,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 20:38:30,909 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2018-11-07 20:38:30,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 20:38:31,583 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2018-11-07 20:38:31,620 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:38:31,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [15] total 17 [2018-11-07 20:38:31,621 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:38:31,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 20:38:31,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 20:38:31,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-11-07 20:38:31,622 INFO L87 Difference]: Start difference. First operand 5648 states and 7209 transitions. Second operand 3 states. [2018-11-07 20:38:33,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:38:33,094 INFO L93 Difference]: Finished difference Result 12600 states and 16755 transitions. [2018-11-07 20:38:33,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 20:38:33,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 448 [2018-11-07 20:38:33,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:38:33,096 INFO L225 Difference]: With dead ends: 12600 [2018-11-07 20:38:33,096 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 20:38:33,129 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 911 GetRequests, 895 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-11-07 20:38:33,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 20:38:33,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 20:38:33,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 20:38:33,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 20:38:33,130 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 448 [2018-11-07 20:38:33,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:38:33,131 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 20:38:33,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 20:38:33,131 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 20:38:33,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 20:38:33,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 20:38:33,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:38:33,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:38:33,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:38:33,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:38:33,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:38:33,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:38:33,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:38:33,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:38:33,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:38:33,833 WARN L179 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2018-11-07 20:38:34,114 WARN L179 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 52 [2018-11-07 20:38:35,429 WARN L179 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 221 DAG size of output: 88 [2018-11-07 20:38:35,864 WARN L179 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 62 [2018-11-07 20:38:36,107 WARN L179 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 62 [2018-11-07 20:38:36,111 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 20:38:36,111 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a12~0 |old(~a12~0)|) (= ~a21~0 |old(~a21~0)|) (= |old(~a15~0)| ~a15~0)) [2018-11-07 20:38:36,111 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 20:38:36,112 INFO L425 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-11-07 20:38:36,112 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-11-07 20:38:36,112 INFO L425 ceAbstractionStarter]: For program point L168(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,112 INFO L425 ceAbstractionStarter]: For program point L102(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,112 INFO L425 ceAbstractionStarter]: For program point L36(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,112 INFO L425 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-11-07 20:38:36,112 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-07 20:38:36,112 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-07 20:38:36,112 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-07 20:38:36,113 INFO L425 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-11-07 20:38:36,113 INFO L425 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-11-07 20:38:36,113 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-11-07 20:38:36,113 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-11-07 20:38:36,113 INFO L425 ceAbstractionStarter]: For program point L171(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,113 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,113 INFO L425 ceAbstractionStarter]: For program point L39(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,113 INFO L425 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-11-07 20:38:36,113 INFO L425 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-11-07 20:38:36,114 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-07 20:38:36,114 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-07 20:38:36,114 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-07 20:38:36,114 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-11-07 20:38:36,114 INFO L425 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-11-07 20:38:36,114 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-11-07 20:38:36,114 INFO L425 ceAbstractionStarter]: For program point L174(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,114 INFO L425 ceAbstractionStarter]: For program point L108(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,114 INFO L425 ceAbstractionStarter]: For program point L42(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,114 INFO L425 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-11-07 20:38:36,115 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-07 20:38:36,115 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-07 20:38:36,115 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-07 20:38:36,115 INFO L425 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-11-07 20:38:36,115 INFO L425 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-11-07 20:38:36,115 INFO L425 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-11-07 20:38:36,115 INFO L425 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-11-07 20:38:36,115 INFO L425 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-11-07 20:38:36,115 INFO L425 ceAbstractionStarter]: For program point L177(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,116 INFO L425 ceAbstractionStarter]: For program point L111(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,116 INFO L425 ceAbstractionStarter]: For program point L45(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,116 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-11-07 20:38:36,116 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-07 20:38:36,116 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-07 20:38:36,116 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-07 20:38:36,116 INFO L425 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-11-07 20:38:36,116 INFO L425 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-11-07 20:38:36,116 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-11-07 20:38:36,117 INFO L425 ceAbstractionStarter]: For program point L180(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,117 INFO L425 ceAbstractionStarter]: For program point L114(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,117 INFO L425 ceAbstractionStarter]: For program point L48(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,117 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-11-07 20:38:36,117 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-07 20:38:36,117 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-07 20:38:36,117 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-07 20:38:36,117 INFO L425 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-11-07 20:38:36,117 INFO L425 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-11-07 20:38:36,118 INFO L425 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-11-07 20:38:36,118 INFO L425 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-11-07 20:38:36,118 INFO L425 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-11-07 20:38:36,118 INFO L425 ceAbstractionStarter]: For program point L183(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,118 INFO L425 ceAbstractionStarter]: For program point L117(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,118 INFO L425 ceAbstractionStarter]: For program point L51(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,118 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,118 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-11-07 20:38:36,118 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-07 20:38:36,119 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-07 20:38:36,119 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-07 20:38:36,119 INFO L425 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-11-07 20:38:36,119 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-11-07 20:38:36,119 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 106) no Hoare annotation was computed. [2018-11-07 20:38:36,119 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-11-07 20:38:36,119 INFO L425 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-11-07 20:38:36,119 INFO L425 ceAbstractionStarter]: For program point L186(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,119 INFO L425 ceAbstractionStarter]: For program point L120(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,120 INFO L425 ceAbstractionStarter]: For program point L54(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,120 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-07 20:38:36,120 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-07 20:38:36,120 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-07 20:38:36,120 INFO L425 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-11-07 20:38:36,120 INFO L425 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-11-07 20:38:36,120 INFO L425 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-11-07 20:38:36,120 INFO L425 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-11-07 20:38:36,120 INFO L425 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-11-07 20:38:36,120 INFO L425 ceAbstractionStarter]: For program point L189(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,120 INFO L425 ceAbstractionStarter]: For program point L123(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,121 INFO L425 ceAbstractionStarter]: For program point L57(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,121 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-11-07 20:38:36,121 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-11-07 20:38:36,121 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-07 20:38:36,121 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-07 20:38:36,121 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-07 20:38:36,121 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-11-07 20:38:36,122 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 872) the Hoare annotation is: (let ((.cse3 (< |calculate_output_#in~input| 1)) (.cse1 (< 6 |calculate_output_#in~input|)) (.cse0 (= ~a24~0 1)) (.cse4 (< |old(~a21~0)| 6)) (.cse2 (not (= 1 |old(~a24~0)|))) (.cse8 (not (= 0 (+ |old(~a12~0)| 49)))) (.cse9 (< 8 |old(~a15~0)|)) (.cse6 (< 7 |old(~a21~0)|)) (.cse10 (<= |old(~a12~0)| 11)) (.cse5 (= 7 |old(~a21~0)|)) (.cse11 (and (= ~a12~0 |old(~a12~0)|) (= ~a21~0 |old(~a21~0)|) (= |old(~a15~0)| ~a15~0))) (.cse7 (= 6 |old(~a15~0)|)) (.cse12 (= 9 |old(~a15~0)|))) (and (or .cse0 (or .cse1 (< 10 |old(~a21~0)|) .cse2 (not (= 8 |old(~a15~0)|)) (< |old(~a21~0)| 7) .cse3)) (or .cse4 .cse5 (not (= 4 ~inputD~0)) .cse6 .cse3 .cse1 (< |old(~a15~0)| 5) (not (= ~inputE~0 5)) .cse7 (not (= ~inputA~0 1)) (not (= 3 ~inputC~0)) .cse0 (not (= 2 ~inputB~0)) .cse2 .cse8 .cse9 (not (= ~inputF~0 6))) (or .cse0 (or .cse4 .cse2 .cse8 .cse9 .cse6 (< |old(~a15~0)| 6)) .cse5 .cse7) (or .cse5 .cse10 .cse11) (or .cse5 (= 8 |old(~a21~0)|) .cse11) (or (not .cse12) .cse11 .cse10) (or .cse5 .cse11 .cse7) (or .cse11 .cse7 .cse12))) [2018-11-07 20:38:36,122 INFO L425 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-11-07 20:38:36,122 INFO L425 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-11-07 20:38:36,122 INFO L425 ceAbstractionStarter]: For program point L192(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,122 INFO L425 ceAbstractionStarter]: For program point L126(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,122 INFO L425 ceAbstractionStarter]: For program point L60(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,122 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-07 20:38:36,122 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-07 20:38:36,122 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-07 20:38:36,123 INFO L425 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-11-07 20:38:36,123 INFO L425 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-11-07 20:38:36,123 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-11-07 20:38:36,123 INFO L425 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-11-07 20:38:36,123 INFO L425 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-11-07 20:38:36,123 INFO L425 ceAbstractionStarter]: For program point L195(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,123 INFO L425 ceAbstractionStarter]: For program point L129(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,123 INFO L425 ceAbstractionStarter]: For program point L63(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,123 INFO L425 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-11-07 20:38:36,123 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-11-07 20:38:36,124 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-07 20:38:36,124 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-07 20:38:36,124 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-07 20:38:36,124 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-11-07 20:38:36,124 INFO L425 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-11-07 20:38:36,124 INFO L425 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-11-07 20:38:36,124 INFO L425 ceAbstractionStarter]: For program point L198(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,124 INFO L425 ceAbstractionStarter]: For program point L132(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,124 INFO L425 ceAbstractionStarter]: For program point L66(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,124 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-11-07 20:38:36,125 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-07 20:38:36,125 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-07 20:38:36,125 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-07 20:38:36,125 INFO L425 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-11-07 20:38:36,125 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-11-07 20:38:36,125 INFO L425 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-11-07 20:38:36,125 INFO L425 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-11-07 20:38:36,125 INFO L425 ceAbstractionStarter]: For program point L201(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,125 INFO L425 ceAbstractionStarter]: For program point L135(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,125 INFO L425 ceAbstractionStarter]: For program point L69(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,126 INFO L425 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-11-07 20:38:36,126 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-07 20:38:36,126 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-07 20:38:36,126 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-07 20:38:36,126 INFO L425 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-11-07 20:38:36,126 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-11-07 20:38:36,126 INFO L425 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-11-07 20:38:36,126 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-11-07 20:38:36,126 INFO L425 ceAbstractionStarter]: For program point L138(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,126 INFO L425 ceAbstractionStarter]: For program point L72(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,127 INFO L425 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-11-07 20:38:36,127 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-07 20:38:36,127 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-07 20:38:36,127 INFO L425 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-11-07 20:38:36,127 INFO L425 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-11-07 20:38:36,127 INFO L425 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-11-07 20:38:36,127 INFO L425 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-11-07 20:38:36,127 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-11-07 20:38:36,127 INFO L425 ceAbstractionStarter]: For program point L141(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,127 INFO L425 ceAbstractionStarter]: For program point L75(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,127 INFO L425 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-11-07 20:38:36,128 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-07 20:38:36,128 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-07 20:38:36,128 INFO L425 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-11-07 20:38:36,128 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-11-07 20:38:36,128 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-11-07 20:38:36,128 INFO L425 ceAbstractionStarter]: For program point L144(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,128 INFO L425 ceAbstractionStarter]: For program point L78(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,128 INFO L425 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-11-07 20:38:36,128 INFO L425 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-11-07 20:38:36,128 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-07 20:38:36,128 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-07 20:38:36,128 INFO L425 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-11-07 20:38:36,128 INFO L425 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-11-07 20:38:36,128 INFO L425 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-11-07 20:38:36,129 INFO L425 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-11-07 20:38:36,129 INFO L425 ceAbstractionStarter]: For program point L147(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,129 INFO L425 ceAbstractionStarter]: For program point L81(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,129 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-11-07 20:38:36,129 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-11-07 20:38:36,129 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-07 20:38:36,129 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-07 20:38:36,129 INFO L425 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-11-07 20:38:36,129 INFO L425 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-11-07 20:38:36,130 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-11-07 20:38:36,130 INFO L425 ceAbstractionStarter]: For program point L150(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,130 INFO L425 ceAbstractionStarter]: For program point L84(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,130 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,130 INFO L425 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-11-07 20:38:36,130 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-11-07 20:38:36,130 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-07 20:38:36,130 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-07 20:38:36,130 INFO L425 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-11-07 20:38:36,131 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-11-07 20:38:36,131 INFO L425 ceAbstractionStarter]: For program point L153(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,131 INFO L425 ceAbstractionStarter]: For program point L87(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,131 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-07 20:38:36,131 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,131 INFO L425 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-11-07 20:38:36,131 INFO L425 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-11-07 20:38:36,131 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-11-07 20:38:36,131 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-07 20:38:36,131 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-07 20:38:36,132 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-07 20:38:36,132 INFO L425 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-11-07 20:38:36,132 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-11-07 20:38:36,132 INFO L425 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-11-07 20:38:36,132 INFO L425 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-11-07 20:38:36,132 INFO L425 ceAbstractionStarter]: For program point L156(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,132 INFO L425 ceAbstractionStarter]: For program point L90(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,132 INFO L425 ceAbstractionStarter]: For program point L24(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,132 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-11-07 20:38:36,133 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-07 20:38:36,133 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-07 20:38:36,133 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-07 20:38:36,133 INFO L425 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-11-07 20:38:36,133 INFO L425 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-11-07 20:38:36,133 INFO L425 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-11-07 20:38:36,133 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-11-07 20:38:36,133 INFO L425 ceAbstractionStarter]: For program point L159(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,133 INFO L425 ceAbstractionStarter]: For program point L93(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,133 INFO L425 ceAbstractionStarter]: For program point L27(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,134 INFO L425 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-11-07 20:38:36,134 INFO L425 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-11-07 20:38:36,134 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-07 20:38:36,134 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-07 20:38:36,134 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-07 20:38:36,134 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-11-07 20:38:36,134 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-11-07 20:38:36,134 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-11-07 20:38:36,134 INFO L425 ceAbstractionStarter]: For program point L162(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,134 INFO L425 ceAbstractionStarter]: For program point L96(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,135 INFO L425 ceAbstractionStarter]: For program point L30(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,135 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-11-07 20:38:36,135 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-07 20:38:36,135 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-07 20:38:36,135 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-07 20:38:36,135 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-11-07 20:38:36,135 INFO L425 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-11-07 20:38:36,135 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-11-07 20:38:36,135 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-11-07 20:38:36,135 INFO L425 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-11-07 20:38:36,136 INFO L425 ceAbstractionStarter]: For program point L165(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,136 INFO L425 ceAbstractionStarter]: For program point L99(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,136 INFO L425 ceAbstractionStarter]: For program point L33(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:38:36,136 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-11-07 20:38:36,136 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-07 20:38:36,136 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-07 20:38:36,136 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-07 20:38:36,136 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-11-07 20:38:36,136 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 20:38:36,137 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~inputF~0 6) (= ~inputA~0 1) (= ~inputC~0 3) (= ~a15~0 8) (= (+ ~a12~0 49) 0) (= ~inputB~0 2) (= ~a24~0 1) (= ~inputE~0 5) (= ~a21~0 7) (= ~inputD~0 4)) [2018-11-07 20:38:36,137 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 20:38:36,137 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 20:38:36,137 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 874 890) the Hoare annotation is: (or (not (= |old(~a15~0)| 8)) (and (= (+ ~a12~0 49) 0) (= ~a21~0 7) (= |old(~a15~0)| ~a15~0) (= ~a24~0 1)) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= ~inputA~0 1)) (not (= 3 ~inputC~0)) (not (= 2 ~inputB~0)) (not (= 1 |old(~a24~0)|)) (not (= |old(~a21~0)| 7)) (not (= 0 (+ |old(~a12~0)| 49))) (not (= ~inputF~0 6))) [2018-11-07 20:38:36,137 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 874 890) no Hoare annotation was computed. [2018-11-07 20:38:36,137 INFO L421 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (let ((.cse1 (not (= ~a21~0 7))) (.cse2 (< 11 ~a12~0)) (.cse0 (not (= 6 ~a15~0)))) (or (and .cse0 .cse1) (not (= |old(~a15~0)| 8)) (and .cse2 .cse1) (and (not (= ~a21~0 8)) .cse1) (and .cse2 (= 9 ~a15~0)) (not (= 4 ~inputD~0)) (and (not (= ~a15~0 9)) .cse0) (not (= ~inputE~0 5)) (not (= ~inputA~0 1)) (not (= 3 ~inputC~0)) (not (= 2 ~inputB~0)) (not (= 1 |old(~a24~0)|)) (not (= |old(~a21~0)| 7)) (not (= 0 (+ |old(~a12~0)| 49))) (not (= ~inputF~0 6)))) [2018-11-07 20:38:36,137 INFO L425 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2018-11-07 20:38:36,138 INFO L425 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-11-07 20:38:36,138 INFO L425 ceAbstractionStarter]: For program point L880-1(lines 880 889) no Hoare annotation was computed. [2018-11-07 20:38:36,138 INFO L421 ceAbstractionStarter]: At program point L880-3(lines 880 889) the Hoare annotation is: (let ((.cse1 (not (= ~a21~0 7))) (.cse2 (< 11 ~a12~0)) (.cse0 (not (= 6 ~a15~0)))) (or (and .cse0 .cse1) (not (= |old(~a15~0)| 8)) (and .cse2 .cse1) (and (not (= ~a21~0 8)) .cse1) (and .cse2 (= 9 ~a15~0)) (not (= 4 ~inputD~0)) (and (not (= ~a15~0 9)) .cse0) (not (= ~inputE~0 5)) (not (= ~inputA~0 1)) (not (= 3 ~inputC~0)) (not (= 2 ~inputB~0)) (not (= 1 |old(~a24~0)|)) (not (= |old(~a21~0)| 7)) (not (= 0 (+ |old(~a12~0)| 49))) (not (= ~inputF~0 6)))) [2018-11-07 20:38:36,138 INFO L425 ceAbstractionStarter]: For program point L880-4(lines 874 890) no Hoare annotation was computed. [2018-11-07 20:38:36,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:38:36 BoogieIcfgContainer [2018-11-07 20:38:36,151 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 20:38:36,152 INFO L168 Benchmark]: Toolchain (without parser) took 193458.22 ms. Allocated memory was 1.5 GB in the beginning and 4.7 GB in the end (delta: 3.2 GB). Free memory was 1.4 GB in the beginning and 3.4 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-11-07 20:38:36,153 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 20:38:36,153 INFO L168 Benchmark]: CACSL2BoogieTranslator took 826.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. [2018-11-07 20:38:36,154 INFO L168 Benchmark]: Boogie Procedure Inliner took 151.23 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -834.6 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. [2018-11-07 20:38:36,155 INFO L168 Benchmark]: Boogie Preprocessor took 106.09 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 20:38:36,155 INFO L168 Benchmark]: RCFGBuilder took 3995.07 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 128.9 MB). Peak memory consumption was 128.9 MB. Max. memory is 7.1 GB. [2018-11-07 20:38:36,156 INFO L168 Benchmark]: TraceAbstraction took 188373.60 ms. Allocated memory was 2.3 GB in the beginning and 4.7 GB in the end (delta: 2.4 GB). Free memory was 2.1 GB in the beginning and 3.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-11-07 20:38:36,161 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 826.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 151.23 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -834.6 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 106.09 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3995.07 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 128.9 MB). Peak memory consumption was 128.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 188373.60 ms. Allocated memory was 2.3 GB in the beginning and 4.7 GB in the end (delta: 2.4 GB). Free memory was 2.1 GB in the beginning and 3.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 106]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: ((((((((((((((!(6 == a15) && !(a21 == 7)) || !(\old(a15) == 8)) || (11 < a12 && !(a21 == 7))) || (!(a21 == 8) && !(a21 == 7))) || (11 < a12 && 9 == a15)) || !(4 == inputD)) || (!(a15 == 9) && !(6 == a15))) || !(inputE == 5)) || !(inputA == 1)) || !(3 == inputC)) || !(2 == inputB)) || !(1 == \old(a24))) || !(\old(a21) == 7)) || !(0 == \old(a12) + 49)) || !(inputF == 6) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. SAFE Result, 188.2s OverallTime, 14 OverallIterations, 5 TraceHistogramMax, 154.9s AutomataDifference, 0.0s DeadEndRemovalTime, 2.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 2826 SDtfs, 24552 SDslu, 2148 SDs, 0 SdLazy, 30450 SolverSat, 3480 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 55.9s Time, PredicateUnifierStatistics: 16 DeclaredPredicates, 4511 GetRequests, 4259 SyntacticMatches, 22 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1129 ImplicationChecksByTransitivity, 9.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5648occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.8s AbstIntTime, 10 AbstIntIterations, 8 AbstIntStrong, 0.9970391977822854 AbsIntWeakeningRatio, 0.09682416731216112 AbsIntAvgWeakeningVarsNumRemoved, 13.597986057319908 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 4380 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 134 PreInvPairs, 198 NumberOfFragments, 495 HoareAnnotationTreeSize, 134 FomulaSimplifications, 6633 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 4028 FormulaSimplificationTreeSizeReductionInter, 2.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 12.3s InterpolantComputationTime, 5159 NumberOfCodeBlocks, 5159 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 6034 ConstructedInterpolants, 0 QuantifiedInterpolants, 11037020 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1406 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 5726/7306 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...